Estimating Capacity For Sharing in a Privately Owned Workstation Environment

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]  Marvin Theimer,et al.  Finding Idle Machines in a Workstation-Based Distributed System , 1989, IEEE Trans. Software Eng..

[2]  David A. Nichols,et al.  Using idle workstations in a shared computing environment , 1987, SOSP '87.

[3]  Songnian Zhou A Trace-Driven Simulation Study of Dynamic Load Balancing , 1988, IEEE Trans. Software Eng..

[4]  Willy Zwaenepoel,et al.  Performance of optimistic make , 1989, SIGMETRICS '89.

[5]  Matt W. Mutka An examination of strategies for estimating capacity to share among private workstations , 1992 .

[6]  Domenico Ferrari,et al.  Workload charaterization and Selection in Computer Performance Measurement , 1972, Computer.

[7]  Miron Livny,et al.  The Available Capacity of a Privately Owned Workstation Environmont , 1991, Perform. Evaluation.

[8]  Stuart I. Feldman,et al.  Make — a program for maintaining computer programs , 1979, Softw. Pract. Exp..

[9]  Willy Zwaenepoel,et al.  The distributed V kernel and its performance for diskless workstations , 1983, SOSP '83.

[10]  Jonathan Schaeffer,et al.  Structuring Distributed Algorithms in a Workstation Environment: The FrameWorks Approach , 1989, ICPP.

[11]  Robert B. Hagmann,et al.  Process Server: Sharing Processing Power in a Workstation Environment , 1986, ICDCS.

[12]  Rakesh Agrawal,et al.  Location Independent Remote Execution in NEST , 1987, IEEE Transactions on Software Engineering.

[13]  Leonard Kleinrock,et al.  Collecting unused processing capacity: an analysis of transient distributed systems , 1989, [1989] Proceedings. The 9th International Conference on Distributed Computing Systems.

[14]  Bruce M. McMillin,et al.  DAWGS - A Distributed Compute Server Utilizing Idle Workstations , 1990, Proceedings of the Fifth Distributed Memory Computing Conference, 1990..

[15]  Teunis J. Ott,et al.  Load-balancing heuristics and process behavior , 1986, SIGMETRICS '86/PERFORMANCE '86.

[16]  Miron Livny,et al.  Condor-a hunter of idle workstations , 1988, [1988] Proceedings. The 8th International Conference on Distributed.