SPAA 2010 - PDF Preprint Papers

SPAA 2010 ACM Symposium on Parallel Algorithms and Architectures

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SPAA-2010 Paper

click to vote

SPAA
2010
ACM

127views Distributed And Parallel Com...» more SPAA 2010»

Flat combining and the synchronization-parallelism tradeoff

1 years 10 months ago

Download www.cs.bgu.ac.il

Traditional data structure designs, whether lock-based or lock-free, provide parallelism via ﬁne grained synchronization among threads. We introduce a new synchronization paradi...

Danny Hendler, Itai Incze, Nir Shavit, Moran Tzafr...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status
1	127	Flat combining and the synchronization-parallelism tradeoff	claim
2	93	Implementing and evaluating nested parallel transactions in software transactional memory	claim
3	88	Lightweight, robust adaptivity for software transactional memory	claim
4	86	TLRW: return of the read-write lock	claim
5	85	Basic network creation games	claim
6	83	Brief announcement: byzantine agreement with homonyms	claim
7	83	Low depth cache-oblivious algorithms	claim
8	81	Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks	claim
9	80	Deadlock avoidance for streaming computations with filtering	claim
10	74	Brief announcement: locality-aware load balancing for speculatively-parallelized irregular applications	claim
11	74	Securing every bit: authenticated broadcast in radio networks	claim
12	73	Brief announcement: serial-parallel reciprocity in dynamic multithreaded languages	claim
13	73	Low-contention data structures	claim
14	71	Towards optimizing energy costs of algorithms for shared memory architectures	claim
15	71	New algorithms for efficient parallel string comparison	claim
16	70	Brief announcement: Lower bounds on communication for sparse Cholesky factorization of a model problem	claim
17	67	Managing the complexity of lookahead for LU factorization with pivoting	claim
18	65	Best-effort group service in dynamic networks	claim
19	65	Parallel approximation algorithms for facility-location problems	claim
20	65	Multi-sided shared coins and randomized set-agreement	claim
21	64	Scheduling jobs with varying parallelizability to reduce variance	claim
22	64	On the bit communication complexity of randomized rumor spreading	claim
23	64	Scheduling to minimize power consumption using submodular functions	claim
24	64	Transactions in the jungle	claim
25	63	Tree network coding for peer-to-peer networks	claim
26	62	Simplifying concurrent algorithms by exploiting hardware transactional memory	claim
27	60	Collaborative scoring with dishonest participants	claim
28	58	Buffer-space efficient and deadlock-free scheduling of stream applications on multi-core architectures	claim
29	58	Online capacity maximization in wireless networks	claim
30	57	Brief announcement: on speculative replication of transactional systems	claim
31	57	Delays induce an exponential memory gap for rendezvous in trees	claim
32	53	Computing the throughput of probabilistic and replicated streaming applications	claim
33	53	A universal construction for wait-free transaction friendly data structures	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers