Weighted adaptive concurrency control for software transactional memory
| Autor: | Mohammad Ansari |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
Speedup
Data parallelism Readers–writers problem Computer science Distributed computing Process (computing) Transactional memory Task parallelism Parallel computing Thread (computing) Software_PROGRAMMINGTECHNIQUES Theoretical Computer Science Concurrency control Hardware and Architecture Software transactional memory Instruction-level parallelism Software Information Systems |
| Zdroj: | The Journal of Supercomputing. 68:1027-1047 |
| ISSN: | 1573-0484 0920-8542 |
| DOI: | 10.1007/s11227-014-1138-5 |
| Popis: | Transactional memory programs may have dynamic available parallelism, which is defined as the number of transactions that can be committed concurrently. Prior work presented adaptive concurrency control, which adapts the number of active threads at runtime, and thus the number of concurrently executing transactions, based on available parallelism. Reducing threads when available parallelism is low, and vice versa, improved speedup and reduced wasted work (in aborted transactions). However, prior work did not consider the case where individual threads exhibit dynamic available parallelism. Deactivating threads with low available parallelism, and vice versa, may improve speedup and reduce wasted work further. This paper introduces weighted adaptive concurrency control to exploit the variance in available parallelism between threads. Four algorithms are designed, implemented, and evaluated. They improve speedup and reduce wasted work over prior non-weighted algorithms in applications whose threads exhibit such variance, while maintaining performance parity in applications whose threads do not. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|