SPAA 2005 - PDF Preprint Papers

SPAA 2005 ACM Symposium on Parallel Algorithms and Architectures

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SPAA-2005 Paper

click to vote

SPAA
2005
ACM

168views Distributed And Parallel Com...» more SPAA 2005»

Dynamic circular work-stealing deque

13 years 10 months ago

Download labs.oracle.com

The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (henceforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of ch...

David Chase, Yossi Lev

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	168	Dynamic circular work-stealing deque	claim
2	129	Constant density spanners for wireless ad-hoc networks	claim
3	129	Weighted distributed hash tables	claim
4	127	Oblivious routing on geometric networks	claim
5	125	Admission control to minimize rejections and online set cover with repetitions	claim
6	123	Dynamic page migration with stochastic requests	claim
7	118	Randomization does not reduce the average delay in parallel packet switches	claim
8	114	Collaborate with strangers to find own preferences	claim
9	113	On distributed smooth scheduling	claim
10	103	Value-maximizing deadline scheduling and its application to animation rendering	claim
11	103	A space lower bound for name-independent compact routing in trees	claim
12	102	Coloring unstructured radio networks	claim
13	101	The expansion and mixing time of skip graphs with applications	claim
14	100	Using elimination to implement scalable and lock-free FIFO queues	claim
15	97	Decentralized algorithms using both local and random probes for P2P load balancing	claim
16	94	Concurrent cache-oblivious b-trees	claim
17	94	Peer-to-peer networks based on random transformations of connected regular undirected graphs	claim
18	93	Fast construction of overlay networks	claim
19	88	Finding effective support-tree preconditioners	claim
20	86	Broadcasting on networks of workstations	claim
21	84	Is partial quantum search of a database any easier?	claim
22	81	Autonomous virtual mobile nodes	claim
23	81	Efficient algorithms for verifying memory consistency	claim
24	79	Irrigating ad hoc networks in constant time	claim
25	75	Name independent routing for growth bounded networks	claim
26	71	Parallelizing time with polynomial circuits	claim
27	70	Windows scheduling of arbitrary length jobs on parallel machines	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers