Sciweavers

506 search results - page 8 / 102
» Distributing synchronous programs using bounded queues
Sort
View
SPAA
2009
ACM
14 years 8 months ago
Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures
Work stealing is a popular method of scheduling fine-grained parallel tasks. The performance of work stealing has been extensively studied, both theoretically and empirically, but...
Daniel Spoonhower, Guy E. Blelloch, Phillip B. Gib...
SPAA
2006
ACM
14 years 1 months ago
A performance analysis of local synchronization
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...
Julia Lipman, Quentin F. Stout
SIGCOMM
1996
ACM
13 years 11 months ago
Hierarchical Packet Fair Queueing Algorithms
Hierarchical Packet Fair Queueing (H-PFQ)algorithms have the potential to simultaneously support guaranteed realtime service, rate-adaptive best-eort, and controlled linksharing s...
Jon C. R. Bennett, Hui Zhang
SEUS
2008
IEEE
14 years 1 months ago
On Scalable Synchronization for Distributed Embedded Real-Time Systems
Abstract. We consider the problem of programming distributed embedded real-time systems with distributed dependencies. We show that the de facto standard of using locks and conditi...
Sherif Fadel Fahmy, Binoy Ravindran, E. Douglas Je...
ICS
1999
Tsinghua U.
13 years 11 months ago
Eliminating synchronization bottlenecks in object-based programs using adaptive replication
This paper presents a technique, adaptive replication, for automatically eliminating synchronization bottlenecks in multithreaded programs that perform atomic operations on object...
Martin C. Rinard, Pedro C. Diniz