
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Bharadwaj Veeravalli, Xiaolin Li, Chi Chung Ko, "On the Influence of StartUp Costs in Scheduling Divisible Loads on Bus Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 12, pp. 12881305, December, 2000.  
BibTex  x  
@article{ 10.1109/71.895794, author = {Bharadwaj Veeravalli and Xiaolin Li and Chi Chung Ko}, title = {On the Influence of StartUp Costs in Scheduling Divisible Loads on Bus Networks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {11}, number = {12}, issn = {10459219}, year = {2000}, pages = {12881305}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.895794}, 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  On the Influence of StartUp Costs in Scheduling Divisible Loads on Bus Networks IS  12 SN  10459219 SP1288 EP1305 EPD  12881305 A1  Bharadwaj Veeravalli, A1  Xiaolin Li, A1  Chi Chung Ko, PY  2000 KW  Divisible loads KW  communication delay KW  processing time KW  optimal sequence KW  bus networks. VL  11 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—Optimal distribution of divisible loads in bus networks is considered in this paper. The problem of minimizing the processing time is investigated by including all the overhead components that could penalize the performance of the system, in addition to the inherent communication and computation delays. These overheads are considered to be constant additive factors to the respective communication and computation components. Closedform solution for the processing time is derived and the influence of overheads on the optimal processing time is analyzed. We derive a
[1] G.D. Barlas, Collection Aware Optimum Sequencing of Operations and Closed Form Solutions for the Distribution of a Divisible Load on Arbitrary Processor Trees IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 5, pp. 429441, May 1998.
[2] S. Bataineh and T.G. Robertazzi, “Ultimate Performance Limits for Networks of Load Sharing Processors” Proc. Conf. Information Sciences and Systems, Princeton Univ., Princeton, N.J., pp. 794799, Mar. 1992.
[3] S. Bataineh and M. AlIbrahim, “Effect of FaultTolerance and Communication Delay on Response Time in a Multiprocessor System with a Bus Topology,” Computer Comm., vol. 17, pp. 843851, 1994.
[4] S. Bataineh and B. AlAsir, “An Efficient Scheduling Algorithm for Divisible and Indivisible Tasks in Loosely Coupled Multiprocessor Systems,” Software Eng. J., vol. 9, no. 1, pp. 1318, 1994.
[5] D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation.Englewood Cliffs, N.J.: Prentice Hall International, 1989.
[6] V. Bharadwaj, D. Ghose, and V. Mani, "Optimal Sequencing and Arrangement in Distributed SingleLevel Tree Networks with Communication Delays," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 9, pp. 968976, Sept. 1994.
[7] V. Bharadwaj, “Distributed Computation with Communication Delays: Design and Analysis of Load Distribution Strategies,” PhD thesis, Faculty of Eng., Indian Inst. of Science, Bangalore, India, June 1994.
[8] 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. 555567, 1995.
[9] 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.
[10] V. Bharadwaj, H.F. Li, and T. Radhakrishnan, “Scheduling Divisible Loads in Bus Networks with Arbitrary Processor Release Times,” Computers and Mathematics with Applications, vol. 32, no. 7, pp. 5777, 1996.
[11] J. Blazewicz and M. Drozdowski, "Distributed Processing of Divisible Jobs with Communication Startup Costs," Discrete Applied Mathematics, vol. 76, issues 13, pp. 2141, June 1997.
[12] S.H. Bokhari, Assignment Problems in Parallel and Distributed Computing.Boston: Kluwer Academic, 1987.
[13] K. Boryczko, M. Bubak, M. Gajecki, J. Kitowsk, J. Moscinski, and M. Pogoda, “Transmission Rates and Performance of a Network of Computers,” HighPerformance Computing and Networking, Volume II: Networking and Tools, W. Gentzsch and U. Harms, eds., pp. 142149. Berlin: SpringerVerlag, 1994.
[14] S. Charcranoon, T.G. Robertazzi, and S. Luryi, “Cost Efficient Load Sequencing in Single Level Tree Networks” Proc. 1998 Conf. Information Sciences and Systems, Princeton Univ., 1998.
[15] Y.C. Cheng and T.G. Robertazzi, Distributed Computation with Communication Delays IEEE Trans. Aerospace and Electronic Systems, vol. 24, no. 6, pp. 700712, Nov. 1988.
[16] M. Drozdowski, “Selected Problems of Scheduling Tasks in Multiprocessor Computer Systems,” Wydawnictwa Politechniki Poznanskiej, no. 321,Poznan, Poland, 1997.
[17] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness.New York: W.H. Freeman, 1979.
[18] A. Gerasoulis and T. Yang,"On the granularity and clustering of directed acyclic task graphs," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 6, pp. 686701, June 1993.
[19] D. Ghose and V. Mani, "Distributed Computation with Communication Delays: Asymptotic Performance Analysis," J. Parallel and Distributed Computing, vol. 23, pp. 293305, Nov. 1994.
[20] D. Ghose and H.J. Kim, “Load Partitioning and TradeOff Study for Large MatrixVector Computations in Multicast Bus Networks with Communication Delays,” J. Parallel and Distributed Computing, vol. 55, pp. 3259, 1998.
[21] A. Gupta, V. Kumar, and A. Sameh, “Performance and Scalability of Preconditioned Conjugate Gradient Methods on Parallel Computers,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 5, pp. 455469, May 1995.
[22] J.F. Jeng and S. Sahni, “Reconfigurable Mesh Algorithms for the Hough Transform,” J. Parallel and Distributed Computing, vol. 20, pp. 6977, 1994.
[23] 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. 607612, Apr. 1996.
[24] C. Lee, Y.F. Wang, D. Uecker, and Y. Wang, “Image Analysis for Automated Tracking in RobotAssisted Endoscopic Surgery,” Proc. 12th Int'l Conf. Pattern Recognition, Jerusalem, Israel, pp. 8892, Sept. 1994.
[25] C. Lee, Y.F. Wang, and T. Yang, “Static Global Scheduling for Optimal Computer Vission and Image Processing Operations on DistributedMemory Multiprocesors,” Technical Report TRC 9423, Univ. of California, Santa Barbara, Dec. 1994.
[26] C.H. Lee and K.G. Shin, “Optimal Task Assignment in Homogeneous Networks,” IEEE Trans. Parallel and Distributed Systems, vol 8, no. 2, pp. 119129, Feb. 1997.
[27] D. Ghose and V. Mani, "Distributed Computation in a Linear Network: Closedform Solutions and Computational Techniques," IEEE Trans. Aerospace and Electronic Systems, vol. 30, no. 2, pp. 471483, Apr. 1994.
[28] 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,2161,221, Oct. 1993.
[29] S. Sahni and V. Thanvantri, “Performance Metrics: Keeping the Focus on Runtime,” IEEE Parallel and Distributed Technology, pp. 4356, Spring 1996.
[30] H.J. Siegel, J.B. Armstrong, and D.W. Watson, "Mapping ComputerVisionRelated Tasks onto Reconfigurable Parallel Processing Systems," Computer, vol. 25, no. 2, pp. 5463, Feb. 1992.
[31] J. Sohn and T. G. Robertazzi, “Optimal Load Sharing for a Divisible Job on a Bus Network,” Proc. Conf. Information Science and Systems, pp. 835840, Mar. 1993.
[32] J. Sohn and T.G. Robertazzi, “A MultiJob Load Sharing Strategy for Divisible Jobs on Bus Networks,” CEAS Technical Report 665, State Univ. of New York at Stony Brook, Apr. 1993.
[33] J. Sohn and T.G. Robertazzi, “An Optimum Load Sharing Strategy for Divisible Jobs with TimeVarying Processor Speed and Channel Speed,” Proc. ISCA Int'l Conf. Parallel and Distributed Computing Systems, pp. 2732, Sept. 1995.
[34] 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. 3440, Jan. 1996.
[35] J. Sohn, T.G. Robertazzi, and S. Luryi, Optimizing Computing Costs Using Divisible Load Analysis IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 3, pp. 225234, Mar. 1998.
[36] J.A. Stankovic, M. Spuri, M. Di Natale, and G. Buttazzo, “Implications of Classical Scheduling Results for RealTime Systems,” IEEE Computer, vol. 28, no. 6, June 1995.
[37] J. Xu, “Multiprocessor Scheduling of Processes with Release Times, Deadlines, Precedence, and Exclusion Relations,” IEEE Trans. Software Eng., vol. 19, no. 2, pp. 139154, Feb. 1993.