Abstract
This paper presents the design and development of a dynamic scheduler of parallel threads in the Multithreaded multiProcessor Architecture (MPA). The scheduler relies on an on-chip associative memory whose management time is overlapped with the execution of ready threads. The scheduler efficiently assigns resources to threads, and permits them to communicate with great flexibility. The results achieved with small number of threads from programs with high degree of parallelism are very satisfactory, even under various degrees of cache misses.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Tullsen, D.M. et al.: Simultaneous Multithreading: Maximizing on-chip parallelism. In Proc. Of the 22nd. annual. Intl. Symp. On computer architecture-1995.
Marcuello, P., Gonz’alez, A.: Exploiting Speculative Thread-Level Parallelism on a SMT Processor-Proc. of the Int. Conf. on High Perf. Computing and Networking-1999.
Hammond, L., Nayfeh, B. A., Olukotun K.: A Single-Chip Multiprocessor-IEEE Computer Special Issue on “ Billion-Transistor Processors”, p 79–85, September 1997.
Adda, M., Niar, S.: Thread Synchronization and Scheduling in a Pipelined Multithreaded Processor-1st International Symposium on Advanced Distributed Systems-March 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Niar, S., Adda, M. (2001). Performances of a Dynamic Threads Scheduler. In: Sakellariou, R., Gurd, J., Freeman, L., Keane, J. (eds) Euro-Par 2001 Parallel Processing. Euro-Par 2001. Lecture Notes in Computer Science, vol 2150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44681-8_65
Download citation
DOI: https://doi.org/10.1007/3-540-44681-8_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42495-6
Online ISBN: 978-3-540-44681-1
eBook Packages: Springer Book Archive