Scheduling Multiple Multithreaded Applications on Asymmetric and Symmetric Chip Multiprocessors

This paper evaluates new techniques to improve performance, fairness and jitter of workloads consisting of multiple multithreaded applications running on Chip MultiProcessors (CMP). Current thread assignment techniques which are tailored for single-thread applications result in sub-optimal usage of...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2010 3rd International Symposium on Parallel Architectures, Algorithms and Programming s. 65 - 72
Hlavní autori: Morad, T Y, Kolodny, A, Weiser, U C
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.12.2010
Predmet:
Asymmetric Multiprocessors
Benchmark testing
Instruction sets
Jitter
Linux
Measurement
Operating Systems
Runtime
Scheduling
Throughput
ISBN:1424494826, 9781424494828
ISSN:2168-3034
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper evaluates new techniques to improve performance, fairness and jitter of workloads consisting of multiple multithreaded applications running on Chip MultiProcessors (CMP). Current thread assignment techniques which are tailored for single-thread applications result in sub-optimal usage of the multiprocessor resources, unfairness between applications and jitter in execution runtimes when dealing with multiple multithreaded applications running in parallel. Multithreaded applications contain serial phases (single thread) and parallel phases (many threads). In this paper, we propose a new thread assignment mechanism that takes into account the different requirements of each phase, granting higher priority to applications during their critical-serial phases. Analytic and experimental evaluation of the proposed thread assignment mechanism on both symmetric and asymmetric multiprocessors show throughput improvements by as much as 16%, improved fairness by as much as 26% and reduced jitter by as much as 88%.
ISBN:1424494826
9781424494828
ISSN:2168-3034
DOI:10.1109/PAAP.2010.50