This Article 
 Bibliographic References 
 Add to: 
Estimating Capacity for Sharing in a Privately Owned Workstation Environment
April 1992 (vol. 18 no. 4)
pp. 319-328

The author analyzes workstation patterns in order to understand opportunities for exploiting idle capacity. This study is based on traces of users workstation activity in a university environment. It identifies two areas where enhancements can be made. One area is the ability of a manager of the shared capacity of a workstation cluster to schedule jobs with deadline constraints. This opportunity is the result of the ability to make good predictions of the time-varying amount of capacity that is available for sharing. A prediction strategy is developed that is shown to have only a small amount of error. For the second area of enhancement, it is shown that it is feasible to allocate partitions of workstations for specific periods. This aids those users who on occasion need exclusive access to several machines. The author examines the profile of periods during which exclusive access to partitions can be given, the rate that owners preempt users of partitions, and the distribution of interpreemption intervals.

[1] M. J. Litzkow, M. Levy, and M. W. Mutka, "Condor--a hunter of idle workstations," inProc. IEEE Int. Conf. on Distributed Comput. Syst., 1988, pp. 104-111.
[2] R. Hagmann, "Process server: sharing processing power in a workstation environment," inProc. 6th Conf. on Distrib. Comput. Syst., 1986, pp. 260-267.
[3] R. Agrawal and A. K. Ezzat, "Location independent remote execution in NEST,"IEEE Trans. Software Eng., vol. SE-13, pp. 905-912, Aug. 1987.
[4] D. A. Nichols, "Using idle workstations in a shared computing environment," inProc. 11th Symp. on Operating Syst. Principles, Nov. 1987, pp. 5-12.
[5] H. Clark and B. McMillin, "DAWGS--a distributed compute server utilizing idle workstations," Dept. Comput. Sci., Univ. Missouri-Rolla, Rolla, 1990.
[6] M. M. Theimer and K. A. Lantz, "Finding idle machines in a workstation-based distributed system," inProc. 8th IEEE Distrib. Comput. Conf.(San Jose, CA), June 1988, pp. 112-122.
[7] M. Livny and U. Manber, "µ--a system for simulating and implementing distributed and parallel algorithms," Dept. Comput. Sci., Univ. Wisconsin-Madison, Tech. Rep. No. 731, 1987.
[8] A. Singh, J. Schaeffer, and M. Green, "Structuring distributed algorithms in a workstation environment: the Frameworks approach," inProc. Int. Conf. on Parallel Process., Aug. 1989, pp. 88-97.
[9] R. Bubenik and W. Zwaenepoel, "Performance of optimistic make," inProc. 1989 ACM Sigmetrics Conf. on Measurement and Model. of Comput. Syst., May 1989, pp. 39-48.
[10] D. R. Cheriton and W. Zwaenepol, "The distributed v kernel and its performance for diskless workstations," inProc. 9th Symp. Operating System Principles, ACM SIGOPS, Bretton Woods, NH, Oct. 1983, pp. 128-139.
[11] S. Feldman, "Make-a computer program for maintaining computer programs,"Software Prac. Exper., vol. 9, pp. 255-265, Apr. 1979.
[12] D. Ferrari, "Workload characterization and selection in computer performance measurement,"Computer, vol. 15, pp. 18-24, July-Aug. 1972.
[13] M. W. Mutka and M. Livny, "The available capacity of a privately owned workstation environment,"Perform. Eval., vol. 12, pp. 269-284, July 1991.
[14] W. E. Leland and T. J. Ott, "Load-balancing heuristics and process behavior," inProc. 1986 ACM Sigmetrics Conf. Measurement Modeling Comput. Syst. Perform. Eval. Rev., vol. 14, no. 1, pp. 54-69, North Carolina State Univ., May 1986.
[15] S. Zhou, "A trace-driven simulation study of dynamic load balancing,"IEEE Trans. Software Eng., vol. SE-14, pp. 1327-1341, Sept. 1988.
[16] L. Kleinrock and W. Korfhage, "Collecting unused processing capacity: an analysis of transient distributed systems," inProc. 9th IEEE Distrib. Comput. Conf., June 1989, pp. 482-489.
[17] UNIX 4.2BSD Manual for PS (Process Status).
[18] A. Bricker and M. Litzkow, "Condor technical summary," Dept. Comput. Sci., Univ. Wisconsin, Madison, Tech. Rep., 1989.
[19] M. W. Mutka, "Considering deadline constraints when allocating the shared capacity of private workstations,"Int. J. Comput. Simulation.
[20] M. W. Mutka, "An examination of strategies for estimating capacity to share among private workstations," inProc. 1991 ACM Symp on Small Syst., June 1991, pp. 41-49.

Index Terms:
capacity management; partition allocation; job scheduling; workstation patterns; idle capacity; university environment; shared capacity; deadline constraints; DP management; multi-access systems; resource allocation; scheduling
M.W. Mutka, "Estimating Capacity for Sharing in a Privately Owned Workstation Environment," IEEE Transactions on Software Engineering, vol. 18, no. 4, pp. 319-328, April 1992, doi:10.1109/32.129220
Usage of this product signifies your acceptance of the Terms of Use.