Abstract
The load balancing scheme of a massively parallel computer system named PISMA is analysed in this paper. The theory behind the load balancing scheme is presented and several variations of the same scheme, which differ in complexity, are studied with the help of a simulator. It is shown that with a 10% overhead for load calculation a well balanced system can be obtained, which can execute a range of applications efficiently.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Lioupis, N. Kanelopoulos, “CHESS Multiprocessor: A Processor-Memory Grid for Parallel Programming”, Cache and Interconnect Architectures in Multiprocessors, workshop procedings edited by M. Dubois & S. Thakkar. Kluwer Academic Publishers, 1990.
D. Lioupis, N. Kanelopoulos, M. Stefanidakis, “The Memory Hierarchy of the CHESS Computer” Microprocessing and Microprogramming 38 (pp 99–107) 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lioupis, D., Stefanidakis, M. (1994). Dynamic load balancing on a virtually-shared memory parallel computer system. In: Halatsis, C., Maritsas, D., Philokyprou, G., Theodoridis, S. (eds) PARLE'94 Parallel Architectures and Languages Europe. PARLE 1994. Lecture Notes in Computer Science, vol 817. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58184-7_164
Download citation
DOI: https://doi.org/10.1007/3-540-58184-7_164
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58184-0
Online ISBN: 978-3-540-48477-6
eBook Packages: Springer Book Archive