Beowulf parallel processing for dynamic load-balancing
暂无分享,去创建一个
The Beowulf parallel-processing architecture is a public-domain software technology developed by NASA to link COTS processors yielding supercomputer performance (10 Gflops) very economically (under $150 K). This paper describes our implementation of a Beowulf cluster comprising 18 Sun workstations and the Linux operating system. We describe and demonstrate ParaSort, a distributed, parallel, data-allocation-sorting algorithm with automatic distributed load-balancing, and fault-tolerant performance. The load-balancing feature can provide dynamic, on-board, adaptive optimal distribution of processing tasks across a heterogeneous network of computing devices. Furthermore, it can intelligently allocate processing to off-board resources as appropriate and as they become available. We analyze the strengths and weaknesses of Beowulf and describe future extensions of our work.
[1] Jun Gu,et al. Algorithms and Average Time Bounds of Sorting on a Mesh-Connected Computer , 1994, IEEE Trans. Parallel Distributed Syst..
[2] H. T. Kung,et al. Sorting on a mesh-connected parallel computer , 1977, CACM.
[3] Lin Yen-Chun,et al. On balancing sorting on a linear array , 1993 .
[4] Isaac D. Scherson,et al. Parallel Sorting in Two-Dimensional VLSI Models of Computation , 1989, IEEE Trans. Computers.