Despite the fast evolution of Distributed Shared Memory (DSM) systems, the load balance problem has not received enough attentions. This problem arises naturally after multithreading was introduced to DSM systems few years ago. The cognizance of it would bring us a significant improvement in system performance. In this paper, we address it by proposing and experimentally evaluating a load balancing method called Dependence-Driven Load Balancing (DDLB) that is dedicated for multithreaded DSM systems. The most attractive feature of this method is to take thread dependence into account in making decisions for migration. In contrast to existing thread scheduling works which for the most part have relied on the information supplied before execution, we require no a priori information. Typically, DDLB embraces three policies, i.e. transfer policy, location policy and selection policy, and applies affinity scheduling. Finally, from the experimental results, the performance of the system with load balancing is improving evidently.
|出版狀態||Published - 1997 1月 1|
|事件||Proceedings of the 1997 IEEE International Performance Computing & Communications Conference - Phoenix, AZ, USA|
持續時間: 1997 2月 5 → 1997 2月 7
|Other||Proceedings of the 1997 IEEE International Performance Computing & Communications Conference|
|城市||Phoenix, AZ, USA|
|期間||97-02-05 → 97-02-07|
All Science Journal Classification (ASJC) codes