This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimizing Computing Costs Using Divisible Load Analysis
March 1998 (vol. 9 no. 3)
pp. 225-234

Abstract—A bus oriented network where there is a charge for the amount of divisible load processed on each processor is investigated. A cost optimal processor sequencing result is found which involves assigning load to processors in nondecreasing order of the cost per load characteristic of each processor. More generally, one can trade cost against solution time. Algorithms are presented to minimize computing cost with an upper bound on solution time and to minimize solution time with an upper bound on cost. As an example of the use of this type of analysis, the effect of replacing one fast but expensive processor with a number of cheap but slow processors is also discussed. The type of questions investigated here are important for future computer utilities that perform distributed computation for some charge.

[1] I. Ahmad, A. Ghafoor, and G.C. Fox, "Hierarchical Scheduling of Dynamic Parallel Computations on Hypercube Multicomputers," J. Parallel and Distributed Computing, vol. 20, pp. 317-329, 1994.
[2] S.H. Bokhari, "A Network Flow Model for Load Balancing in Circuit-Switched Multicomputers," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 6, pp. 649-657, June 1993.
[3] C.-H. Lee, D. Lee, and M. Kim, "Optimal Task Assignment in Linear Array Networks," IEEE Trans. Computers, vol. 41, no. 7, pp. 877-880, July 1992.
[4] K.K. Goswami, M. Devarakonda, and R.K. Iyer, "Prediction-Based Dynamic Load-Sharing Heuristics," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 6, pp. 638-648, June 1993.
[5] G. Huang and W. Ongsakul, "An Efficient Load-Balancing Processor Scheduling Algorithm for Parallelization of Gauss-Seidel Type Algorithms," J. Parallel and Distributed Computing, vol. 22, pp. 350-358, 1994.
[6] V.M. Lo, S. Rajopadhye, S. Gupta, D. Keldsen, M.A. Mohamed, and J. Telle, "Mapping Divide and Conquer Algorithms to Parallel Computers," Proc. 1990 Int'l Conf. Parallel Architectures, pp. 128-135, 1990.
[7] K. Ramamritham, J. Stankovic, and P. Shiah, “Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 2, Apr. 1990.
[8] X. Qian and Q. Yang, "An Analytical Model for Load Balancing on Symmetric Multiprocessor Systems," J. Parallel and Distributed Computing, vol. 20, pp. 198-211, 1994.
[9] Y.-C. Chang and K.G. Shin, "Optimal Load Sharing in Distributed Real-Time Systems," J. Parallel and Distributed Computing, vol. 19, no. 1, pp. 38-50, Sept. 1993.
[10] K.G. Shin and M.-S. Chen, "On the Number of Acceptable Task Assignments in Distributed Computing Systems," IEEE Trans. Computers, vol. 39, no. 1, pp. 99-110, Jan. 1990.
[11] D.-T. Peng and K.G. Shin, "A New Performance Measure for Scheduling Independent Real-Time Tasks," J. Parallel and Distributed Computing, vol. 19, no. 1, pp. 11-26, Sept. 1993.
[12] G.C. Sih and E.A. Lee, “Declustering: A New Multiprocessor Scheduling Technique,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 6, pp. 625-637, June 1993.
[13] J. Xu and K. Hwang, "Heuristic Methods for Dynamic Load Balancing in a Message-Passing Multicomputer," J. Parallel and Distributed Computing, vol. 18, no. 1, pp. 1-13, May 1993.
[14] J. Blazerwicz,M. Drabowski,, and j. Weglarz,“Scheduling multiprocessor tasks to minimize schedule length,” IEEE Trans. on Computers, vol. 35, no. 5, May 1986.
[15] J. Du and J. Leung,“Complexity of scheduling parallel task systems,”SIAM J. Discrete Math., vol. 2 no. 4, pp. 473–487, Nov. 1989.
[16] W. Zhao, K. Ramamritham, and J.A. Stankovic, "Preemptive Scheduling Under Time and Resource Constraints," IEEE Trans. Computers, Vol. 36, No. 8, Aug. 1987, pp. 949-960.
[17] Y.C. Cheng and T.G. Robertazzi, Distributed Computation with Communication Delays IEEE Trans. Aerospace and Electronic Systems, vol. 24, no. 6, pp. 700-712, Nov. 1988.
[18] Y.C. Cheng and T.G. Robertazzi, "Distributed Computation for a Tree Network with Communication Delays," IEEE Trans. Aerospace and Electronic Systems, vol. 26, no. 3, pp. 511-516, May 1990.
[19] S. Bataineh and T.G. Robertazzi, "Distributed Computation for a Bus Network with Communication Delays," Proc. 1991 Conf. Information Sciences and Systems, pp. 709-714, Johns Hopkins Univ., Baltimore, Md., Mar. 1991.
[20] S. Bataineh and T.G. Robertazzi, Bus Oriented Load Sharing for a Network of Sensor Driven Processors IEEE Trans. Systems, Man and Cybernetics, special issue on distributed sensor networks, vol. 21, no. 5, pp. 1202-1205, Sept. 1991.
[21] S. Bataineh and T.G. Robertazzi, "Performance Limits for Processor Networks with Divisible Jobs," IEEE Trans. Aerospace and Electronic Systems, vol. 33, no. 4, pp. 1,189-1,198, Oct. 1997.
[22] S. Bataineh, T. Hsiung, and T.G. Robertazzi, Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job IEEE Trans. Computers, vol. 43, no. 10, pp. 1184-1196, Oct. 1994.
[23] T.G. Robertazzi, "Processor Equivalence for a Linear Daisy Chain of Load Sharing Processors," IEEE Trans. Aerospace and Electronic Systems, vol. 29, no. 4, pp. 1,216-1,221, Oct. 1993.
[24] J. Sohn and T.G. Robertazzi, Optimal Load Sharing for a Divisible Job on a Bus Network IEEE Trans. Aerospace and Electronic Systems, vol. 32, no. 1, pp. 34-40, Jan. 1996.
[25] J. Sohn and T.G. Robertazzi, "A Multi-Job Load Sharing Strategy for Divisible Jobs on Bus Networks," Technical Report 697, State Univ. of New York at Stony Brook, College of Eng. and Applied Science, Aug. 1994. Also appears in chapter 12 of [45].
[26] J. Sohn and T.G. Robertazzi, "An Optimal Load Sharing Strategy for Divisible Jobs with Time-Varying Processor Speed and Channel Speed," Conf. version: Proc. ISCA Int'l Conf. Parallel and Distributed Computing Systems, pp. 27-32,Orlando Fla., Sept. 1995. Journal version: Accepted for IEEE Trans. Aerospace and Electronic Systems, July 1998.
[27] D. Ghose and V. Mani, "Distributed Computation in a Linear Network: Closed-form Solutions and Computational Techniques," IEEE Trans. Aerospace and Electronic Systems, vol. 30, no. 2, pp. 471-483, Apr. 1994.
[28] D. Ghose and V. Mani, "Distributed Computation with Communication Delays: Asymptotic Performance Analysis," J. Parallel and Distributed Computing, vol. 23, pp. 293-305, Nov. 1994.
[29] V. Bharadwaj, D. Ghose, and V. Mani, "Optimal Sequencing and Arrangement in Distributed Single-Level Tree Networks with Communication Delays," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 9, pp. 968-976, Sept. 1994.
[30] V. Bharadwaj, D. Ghose, and V. Mani, Multiinstallment Load Distribution in Tree Networks With Delays IEEE Trans. Aerospace and Electronic Systems, vol. 31, no. 2, pp. 555-567, 1995.
[31] V. Bharadwaj, D. Ghose, and V. Mani, "An Efficient Load Distribution Strategy for a Distributed Linear Network of Processors with Communication Delays," Computer and Mathematics with Applications, vol. 29, no. 9, pp. 95-112, May 1995.
[32] V. Bharadwaj, D. Ghose, and V. Mani, "A Study of Optimality Conditions for Load Distribution in Tree Networks with Communication Delays," Technical Report 423/GI/02-92, Dept. of Aerospace Eng., Indian Inst. of Science, Bangalore, India, Dec. 1992.
[33] H.J. Kim, G.I. Jee, and J.G. Lee, "Optimal Load Distribution for Tree Network Processors," IEEE Trans. Aerospace and Electronic Systems, vol. 32, no. 2, pp. 607-612, Apr. 1996.
[34] J. Blazewicz and M. Drozdowski, "Scheduling Divisible Jobs on Hypercubes," Parallel Computing, vol. 21, pp. 1,945-1,956, 1995.
[35] J. Blazewicz and M. Drozdowski, "The Performance Limits of a Two-Dimensional Network of Load-Sharing Processors," Foundations of Computing and Decision Sciences, vol. 21, no. 1, pp. 3-15, 1996.
[36] J. Blazewicz and M. Drozdowski, "Distributed Processing of Divisible Jobs with Communication Startup Costs," Discrete Applied Mathematics, vol. 76, issues 1-3, pp. 21-41, June 1997.
[37] E. Haddad, "Communication Protocol for Optimal Redistribution of Divisible Load in Distributed Real-Time Systems," Proc. ISMM Int'l Conf. Intelligent Information Management Systems, pp. 39-42,Washington, D.C., June 1994.
[38] J. Sohn, T.G. Robertazzi, and S. Luryi, "Optimizing Computing Costs Using Divisible Load Analysis," State Univ. of New York at Stony Brook, College of Eng. and Applied Science, Technical Report 719, Oct.30, 1995. Also related: US patent application, Load Sharing Controller for Optimizing Monetary Cost, 1996.
[39] R. Cocchi, D. Estrin, S. Shenker, and L. Zhang, “Pricing in Computer Networks: Motivation, Formulation and Examples,” IEEE/ACM Trans. Networking, vol. 1, pp. 614-627, 1993.
[40] A. Faragó, S. Blaabjerg, L. Ast, G. Gordos, and T. Henk, "A New Degree of Freedom in ATM Network Dimensioning: Optimizing the Logical Configuration," IEEE J. Selected Areas in Comm., vol. 13, no. 7, pp. 1,199-1,205, Sept. 1995.
[41] J. Kurose and R. Simha, “A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems,” IEEE Trans. Computers, vol. 38, no. 5, May 1989.
[42] S.H. Low and P.P Varaiya, "A New Approach to Service Provisioning in ATM Networks," IEEE Trans. Networking, vol. 1, no. 5, pp. 547-553, Oct. 1993.
[43] Y.A. Korilis, A.A. Lazar, and A. Orda, "Architecting Noncooperative Networks," IEEE J. Selected Areas in Comm., vol. 13, no. 7, pp. 1,241-1,251, Sept. 1995.
[44] D. Menasce and V. Almeida, "Cost-Performance Analysis of Heterogeneity in Supercomputer Architectures," Proc. IEEE/ACM Supercomputing '90, pp. 169-177, 1990.
[45] V. Bharadwaj, D. Ghose, V. Mani, and T.G. Robertazzi, Scheduling Divisible Loads in Parallel and Distributed Systems.Los Alamitos, Calif.: IEEE CS Press, 1996.

Index Terms:
Bus network, computer utility, cost, divisible load, load sharing.
Citation:
Jeeho Sohn, Thomas G. Robertazzi, Serge Luryi, "Optimizing Computing Costs Using Divisible Load Analysis," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 3, pp. 225-234, March 1998, doi:10.1109/71.674315
Usage of this product signifies your acceptance of the Terms of Use.