Name
Abstract | ||
|---|---|---|
Shared memory machines continue to increase in scale by adding more parallelism through additional cores and complex memory hierarchies. Often, executing multiple applications concurrently, dividing among them hardware threads, provides greater efficiency rather than executing a single application with large thread counts. However, contention for shared resources can limit the improvement of concurrent application execution: orchestrating the number of threads used by each application and is essential.
In this article, we contribute SCALO, a solution to orchestrate concurrent application execution to increase throughput. SCALO monitors co-executing applications at runtime to evaluate their scalability. Its optimizing thread allocator analyzes these scalability estimates to adapt the parallelism of each program. Unlike previous approaches, SCALO differs by including dynamic contention effects on scalability and by controlling the parallelism during the execution of parallel regions. Thus, it improves throughput when other state-of-the-art approaches fail and outperforms them by up to 40% when they succeed.
|
Year | DOI | Venue |
|---|---|---|
2017 | 10.1145/3158643 | TACO |
Keywords | Field | DocType |
Multi-program co-scheduling, dynamic concurrency throttling, speedup modeling | Shared memory,Computer science,Parallel computing,Multi threaded,Thread (computing),Throughput,Allocator,Orchestration (computing),Scalability | Journal |
Volume | Issue | ISSN |
14 | 4 | 1544-3566 |
Citations | PageRank | References |
1 | 0.37 | 21 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Giorgis Georgakoudis | 1 | 34 | 6.86 |
| Hans Vandierendonck | 2 | 629 | 54.43 |
| Peter Thoman | 3 | 79 | 13.20 |
| de Supinski, Bronis R. | 4 | 2667 | 154.44 |
| Thomas Fahringer | 5 | 2847 | 254.09 |
| Dimitrios S. Nikolopoulos | 6 | 1469 | 128.40 |