Mapping Parallel Iterative Algorithms onto Workstation Networks
1994-003-parallel-comm.pdf (270.5Kb) Main article
MetadataShow full item record
CitationHeddaya, Abdelsalam; Park, Kihong. "Mapping Parallel Iterative Algorithms onto Workstation Networks”, Technical Report BUCS-1994-003, Computer Science Department, Boston University, February 1994. [Available from: http://hdl.handle.net/2144/1461]
For communication-intensive parallel applications, the maximum degree of concurrency achievable is limited by the communication throughput made available by the network. In previous work [HPS94], we showed experimentally that the performance of certain parallel applications running on a workstation network can be improved significantly if a congestion control protocol is used to enhance network performance. In this paper, we characterize and analyze the communication requirements of a large class of supercomputing applications that fall under the category of fixed-point problems, amenable to solution by parallel iterative methods. This results in a set of interface and architectural features sufficient for the efficient implementation of the applications over a large-scale distributed system. In particular, we propose a direct link between the application and network layer, supporting congestion control actions at both ends. This in turn enhances the system's responsiveness to network congestion, improving performance. Measurements are given showing the efficacy of our scheme to support large-scale parallel computations.