
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Arnold L. Rosenberg, "Optimal Schedules for CycleStealing in a Network of Workstations with a BagofTasks Workload," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 2, pp. 179191, February, 2002.  
BibTex  x  
@article{ 10.1109/71.983945, author = {Arnold L. Rosenberg}, title = {Optimal Schedules for CycleStealing in a Network of Workstations with a BagofTasks Workload}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {13}, number = {2}, issn = {10459219}, year = {2002}, pages = {179191}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.983945}, 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  Optimal Schedules for CycleStealing in a Network of Workstations with a BagofTasks Workload IS  2 SN  10459219 SP179 EP191 EPD  179191 A1  Arnold L. Rosenberg, PY  2002 KW  Cyclestealing KW  bagoftasks workloads KW  heavytailed distributions KW  networks of workstations (NOWs) KW  optimal scheduling KW  scheduling parallel computations. VL  13 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—We refine the model underlying our prior work on scheduling bagoftasks (“embarrassingly parallel”) workloads via cyclestealing in networks of workstations obtaining a model wherein the scheduling guidelines of produce optimal schedules for
[1] T.E. Anderson, D.E. Culler, and D.A. Patterson, “A Case for NOW (Networks of Workstations),” IEEE Micro, vol. 15, no. 1, pp. 54–64, 1995.
[2] M.J. Atallah, C.L. Black, D.C. Marinescu, H.J. Siegel, and T.L. Casavant, “Models and Algorithms for Coscheduling ComputeIntensive Tasks on a Network of Workstations,” J. Parallel Distributed Computing, vol. 16, pp. 319327, 1992.
[3] 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.
[4] M. Banikazemi and D.K. Panda, “Efficient Collective Communication on Heterogeneous Networks of Workstations,” technical report, Ohio State Univ., 2000.
[5] S.N. Bhatt, F.R.K. Chung, F.T. Leighton, and A.L. Rosenberg, “On Optimal Strategies for CycleStealing in Networks of Workstations,” IEEE Trans. Computers, vol. 46, pp. 545557, 1997.
[6] R.D. Blumofe and C.E. Leiserson, "SpaceEfficient Scheduling of Multithreaded Computations," Proc. 25th Ann. ACM Symp. Theory of Computing, pp. 362371,San Diego Calif., May 1993.
[7] R.D. Blumofe and C.E. Leiserson, "Scheduling Multithreaded Computations by Work Stealing," Proc. 35th Symp. Foundations of Computer Science, 1994.
[8] R. Blumofe and D.S. Park, “Scheduling LargeScale Parallel Computations on Networks of Workstations,” Proc. Third Int'l Symp. HighPerformance Distributed Computing, pp. 96105, 1994.
[9] F. Cappello, P. Fraigniaud, B. Mans, and A.L. Rosenberg, “HiHCoHP—Toward a Realistic Communication Model for Hierarchical Hyperclusters of Heterogeneous Processors,” Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS '01), 2001.
[10] W. Cirne and K. Marzullo, The Computational CoOp: Gathering Clusters into a Metacomputer Proc. 13th Int'l Parallel Processing Symp., pp. 160166, 1999.
[11] D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. von Eicken, “LogP—A Practice Model of Parallel Computation,” Comm. ACM, vol. 39, no. 11, pp. 7885, 1996.
[12] M. HarcholBalter and A.B. Downey, "Exploiting Process Lifetime Distribution for Dynamic Load Balancing," Proc. ACM Sigmetrics Conf., ACM Press, 1996, pp. 1324.
[13] W.E. Leland and T.J. Ott, “LoadBalancing Heuristics and Process Behavior,” Proc. Performance and ACM SIGMETRICS, vol. 14, pp. 5469, 1986.
[14] M. Litzkow, M. Livny, and M.W. Mutka, “Condor—A Hunter of Idle Workstations,” Proc. Eighth Int'l Conf. Distributed Computing Systems, Jun. 1988.
[15] C.H. Papadimitriou and M. Yannakakis,"Towards an architectureindependent analysis of parallel algorithms," SIAM J. Computing, vol. 19, no. 2, pp. 322328, Apr. 1990.
[16] G.F. Pfister, In Search of Clusters, second ed. New Jersey: Prentice Hall, 1998.
[17] A.L. Rosenberg, “Guidelines for DataParallel CycleStealing in Networks of Workstations, I: On Maximizing Expected Output,” J. Parallel and Distributed Computing, vol. 59, pp. 3153, 1999.
[18] A.L. Rosenberg, “Guidelines for DataParallel CycleStealing in Networks of Workstations, II: On Maximizing Guaranteed Output,” Int'l J. Foundations of Computer Science, vol. 11, pp. 183204, 2000.
[19] A.L. Rosenberg, “Sharing Partitionable Workloads in Heterogeneous NOWs: Greedier Is not Better,” Proc. IEEE Int'l Conf. Cluster Computing, pp. 124131, 2001.
[20] S.W. White and D.C. Torney, “Use of a Workstation Cluster for the Physical Mapping of Chromosomes,” SIAM NEWS, pp. 1417, Mar. 1993.