Transparently Space Sharing a Multicore Among Multiple Processes
| Autor: | Rajeev Barua, Timothy Creech |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Profiling (computer programming)
020203 distributed computing Multi-core processor Computer science Distributed computing 020206 networking & telecommunications 02 engineering and technology Thread (computing) Parallel computing Computer Science Applications Scheduling (computing) Computational Theory and Mathematics Hardware and Architecture Modeling and Simulation Scalability 0202 electrical engineering electronic engineering information engineering Threading (manufacturing) Computer multitasking Daemon Software Space sharing |
| Zdroj: | ACM Transactions on Parallel Computing. 3:1-35 |
| ISSN: | 2329-4957 2329-4949 |
| DOI: | 10.1145/3001910 |
| Popis: | As hardware becomes increasingly parallel and the availability of scalable parallel software improves, the problem of managing multiple multithreaded applications (processes) becomes important. Malleable processes, which can vary the number of threads used as they run, enable sophisticated and flexible resource management. Although many existing applications parallelized for SMPs with parallel runtimes are in fact already malleable, deployed runtime environments provide no interface nor any strategy for intelligently allocating hardware threads or even preventing oversubscription. Prior research methods either depend on profiling applications ahead of time to make good decisions about allocations or do not account for process efficiency at all, leading to poor performance. None of these prior methods have been adapted widely in practice. This article presents the Scheduling and Allocation with Feedback (SCAF) system: a drop-in runtime solution that supports existing malleable applications in making intelligent allocation decisions based on observed efficiency without any changes to semantics, program modification, offline profiling, or even recompilation. Our existing implementation can control most unmodified OpenMP applications. Other malleable threading libraries can also easily be supported with small modifications without requiring application modification or recompilation. In this work, we present the SCAF daemon and a SCAF-aware port of the GNU OpenMP runtime. We present a new technique for estimating process efficiency purely at runtime using available hardware counters and demonstrate its effectiveness in aiding allocation decisions. We evaluated SCAF using NAS NPB parallel benchmarks on five commodity parallel platforms, enumerating architectural features and their effects on our scheme. We measured the benefit of SCAF in terms of sum of speedups improvement (a common metric for multiprogrammed environments) when running all benchmark pairs concurrently compared to equipartitioning—the best existing competing scheme in the literature. We found that SCAF improves on equipartitioning on four out of five machines, showing a mean improvement factor in sum of speedups of 1.04 to 1.11x for benchmark pairs, depending on the machine, and 1.09x on average. Since we are not aware of any widely available tool for equipartitioning, we also compare SCAF against multiprogramming using unmodified OpenMP, which is the only environment available to end users today. SCAF improves on the unmodified OpenMP runtimes for all five machines, with a mean improvement of 1.08 to 2.07x, depending on the machine, and 1.59x on average. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|