Work dealing

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2002, Pages 164-172

  Hendler, Danny ^a   Shavit, Nir ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Distributed; Load balancing; Wait free

Indexed keywords

DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; PROBABILITY; RESOURCE ALLOCATION; STORAGE ALLOCATION (COMPUTER); THEOREM PROVING;

LOAD-BALANCING; WAIT-FREE; WORK DEALING;

ALGORITHMS;

EID: 0036954486     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/564870.564900     Document Type: Conference Paper

References (14)

1. Acar, U. A., Blelloch, G. E., and Blumofe, R. D. The data locality of work stealing. In ACM Symposium on Parallel Algorithms and Architectures (2000), pp. 1-12.
2. Arora, N. S., Blumofe, R. D., and PLaxton, C. G. Thread scheduling for multiprogrammed multiprocessors. Theory of Computing Systems 34, 2 (2001), 115-144.
3. Berenbrink, P., Friedetzky, T., and Goldberg, L. A. The natural work-stealing algorithm is stable. In Proceedings of the 42th IEEE Symposium on Foundations of Computer Science (FOCS) (2001), pp. 178-187.
4. Detlefs, D. L., Martin, P. A., Moir, M., and Jr., G. L. S. Lock-free reference counting. In Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing (2001).
5. Flood, C., Detlefs, D., Shavit, N., and Zhang, C. Parallel garbage collection for shared memory multiprocessors. In Usenix Java Virtual Machine Research and Technology Symposium (JVM '01) (Monterey, CA, Apr. 2001).
6. Hendler, D., and Shavit, N. Non-blocking steal-half work queues. In Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing (2002).
7. Herlihy, M., Luchangco, V., Martin, P., and Moir, M. Dynamic-sized lockfree data structures, 2002. Technical Report TR-2002-110, Sun Microsystems Laboratories.
8. Lamport, L. Specifying concurrent program modules, 1993.
9. Luling, R., and Monien, B. A dynamic distributed load balancing algorithm with provable good performance. In ACM Symposium on Parallel Algorithms and Architectures (1993), pp. 164-172.
10. Michael, M. M., and Scott, M. L. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In Symposium on Principles of Distributed Computing (1996), pp. 267-275.
11. Mitzenmacher, M. Analysis of load stealing models based on differential equations. In ACM Symposium on Parallel Algorithms and Architectures (1998), pp. 212-221.
12. Narlikar, G. J. Scheduling threads for low space requirement and good locality. In ACM Symposium on Parallel Algorithms and Architectures (1999), pp. 83-95.
13. Rudolph, L., Slivkin-Allalouf, M., and Upfal, E. A simple load balancing scheme for task allocation in parallel machines. In ACM Symposium on Parallel Algorithms and Architectures (1991), pp. 237-245.
14. Shavit, N., and Touitou, D. Elimination trees and the construction of pools and stacks. Theory of Computing Systems, 30 (1997), 645-670.