Abstract
Load balance is an important issue for the performance of software distributed shared memory (DSM) systems. One solution of addressing this issue is exploiting dynamic thread migration. In order to reduce the data consistency communication increased by thread migration, an effective load balance scheme must carefully choose threads and destination nodes for workload migration. In this paper, a group-based load balance scheme is proposed to resolve this problem. The main characteristic of this scheme is to classify the overloaded nodes and the lightly loaded nodes into a sender group and a receiver group, and then consider all the threads of the sender group and all the nodes of the receiver group for each decision. The experimental results show that the group-based scheme reduces more communication than the previous schemes. Besides, this paper also resolves the problem of the high costs caused by group-based schemes. Therefore, the performance of the test programs is effectively enhanced after minimizing the communication increased by thread migration.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. Amza, A. L. Cox, S. Dwarkadas, P. Keleher, H. Lu, R. Rajamony, W. Yu, and W. Zwaenepoel. TreadMarks: Shared memory computing on networks of workstations. IEEE Computer, 29(2):18–28, 1996.
A. C. Lai, C. K. Shieh, J. C. Ueng, Y. T. Kok, and L. Y. Kung. Load balancing in distributed shared memory system. In Proceedings of IEEE International Performance, Computing, and Communications Conference, pp. 152–158, 1997
K. Li. IVY: A shared virtual memory system for parallel computing. In Proceedings of the 1988 International Conference on Parallel Processing 2:94–101.
T.-Y. Liang, C.-K. Shieh, D.-C. Liu, and W. Zhu. Dynamic task scheduling on multithreaded distributed shared memory systems. In Proceeding of the International Conferences on Parallel and Distributed Processing Techniques and Applications, pp. 1058–1065, 1998
H. Lu, S. Dwarkadas, A. L. Cox, and W. Zwaenepoel. Message passing versus distributed shared memory on networks of workstations. In Proceedings of Supercomputing' 95, 1995.
K. Thitikamol and P. Kelehe. Per-node multi-threading and remote latency. In IEEE Transactions on Computers, April 1988.
K. Thitikamol and P. Keleher. Thread migration and communication minimization in DSM systems. IEEE Proceedings, pp. 487–497, 1999.
K. Thitikamol and P. J. Keleher. Active tracking correlation. In Proceedings of the 19th International Conference on Distributed Computing Systems, 1999.
C.-K. Shieh, A.-C. Lai, J.-C. Ueng, T.-Y. Liang, T.-C. Chang, and S.-C. Mao. Cohesion: An efficient distributed shared memory system supporting multiple memory consistency models. In Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synpaper, pp. 146–152, 1995.
J. C. Ueng, C. K. Shieh, T. Y. Liang, and J. B. Chang. Efficient synchronization mechanisms for multithreaded distributed shared memory system. In Proceedings of the National Computer Symposium of R.O.C, pp. E158–E163, 1997.
J.-C. Ueng, C.-K. Shieh, S.-C. Mac, A.-C. Lai, and T.-Y. Laing. Multi-threaded design for a software distributed shared memory system. IEICE Transaction on Information and Systems E82-D, pp. 1512–1523, 2000
Y.-C. Zhuang, C.-K. Shieh, and T. Y. Liang. The study of centralized load balance on distributed shared memory systems. In Proceedings of the 1998 International Computer Symposium, pp. 137–143, December 1998.
Rights and permissions
About this article
Cite this article
Zhuang, Yc., Liang, T.Y., Shieh, Ck. et al. A Group-Based Load Balance Scheme for Software Distributed Shared Memory Systems. The Journal of Supercomputing 28, 295–309 (2004). https://doi.org/10.1023/B:SUPE.0000022101.41799.cc
Issue Date:
DOI: https://doi.org/10.1023/B:SUPE.0000022101.41799.cc