Abstract
This paper introduces work-dealing, a new algorithm for "locality oriented" load distribution on small scale shared memory multi-processors. Its key feature is an unprecedented low overhead mechanism (only a couple of loads and stores per operation, and no costly compare-and-swaps) for dealing-out work to processors in a globally balanced way. We believe that for applications in which work-items have process affinity, especially applications running in dedicated mode ("stand alone"), work-dealing could prove a worthy alternative to the popular work-stealing paradigm.
Original language | English |
---|---|
Pages | 164-172 |
Number of pages | 9 |
DOIs | |
State | Published - 1 Jan 2002 |
Externally published | Yes |
Event | Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures - Winnipeg, MAN., Canada Duration: 10 Aug 2002 → 13 Aug 2002 |
Conference
Conference | Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures |
---|---|
Country/Territory | Canada |
City | Winnipeg, MAN. |
Period | 10/08/02 → 13/08/02 |
Keywords
- Distributed
- Load-balancing
- Wait-free
ASJC Scopus subject areas
- Software
- Safety, Risk, Reliability and Quality