Static clustering has been used to group tasks for parallel processing. Most clustering methods used for current multithreaded DSM systems only consider the workload balance. In contrast, in this paper we present a static method to cluster closely related tasks of an application onto a multithreaded DSM system. This method relies on the Hopfield neural network to find optimal or near-optimal clusters. An optimal solution identified by this method tends to minimize load imbalance and communication overhead. We have implemented this method on Cohesion which is a multithreaded DSM system. Three programs, SOR, Nbody, and Gaussian Elimination, are used to test the effectiveness of this method. The result shows that our method indeed can find optimal or near-optimal clustering for these programs.
|出版狀態||Published - 1998 一月 1|
|事件||Proceedings of the 1997 IEEE International Conference on Intelligent Processing Systems, ICIPS'97. Part 1 (of 2) - Beijing, China|
持續時間: 1997 十月 28 → 1997 十月 31
|Other||Proceedings of the 1997 IEEE International Conference on Intelligent Processing Systems, ICIPS'97. Part 1 (of 2)|
|期間||97-10-28 → 97-10-31|
All Science Journal Classification (ASJC) codes
- Computer Science(all)