Optimization Problems in the Implementation of Distributed MergeSort on Networked Computers

摘要

In this paper we investigate the use of ordinary workstations and/or personnel computers for parallel computations. We use Java as a programming language and its Socket mechanisms for communications. With our software, any machine on the internet which is not utilized by its owner can make itself available and may eventually participate as a member of a parallel team. When its owner returns, the machine goes back to serve him, usually by running ordinary sequential software. As an example, we use sorting as a problem and merge sort as an algorithm. Statistical results were gathered using machines on the departmental network. Several optimization problems can arise when deciding which subteam will minimize the total running time of parallel merge sort. A solution is offered for two of the problems.