PODC 2006 - PDF Preprint Papers

PODC 2006 Annual ACM Symposium on Principles of Distributed Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed PODC-2006 Paper

click to vote

PODC
2006
ACM

342views Distributed And Parallel Com...» more PODC 2006»

Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling

13 years 10 months ago

Download www.ncl.cs.columbia.edu

We present Grouped Distributed Queues (GDQ), the ﬁrst proportional share scheduler for multiprocessor systems that scales well with a large number of processors and processes. G...

Bogdan Caprita, Jason Nieh, Clifford Stein

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	342	Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling	claim
2	173	Object location using path separators	claim
3	172	Computing separable functions via gossip	claim
4	157	Local approximation schemes for topology control	claim
5	142	Sketching asynchronous streams over a sliding window	claim
6	134	On the complexity of distributed graph coloring	claim
7	133	Optimal-stretch name-independent compact routing in doubling metrics	claim
8	127	Common2 extended to stacks and unbounded concurrency	claim
9	124	Stably computable predicates are semilinear	claim
10	120	The art of multiprocessor programming	claim
11	117	Adversarial queuing on the multiple-access channel	claim
12	113	Timeliness, failure-detectors, and consensus performance	claim
13	99	Self-stabilizing byzantine agreement	claim
14	99	Reliable broadcast in radio networks: the bounded collision case	claim
15	98	Quorum placement in networks: minimizing network congestion	claim
16	96	Oracle size: a new measure of difficulty for communication tasks	claim
17	96	An O(1) RMRs leader election algorithm	claim
18	93	An Omega (n log n) lower bound on the cost of mutual exclusion	claim
19	90	Synchronizing without locks is inherently expensive	claim
20	90	Peer counting and sampling in overlay networks: random walk methods	claim
21	77	Transactional contention management as a non-clairvoyant scheduling problem	claim
22	77	Veracity radius: capturing the locality of distributed computations	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers