
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
L. Kleinrock, W. Korfhage, "Collecting Unused Processing Capacity: An Analysis of Transient Distributed Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 5, pp. 535546, May, 1993.  
BibTex  x  
@article{ 10.1109/71.224216, author = {L. Kleinrock and W. Korfhage}, title = {Collecting Unused Processing Capacity: An Analysis of Transient Distributed Systems}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {4}, number = {5}, issn = {10459219}, year = {1993}, pages = {535546}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.224216}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Collecting Unused Processing Capacity: An Analysis of Transient Distributed Systems IS  5 SN  10459219 SP535 EP546 EPD  535546 A1  L. Kleinrock, A1  W. Korfhage, PY  1993 KW  Index Termsunused processing capacity; transient distributed systems; distributed systems; idlecomputers; transient processors; distributed processing; resource allocation VL  4 JA  IEEE Transactions on Parallel and Distributed Systems ER   
It is suggested that if the large numbers of idle computers and workstations in distributedsystems could be used then considerable computing power could be harnessed at lowcost. Such systems are analyzed using Brownian motion with drift to model the executionof a program distributed over the idle computers in a network of idle and busy processors.The ways in which the use of these transient processors affects a program's executiontime is determined. The probability density of a program's finishing time on both single and multiple transient processors is found. These results are explored for qualitative insight. Some approximations for the finishing time probability density are suggested.
[1] W. Korfhage, "Distributed systems and transient processors," Ph.D. dissertation, Univ. California, Los Angeles, Aug. 1989.
[2] L. Kleinrock, "Distributed systems,"Commun. ACM, vol. 28, pp. 12001213, Nov. 1985.
[3] S. J. Mullenderet al., "Amoeba: A distributed operating system for the 1990s,"IEEE Comput. Mag., vol. 23, pp. 4453, May 1990.
[4] M. W. Mutka and M. Livny, "Scheduling remote processing capacity in a workstationprocessor bank network," inProc. 7th Int. Conf. Distributed Comput. Syst., Berlin, Germany, Sept. 1987.
[5] P. Krueger and R. Chawla, "The Stealth Distributed Scheduler,"Proc. 11th Int'l Conf. Distributed Computing Systems, IEEE CS Press, Los Alamitos, Calif., Order No. 2144, 1991, pp. 336343.
[6] R. Alonso and L.L. Cova, "Sharing Jobs Among Independently Owned Processors,"Proc. 8th Int'l Conf. on Distributed Computing Systems, IEEE Computer Society Press, Los Alamitos, Calif., 1988, pp. 282287.
[7] R. E. Felderman, E. M. Schooler, and L. Kleinrock, "The benevolent bandit laboratory: A testbed for distributed algorithms,"IEEE J. Select. Areas Commun., vol. 7, no. 2, pp. 303311, Feb. 1989.
[8] J. R. Lyle and C. Lu, "Load balancing from a unix shell," inProc. 13th Conf. Local Comput. Networks, Oct. 1988, pp. 181183.
[9] M. J. Litzkow, M. Levy, and M. W. Mutka, "Condora hunter of idle workstations," inProc. IEEE Int. Conf. on Distributed Comput. Syst., 1988, pp. 104111.
[10] M. W. Mutka and M. Livny, "Profiling workstation's available capacity for remote execution," Computer Sciences Tech. Rep. 697, CS Dept., Univ. Wisconsin, May 1987.
[11] D. A. Nichols, "Using idle workstations in a shared computing environment," inProc. 11th Symp. on Operating Syst. Principles, Nov. 1987, pp. 512.
[12] M. Stumm, "The Design and Implementation of a Decentralized Scheduling Facility for a Workstation Cluster,"Proc. Second Conf. Computer Workstations, IEEE CS Press, Los Alamitos, Calif., Order No. 810, 1988, pp. 1222.
[13] J. F. Shoch and J. A. Hupp, "The 'Worm' programsearly experience with a distributed computation,"Commun. ACM, vol. 25, no. 3, pp. 172180, Mar. 1982.
[14] T. J. Shimeall, personal communication, 1989.
[15] B. T. Doshi, "Queueing systems with vacations  A survey,"Queueing Systems, vol. 1, pp. 2967, June 1986.
[16] H. White and L. S. Christie, "Queueing with preemptive priorities or with breakdown,"Oper. Res., vol. 6, pp. 7995, Jan.Feb. 1958.
[17] K. Thiruvengadam, "Queueing with breakdowns,"Oper. Res., vol. 11, pp. 6271, Jan.Feb. 1963.
[18] D. P. Gaver, Jr., "A waiting line with interrupted service, including priorities,"J. Roy. Statist. Soc., vol. B24, pp. 7390, 1962.
[19] A. Federgruen and L. Green, "Queueing systems with service interruptions,"Oper. Res., vol. 34, pp. 752768, Sept.Oct. 1986.
[20] M. D. Beaudry, "Performancerelated reliability measures for computing systems,"IEEE Trans. Comput., vol. C27, pp. 540547, June 1978.
[21] J. F. Meyer, "On evaluating the performability of degradable computing systems,"IEEE Trans. Comput., vol. C29, pp. 720731, Aug. 1980.
[22] J. F. Meyer, "Closedform solutions of performability,"IEEE Trans. Comput., vol. C31, pp. 648657, July 1982.
[23] B. R. Iyer, "Recent results in performability analysis," inCurrent Advances in Distributed Computing and Communications, Computer Science Press, 1987, pp. 5064.
[24] S. M. R. Islam and H. H. Ammar, "Performability of the hypercube,"IEEE Trans. Rel., vol. 38, no. 5, Dec. 1989.
[25] K. R. Pattipati and S. A. Shah, "On the computational aspects of performability models of faulttolerant computer systems,"IEEE Trans. Comput., vol. 39, pp. 832836, June 1990.
[26] B. R. Iyer, L. Donatiello and P. Heidelberger, "Analysis of performability for stochastic models of faulttolerant systems,"IEEE Trans. Comput., vol. C35, no. 10, Oct. 1986.
[27] V. G. Kulkarni, V. F. Nicola, R. M. Smith, and K. S. Trivedi, "Numerical evaluation of performability and job completion time in repairable faulttolerant systems," inFaultTolerant Computing Systems 16, 1986, pp. 252257.
[28] P. S. Puri, "A method for studying the integral functionals of stochastic processes with applications: I. The Markov chain case,"J. Appl. Probability, vol. 8, pp. 331343, 1971.
[29] R. M. Smith, K. S. Trivedi, and A. V. Ramesh, "Performability analysis: Measures, an algorithm, and a case study,"IEEE Trans. Comput., vol. 37, pp. 406417, Apr. 1988.
[30] E. de Souza e Silva and H. R. Gail, "Calculating availability and performability measures of repairable computer systems using randomization,"J. ACM, vol. 36, no. 1, Jan. 1989.
[31] D. R. Cox,Renewal Theory. London: Methuen and Co., Ltd., science paperbacks ed., 1962.
[32] A. Mood, F. Graybill, and D. Boes,Introduction to the Theory of Statistics. New York: Series in Probability and Statistics, McGrawHill, 1974.
[33] S. Karlin and H. M. Taylor,A First Course in Stochastic Processes, second ed. New York: Academic, 1975.