Network Cluster Computing, Performance Modeling And Analysis, Nondedicated Systems, Workload Distribution
Abstract
Abstract—The low cost and wide availability of networks of workstations have made them an attractive solution for high performance computing. However, while a network of workstations may be readily available, these workstations may be privately owned and the owners may not want others to interrupt their priority in using the computer. Assuming machine owners have a preemptive priority, in this paper, we study the parallel processing capacity of a privately owned network of workstations. A mathematical model is developed to predict performance for nondedicated network computing. It also considers systems with heterogeneous machine utilization and heterogeneous service distribution. This model separates the influence of machine utilization, sequential job service rate, and parallel task allocation on the parallel completion time. It is simple and valuable for guiding task scheduling in a nondedicated environment.
1. R. Arpaci, A. Dusseau, A. Vahdat, L. Liu, T. Anderson, and D. Patterson, "The Interaction of Parallel and Sequential Workloads on a Network of Workstations," Proc. ACM SIGMETRICS/Performance Conf., May 1995.
2. T. Anderson, D. Culler, and D. Patterson, "A Case for Networks of Workstations: NOW," IEEE Micro, Feb. 1995.
3. I. Foster, and C. Kesselman, The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, 1999.
4. G. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam, PVM: Parallel Virtual MachineA Users' Guide and Tutorial for Networked Parallel Computing. The MIT Press, 1994.
5. A.S. Grimshaw, W.A. Wulf, and the Legion Team, "The Legion Vision of a Worldwide Virtual Computer," Computer, vol. 40, no. 1, pp. 39-45, Jan. 1997.
6. B.S. Gottfried, "Use of Computer Graphics in Fitting Statistical Distribution Functions to Data Representing
Random Events," Simulation, vol. 60, no. 4, pp. 281-287, 1993.
7. D. Gross, and C.M. Harris, Fundamentals of Queuing System, second ed. John Wiley & Sons, 1985.
8. W. Gropp, E. Lusk, and A. Skjellum, Using MPI: Portable Parallel Programming with the Message-Passing Interface. The MIT Press, 1994.
9. L. Kleinrock, and W. Korfhage, "Collecting Unused Processing Capacity: An Analysis of Transient Distributed Systems," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 5, May 1993.
10. S. Leutenegger, and X.H. Sun, "Distributed Computing Feasibility in a Non-Dedicated Homogeneous Distributed system," Proc. Supercomputing '93, pp. 143-152, 1993.
11. S. Leutenegger, and X.H. Sun, "Limitations of Cycle Stealing of Parallel Processing on a Network of Homogeneous
Workstations," J. Parallel and Distributed Computing, pp. 169-178, Oct. 1997.
12. S. Madala, and J.B. Sinclair, "Performance of Synchronous Parallel Algorithms with Regular Structures," IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 1, Jan. 1991.
13. M. Mutka, and M. Livny, "The Available Capacity of a Privately Owned Workstation Environment," Performance Evaluation, vol. 12, pp. 269-284, 1991.
14. G. Peterson, and R. Chamberlain, "Stealing Cycles: Can We Get Along?" Proc. 28th Hawaii Conf. System Science, pp. 422-431, Jan. 1995.
15. S.M. Ross, Simulation, second ed. Academic Press, 1997.
16. X.H. Sun, and J. Gustafson, "Toward a Better Parallel Performance Metric," Parallel Computing, vol. 17, pp. 1093-1109, Dec. 1991.
17. Systems Modeling Corp., "ARENA User's Guide," version 2.0, Sewickley, Pa., 1995.
