
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Sandeep N. Bhatt, Fan R.K. Chung, F. Thomson Leighton, Arnold L. Rosenberg, "On Optimal Strategies for CycleStealing in Networks of Workstations," IEEE Transactions on Computers, vol. 46, no. 5, pp. 545557, May, 1997.  
BibTex  x  
@article{ 10.1109/12.589220, author = {Sandeep N. Bhatt and Fan R.K. Chung and F. Thomson Leighton and Arnold L. Rosenberg}, title = {On Optimal Strategies for CycleStealing in Networks of Workstations}, journal ={IEEE Transactions on Computers}, volume = {46}, number = {5}, issn = {00189340}, year = {1997}, pages = {545557}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.589220}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  On Optimal Strategies for CycleStealing in Networks of Workstations IS  5 SN  00189340 SP545 EP557 EPD  545557 A1  Sandeep N. Bhatt, A1  Fan R.K. Chung, A1  F. Thomson Leighton, A1  Arnold L. Rosenberg, PY  1997 KW  Cyclestealing KW  data parallel computation KW  networks of workstations KW  parallel scheduling KW  formal models KW  optimal competitive ratio KW  optimal expected throughput. VL  46 JA  IEEE Transactions on Computers ER   
Abstract—We study the parallel scheduling problem for a new modality of parallel computing: having one workstation "steal cycles" from another. We focus on a draconian mode of cyclestealing, in which the owner of workstation
We formulate two models of cyclestealing. The first attempts to maximize the expected work accomplished during a single episode, when one knows the probability distribution of the return of
Perhaps our most important discovery is the asyet unexplained coincidence that two quite distinct scenarios lead to almost identical unique optimizing schedules. One scenario falls within our first model; it assumes that the probability of the return of
[1] B. Awerbuch, Y. Azar, A. Fiat, and F.T. Leighton, “Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time,” Proc. 28th ACM Symp. Theory of Computing, pp. 519530, 1996.
[2] R.D. Blumofe, C.F. Joerg, B.C. Kuszmaul, C.E. Leiserson, K.H. Randall, and Y. Zhou, “Cilk: An Efficient Multithreaded Runtime System,” Proc. Fifth ACM SIGPLAN Symp. Principles and Practice of Parallel Programming, pp. 207–216, July 1995.
[3] R.D. Blumofe and C.E. Leiserson, "Scheduling Multithreaded Computations by Work Stealing," Proc. 35th Symp. Foundations of Computer Science, 1994.
[4] S.J. Chapin, "Distributed Scheduling Support in the Presence of Autonomy," Proc. Fourth Heterogeneous Computing Workshop, pp. 2229, 1995.
[5] S.J. Chapin, "Preliminary Performance Results for MESSIAHS," Bull. IEEE TC Operating Systems and Application Environments 7, pp. 1223, 1995.
[6] D. Cheriton, "The V Distributed System," Comm. ACM, vol. 31, no. 3, pp. 314333, Mar. 1988.
[7] E.G. Coffman Jr., L. Flatto, and A.Y. Krenin, "Scheduling Saves in FaultTolerant Computations," Acta Informatica, vol. 30, pp. 409423, 1993.
[8] D. Gelernter and D. Kaminsky, "Supercomputing Out of Recycled Garbage: Preliminary Experience with Piranha," Technical Report RR883, Yale Univ., 1991.
[9] M. Litzkow, M. Livny, and M.W. Mutka, “Condor—A Hunter of Idle Workstations,” Proc. Eighth Int'l Conf. Distributed Computing Systems, Jun. 1988.
[10] D. Nichols, "Multiprocessing in a Network of Workstations," Ph.D. thesis, Carnegie Mellon Univ, 1990.
[11] J.K. Ousterhout et al., "The Sprite network operating system," IEEE Computer, vol. 21, no. 2, pp. 2336, Feb. 1988.
[12] C.H. Papadimitriou and M. Yannakakis,"Towards an architectureindependent analysis of parallel algorithms," SIAM J. Computing, vol. 19, no. 2, pp. 322328, Apr. 1990.
[13] W.R. Pearson, "PVM, the 'Parallel Virtual Machine,' vs. Net Express," Message on comp.parallel, Mar.9 1993.
[14] G.F. Pfister, In Search of Clusters, second ed. New Jersey: Prentice Hall, 1998.
[15] M. Stumm, "The Design and Implementation of a Decentralized Scheduling Facility for a Workstation Cluster," Proc. Second IEEE Conf. Computer Workstations, pp. 1222, 1988.
[16] V. Sunderam, “PVM: A Framework for Parallel Distributed Computing,” Concurrency: Practice and Experience, vol. 2, no. 4, pp. 315–339, , 1990.
[17] A. Tannenbaum, "Amoeba: A Distributed Operating System for the 1990s," Computer, pp. 4453, 1990.
[18] M.M. Theimer and K.A. Lantz, "Finding Idle Machines in a WorkstationBased Distributed Environment," IEEE Trans. Software Eng., vol. 15, pp. 1,4441,458, 1989.
[19] S.W. White and D.C. Torney, "Use of a Workstation Cluster for the Physical Mapping of Chromosomes," SIAM NEWS, pp. 1417, Mar. 1993.