Name
Abstract | ||
|---|---|---|
This paper explores the potential of utilizing approximate system load information to enhance work stealing for dynamic load balancing in hierarchical multicore systems. Maintaining information about the load of a system has not been extensively researched since it is assumed to introduce performance overheads. We propose SWAS, a lightweight approximate scheme for retrieving and using such information, based on compact bit vector structures and lightweight update operations. This approximate information is used to enhance the effectiveness of work stealing decisions. Evaluating SWAS for a number of representative scenarios on a multi-socket multi-core platform showed that work stealing guided by approximate system load information achieves considerable performance improvements: up to 18.5% for dynamic, severely imbalanced workloads; and up to 34.4% for workloads with complex task dependencies, when compared with random work stealing. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/ICPPW.2017.51 | 2017 46th International Conference on Parallel Processing Workshops (ICPPW) |
Keywords | Field | DocType |
work stealing,resource management,runtime systems,approximate information | Resource management,Load management,Data structure,Computer science,Parallel computing,Work stealing,Dynamic load balancing,Bit array,Multi-core processor,Distributed computing,Overhead (business) | Conference |
ISSN | ISBN | Citations |
1530-2016 | 978-1-5386-1045-9 | 0 |
PageRank | References | Authors |
0.34 | 13 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stavros Tzilis | 1 | 9 | 3.58 |
| Miquel Pericàs | 2 | 101 | 14.50 |
| Pedro Trancoso | 3 | 377 | 43.79 |
| Ioannis Sourdis | 4 | 456 | 44.17 |