Advertisement

Divisible Loads and Parallel Processing

  • Thomas G. Robertazzi
  • Li Shi
Chapter
  • 17 Downloads

Abstract

This chapter provides an in-depth look at the theory of scheduling computation and communication involving divisible (i.e., partitionable) loads being processed on networks of processors. This is a very useful methodology for understanding, designing, and analyzing load distribution scheduling. A literature survey begins the chapter. This is followed by a discussion of time optimal scheduling in single level tree (i.e., star) networks. Other sections cover equivalent processors, product form solutions, infinite size network performance, time-varying environments, and multi-installment scheduling. Applied scheduling problems involving monetary cost optimization and signature searching are presented. The chapter concludes by discussing mathematical programming solutions for divisible load scheduling.

Keywords

Divisible load scheduling Time optimal scheduling Monetary cost optimal scheduling Asymptotic results Multi-installment scheduling Signature searching 

References

  1. 5.
    H. Adler, Y. Gong and A.L. Rosenberg, “Optimal Sharing of Bags of Tasks in Heterogeneous Clusters,” Proc. of ACM SPAA’03, June 2003.Google Scholar
  2. 6.
    R. Agrawal and H.V. Jagadish, “Partitioning Techniques for Large Grained Parallelism,” IEEE Transactions on Computers, vol. 37, no. 12, Dec. 1988, pp. 1627–1634.Google Scholar
  3. 12.
    E.J. Anderson, “A New Continuous Model for Job Shop Scheduling,” International Journal of System Science, vol. 12, no. 12, 1981, pp. 1469–1475.CrossRefGoogle Scholar
  4. 14.
    M. Arafat, S. Bataineh and I. Khalil, “Probabilistic Approach to Scheduling Divisible Load on Network of Processors,” Sensor Network Data Communication, vol. 4, no. 130, 2015.Google Scholar
  5. 17.
    G.D. Barlas, “VoD on Steroids: Optimized Content Delivery using Distributed Video Servers over Best-Effort Internet,” Journal of Parallel and Distributed Computing, vol. 65, no. 9, 2005, pp. 1057–1071.CrossRefGoogle Scholar
  6. 20.
    G.D. Barlas, “Cluster-based Optimized Parallel Video Transcoding,” Parallel Computing, vol. 38, March 2012, pp. 226–244.Google Scholar
  7. 22.
    F. Baskett, K.M. Chandy, R.R. Muntz and F. Palacios, “Open, Closed and Mixed Networks of Queues with Different Classes of Customers,” Journal of the ACM, vol. 22, no. 2, April 1975, pp. 248–260.Google Scholar
  8. 23.
    S. Bataineh and T.G. Robertazzi, “Bus Oriented Load Sharing for a Network of Sensor Driven Processors,” special issue on Distributed Sensor Networks of the IEEE Transactions on Systems, Man and Cybernetics, vol. 21, no. 5, Sept. 1991, pp. 1202–1205.Google Scholar
  9. 25.
    S. Bataineh and M. Al-Ibrahim, “Effect of Fault Tolerance and Communications Delay on Response Time in a Multiprocessor System with a Bus Topology,” Computer Communications, 1994.Google Scholar
  10. 26.
    S. Bataineh and T.G. Robertazzi, “Performance Limits for Processor Networks with Divisible Jobs,” IEEE Transactions on Aerospace and Electronic Systems, vol. 33, no. 4, Oct. 1997, pp. 1189–1198.Google Scholar
  11. 27.
    O. Beaumont, L. Carter, J. Ferrante, A. Legrand and Y. Robert, “Bandwidth-Centric Allocation of Independent Tasks on Heterogeneous Platforms,” Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS’02), June 2002.Google Scholar
  12. 28.
    O. Beaumont, A. Legrand and Y. Robert, “The Master-Slave Paradigm with Heterogeneous Processors,” IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 9, 2003, pp. 897–910.CrossRefGoogle Scholar
  13. 30.
    J. Berlińska and M. Drozdowski, “Heuristics for Multi-round Divisible Load Scheduling with Limited Memory,” Parallel Computing, vol. 36, 2010, pp. 199–211.CrossRefGoogle Scholar
  14. 31.
    J. Berlińska and M. Drozdowski, “Scheduling Divisible MapReduce Computations,” Journal of Parallel and Distributed Computing, vol. 71, no. 3, 2011, pp. 450–459.CrossRefGoogle Scholar
  15. 33.
    J. Berlińska and M. Drozdowski, “Scheduling Multilayer Divisible Computation, RAIRO Operations Research, vol. 49, no. 2, 2015, pp. 339–368.MathSciNetCrossRefGoogle Scholar
  16. 34.
    J. Berlińska and M. Drozdowski, “Scheduling Data Gathering with Variable Communication Speed,” Proc. First International Workshop on Dynamic Scheduling Problems, 2016.Google Scholar
  17. 35.
    J. Berlińska and M. Drozdowski, “Comparing Load-Balalncing Algorithms for MapReduce under Zipfian Data Skews,” Parallel Computing vol. 72, 2018.Google Scholar
  18. 37.
    V. Bharadwaj, D. Ghose and V. Mani, “Optimal Sequencing and Arrangement in Distributed Single-Level Tree Networks with Communication Delays,” IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 9, pp. Sept. 1994, pp. 968–976.Google Scholar
  19. 38.
    V. Bharadwaj, D. Ghose and V. Mani, “Multi-installment Load Distribution in Tree Networks with Delays,” IEEE Transactions on Aerospace and Electronic Systems, vol. 31, no. 2, April 1995, pp. 555–567.Google Scholar
  20. 39.
    (a) V. Bharadwaj, H.F. Li and T. Radhakrishnan, “Scheduling Divisible Loads in Bus Networks with Arbitrary Processor Release Times,” Computers and Mathematics with Applications, Pergamon Press, vol. 32, no. 7, 1996, pp. 57–77.Google Scholar
  21. 40.
    (b) V. Bharadwaj, D. Ghose, V. Mani, and T.G. Robertazzi, Scheduling Divisible Loads in Parallel and Distributed Systems, IEEE Computer Society Press, Los Alamitos CA, Sept. 1996, 292 pages.Google Scholar
  22. 41.
    (a) V. Bharadwaj, L. Xiaolin, and C.C. Ko, “Design and Analysis of Load Distribution Strategies with Start-up Costs in Scheduling Divisible Loads on Distributed Networks,” Mathematical and Computer Modelling, Pergamon Press, vol. 32, 2000, pp. 901–932.Google Scholar
  23. 43.
    (c) V. Bharadwaj and N. Viswanadham, “Sub-Optimal Solutions Using Integer Approximation Techniques for Scheduling Divisible Loads on Distributed Bus Networks,” IEEE Transactions on Systems, Man, and Cybernetics: Part A, vol. 30, no. 6, pp. 680–691, November 2000.Google Scholar
  24. 44.
    (d) V. Bharadwaj, X. Li and K.C. Chuang, “On the Influence of Start-Up Costs in Scheduling Divisible Loads in Bus Networks”, IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 12, Dec. 2000, pp. 1288–1305.Google Scholar
  25. 45.
    V. Bharadwaj and S. Ranganath, “Theoretical and Experimental Study of Large Size Image Processing Applications using Divisible Load Paradigm on Distributed Bus Networks,” Image and Vision Computing, Elsevier Publishers, vol. 20, issues 13–14, Dec. 2002, pp. 917–936.Google Scholar
  26. 46.
    (a) V. Bharadwaj, D. Ghose, T. G. Robertazzi, “A New Paradigm for Load Scheduling in Distributed Systems,” in special issue of Cluster Computing on Divisible Load Scheduling, Kluwer Academic Publishers, vol. 6, no. 1, Jan. 2003, pp. 7–18.Google Scholar
  27. 47.
    (b) V. Bharadwaj and G. Barlas, “Scheduling Divisible Loads with Processor Release Times and Finite Size Buffer Capacity Constraints,” in special issue of Cluster Computing on Divisible Load Scheduling, Kluwer Academic Publishers, vol. 6, no. 1, Jan. 2003, pp. 63–74.Google Scholar
  28. 48.
    J. Blazewicz and M. Drozdowski, “Scheduling Divisible Jobs on Hypercubes,” Parallel Computing, vol. 21, 1995, 1945–1956.MathSciNetCrossRefGoogle Scholar
  29. 49.
    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, 1996, pp. 3–15.zbMATHGoogle Scholar
  30. 50.
    J. Blazewicz and M. Drozdowski, “Distributed Processing of Divisible Jobs with Communication Startup Costs,” Discrete Applied Mathematics, vol. 76, issue 1–3, 1997, pp. 21–41.Google Scholar
  31. 51.
    J. Blazewicz, M. Drozdowski, F. Guinand and D. Trystram, “Scheduling a Divisible Task in a 2-Dimensional Mesh,” Discrete Applied Mathematics, May 1999, pg. 35.Google Scholar
  32. 52.
    S.H. Bokhari, Assignment Problems in Parallel and Distributed Computing, Springer, 2012.Google Scholar
  33. 55.
    J.P. Buzen, “Computational Algorithms for Closed Queueing Networks with Exponential Servers,” Communications of the ACM, vol. 16, no. 9, Sept. 1973, pp. 527–531.Google Scholar
  34. 56.
    Y. Cao, Algorithms and Performance Evaluation for Scheduling in Parallel Systems, PhD Thesis, Stony Brook University, 2019.Google Scholar
  35. 57.
    H. Casanova, A. Legrand and Y. Robert, Parallel Algorithms, CRC Press, Florida, 2009.zbMATHGoogle Scholar
  36. 60.
    Y.K. Chang, J.-H. Wu, C.-Y. Chen and C.P. Chu, “Improved Methods for Divisible Load Distribution on k-Dimensional Meshes using Multi-Installment,” IEEE Transactions on Parallel and Distributed Systems, vol. 18, no. 11, Nov. 2007.Google Scholar
  37. 62.
    S. Charcranoon, T.G. Robertazzi and S. Luryi, “Parallel Processor Configuration Design with Processing/Transmission Costs,” IEEE Transactions on Computers, vol. 49, no. 9, Sept. 2000, pp. 987–991.Google Scholar
  38. 63.
    S. Charcranoon, T.G. Robertazzi, and S. Luryi, “Load Sequencing for a Parallel Processing Utility,” Journal of Parallel and Distributed Computing, 2004.Google Scholar
  39. 65.
    C.Y. Chen and C.P. Chu, “Novel Methods for Divisible Load Distribution with Start-Up Costs on a Complete b-Ary Tree,” IEEE Transcations on Parallel and Distributed Systems, vol. 26, no. 10, 2015, pp. 2836–2848.CrossRefGoogle Scholar
  40. 66.
    Y.C. Cheng and T.G. Robertazzi, “Distributed Computation with Communication Delays,” IEEE Transactions on Aerospace and Electronic Systems, vol. 24, no. 6, Nov. 1988, pp. 700–712.Google Scholar
  41. 67.
    Y.C. Cheng, and T.G. Robertazzi, “Distributed Computation for a Tree Network with Communication Delays,” IEEE Transactions on Aerospace and Electronic Systems, vol. 26, no. 3, May 1990, pp. 511–516.Google Scholar
  42. 70.
    N. Comino and V.L. Narasimhan, “A Novel Data Distribution Technique for Host-Client Type Parallel Applications,” IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 2, 2002, pp. 97–110.CrossRefGoogle Scholar
  43. 78.
    M. Drozdowski and W. Glazek, “Scheduling Divisible Loads in a Three Dimensional Mesh of Processors,” Parallel Computing, vol. 25, 1999, pp. 381–404.MathSciNetCrossRefGoogle Scholar
  44. 79.
    M. Drozdowski and P. Wolniewicz, “Experiments with Scheduling Divisible Tasks in Clusters of Workstations,” in A. Bode, T. Ludwig, W. Karl and R. Wismüler, editors, EURO-Par 2000, Lecture Notes in Computer Science 1900, Springer-Verlag, 2000, pp. 311–319.Google Scholar
  45. 80.
    (a) M. Drozdowski and P. Wolniewicz, “Divisible Load Scheduling in Systems with Limited Memory,” in special issue of Cluster Computing on Divisible Load Scheduling, Kluwer Academic Publishers, vol. 6, no. 1, Jan. 2003, pp. 19–30.Google Scholar
  46. 81.
    (b) M. Drozdowksi and P. Wolniewicz, “Out of Core Divisible Load Processing,” IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 10, Oct. 2003, pp. 1048–1056.Google Scholar
  47. 82.
    M. Drozdowski and M. Lawenda, “Multi-installment Divisible Load Processing in Heterogeneous Systems with Limited Memory,” Lecture Notes in Computer Science 3911, 2006, pp. 847–854, in R. Wyrzykowski et al. (eds.), Proceeding of PPAM 2005.Google Scholar
  48. 83.
    (a) M. Drozdowski, “Energy Considerations for Divisible Load Processing,” Lecture Notes in Computer Science 6068, 2010, pp. 92–101, in R. Wyrzykowski, J. Dongarra, K. Karczewski, J. Wasniewski (eds.), Proceedings of the 8th International Conference PPAM 2009, part II.Google Scholar
  49. 84.
    (b) M. Drozdowski, Scheduling for Parallel Processing, Springer, New York, 2009.Google Scholar
  50. 85.
    M. Drozdowski and J.M. Marszalkowski, “Divisible Load Scheduling in Hierarchical Memory Systems with Time and Energy Constraints,” Parallel Processing and Applied Math in LNCS vol. 9574, Springer, 2016, pp. 111–120.Google Scholar
  51. 86.
    P.-F. Dutot, “Divisible Load on a Heterogeneous Arrays,” Proc. of the International Parallel and Distributed Processing Symposium (IPDS’03), Nice, France, April 2003.Google Scholar
  52. 88.
    D. England, B. Veeravalli and J.B. Weissman, “A Robust Spanning Tree Topology for Data Collection and Dissemination in Distributed Environments, IEEE Transactions on Parallel and Distributed Systems, vol. 18, 2007, pp. 608–620.CrossRefGoogle Scholar
  53. 97.
    S. Ghanbari, M. Othman and W.J. Leong, “Multi-criteria Based Algorithm for Scheduling Divisible Loads,” Proceedings of First International Conference on Advanced Data and Information Engineering, 2013, pp. 547–554.Google Scholar
  54. 98.
    D. Ghose and V. Mani, “Distributed Computation with Communication Delays: Asymptotic Performance Analysis,” Journal of Parallel and Distributed Computing, vol. 23, 1994, pp. 293–305.CrossRefGoogle Scholar
  55. 99.
    D. Ghose and H.J. Kim, “Load Partitioning and Trade-Off Study for Large Matrix Vector Computations in Multicast Bus Networks with Communication Delays,” Journal of Parallel and Distributed Computing, vol. 54, 1998, pp. 32–59.CrossRefGoogle Scholar
  56. 100.
    D. Ghose, “A Feedback Strategy for Load Allocation in Workstation Clusters with Unknown Network Resource Capabilities using the DLT Paradigm,” Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA’02), Las Vegas, Nevada, vol. 1, June 2002, pp. 425–428.Google Scholar
  57. 102.
    W. Glazek, “A Multistage Load Distribution Strategy for Three Dimensional Meshes,” in special issue of Cluster Computing on Divisible Load Scheduling, Kluwer Academic Publishers, vol. 6, no. 1, Jan. 2003, pp. 31–40.Google Scholar
  58. 105.
    W.J. Gordon and G.F. Newell, “Closed Queueing Systems with Exponential Servers,” Operations Research, vol. 15, 1967, pp. 254–265.CrossRefGoogle Scholar
  59. 115.
    F.S. Hillier and G.J. Lieberman, Introduction to Operations Research, 8th edition, McGraw-Hill, 2005.Google Scholar
  60. 118.
    C.H. Hsu, T.L. Chen and J.H. Park, “On Improving Resource Utilization and System Throughput of Master Slave Job Scheduling in Heterogeneous Systems,” Journal of Supercomputing, vol. 45, no. 1, 2008, pp. 129–150.CrossRefGoogle Scholar
  61. 121.
    J.T. Hung, H.J. Kim and T.G. Robertazzi, “Scalable Scheduling in Parallel Processors,” Proceedings of the 2002 Conference on Information Sciences and Systems, Princeton University, Princeton NJ, March 2002.Google Scholar
  62. 122.
    J.T. Hung, Scalable Scheduling in Parallel, Distributed and Grid Systems, Ph.D Thesis, Dept. of Electrical and Computer Engineering, Stony Brook University, Stony Brook NY, Aug. 2003.Google Scholar
  63. 123.
    (a) J.T. Hung and T.G. Robertazzi, “Scalable Scheduling for Clusters and Grids using Cut Through Switching,” International Journal of Computers and their Applications, ACTA Press, vol. 26, no. 3, 2004, pp. 147–156.Google Scholar
  64. 124.
    (b) J.T. Hung and T.G. Robertazzi, “Divisible Load Cut Through Switching in Sequential Tree Networks,” IEEE Transactions on Aerospace and Electronic Systems, vol. 40, no. 3, July 2004, pp. 968–982.Google Scholar
  65. 126.
    J.R. Jackson, “Networks of Waiting Lines,” Operations Research, vol. 5, 1957, pp. 518–521.MathSciNetCrossRefGoogle Scholar
  66. 129.
    S. Kang, B. Veeravalli and K.M.M. Aung, “Dynamic Scheduling Strategy with Efficient Node Availability Prediction for Handling Divisible Loads in Multi-Cloud Systems,” Journal of Parallel and Distributed Computing, vol. 113, 2018, pp. 1–16.CrossRefGoogle Scholar
  67. 137.
    H.J. Kim, G.-I. Jee and J.G. Lee, “Optimal Load Distribution for Tree Network Processors,” IEEE Transactions on Aerospace and Electronic Systems, vol. 32, no. 2, April 1996, pp. 607–612.Google Scholar
  68. 138.
    H.J. Kim, “A Novel Optimal Load Distribution Algorithm for Divisible Loads,” in special issue of Cluster Computing on Divisible Load Scheduling, Kluwer Academic Publishers, vol. 6, no. 1, Jan. 2003, pp. 41–46.Google Scholar
  69. 141.
    (a) K. Ko, Scheduling Data Intensive Parallel Processing in Distributed and Networked Environments, Ph.D Thesis, Dept. of Electrical and Computer Engineering, University at Stony Brook, Aug. 2000.Google Scholar
  70. 142.
    (b) K. Ko and T.G. Robertazzi, “Record Search Time Evaluation,” Proceedings of the Conference on Information Sciences and Systems, Princeton University, Princeton, N.J., March 2000.Google Scholar
  71. 143.
    K. Ko and T.G. Robertazzi, “Scheduling in an Environment of Multiple Job Submission,” Proceedings of the 2002 Conference on Information Sciences and Systems, Princeton University, Princeton NJ, March 2002.Google Scholar
  72. 144.
    K. Ko and T.G. Robertazzi, “Signature Search Time Evaluation in Flat File Databases,” IEEE Transactions on Aerospace and Electronic Systems, vol. 44, no. 2, April 2008, pp. 493–502.Google Scholar
  73. 146.
    C.S. Kong, V. Bharadwaj and D. Ghose, “Large Matrix-Vector Products on Distributed Bus Networks with Communication Delays using the Divisible Load Paradigm: performance and simulation,” Computers and Mathematics in Simulation, Elsevier Press, vol. 58, 2001, pp. 71–92.Google Scholar
  74. 147.
    B. Kreaseck, L. Carter, H. Casanova, and J. Ferrante, “Autonomous Protocols for Bandwidth-Centric Scheduling of Independent-task Applications,” Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS’03), Nice, France, April 2003.Google Scholar
  75. 148.
    Y. Kyong and T.G. Robertazzi, “Greedy Signature Processing with Arbitrary Location Distributions: A Divisible Load Framework,” IEEE Transactions on Aerospace and Electronic Systems, vol. 48, no. 4, 2012, pp. 3027–3041.CrossRefGoogle Scholar
  76. 152.
    X. Li, V. Bharadwaj and C.C. Ko, “Optimal Divisible Task Scheduling on Single-Level Tree Networks with Finite Size Buffers,” IEEE Transactions on Aerospace and Electronic Systems, vol. 36, no. 4, Oct. 2000, pp. 1298–1308.Google Scholar
  77. 154.
    W. Lin and J.Z. Wang, “Bandwdith-aware Divisible Task Scheduling for Cloud Computing,” Journal of Software: Practice and Experience, vol. 44, no. 2, 2012, pp. 163–174.Google Scholar
  78. 155.
    X. Lin, Y. Lu, J. Deogun and S. Goddard, “Real-Time Divisible Load Scheduling with Different Processor Available Times,” 2007 International Conference on Parallel Processing (ICPP 2007), 2007.Google Scholar
  79. 156.
    X. Lin, A. Mamat, Y. Lu, J. Deogun and S. Goddard, “Real-Time Scheduling of Divisible Loads in Cluster Computing Environments,” Journal of Parallel and Distributed Computing, vol. 70, no. 3, 2010, pp. 296–308.CrossRefGoogle Scholar
  80. 160.
    (a) A. Mamat, Y. Lu, J. Deogun and S. Goddard, “Efficient Real-Time Divisible Load Scheduling,” Journal of Parallel and Distributed Computing, vol. 72, no. 12, 2012, pp. 1603–1616.Google Scholar
  81. 161.
    (b) A. Mamat, Y. Lu, J. Deogun and S. Goddard, “Scheduling Real-Time Divisible Loads with Advance Reservations,” Real-Time Systems, 2012, vol. 48, issue 3, pp. 264–293.Google Scholar
  82. 162.
    V. Mani and D. Ghose, “Distributed Computation in a Linear Network: Closed-Form Solutions and Computational Techniques,” IEEE Transactions on Aerospace and Electronic Systems, vol. 30, no. 2, April 1994.Google Scholar
  83. 171.
    M. Moges and T.G. Robertazzi, “Divisible Load Scheduling and Markov Chain Models, Computers and Mathematics with Applications, vol. 52, 2006, pp. 1529–1542.MathSciNetCrossRefGoogle Scholar
  84. 182.
    D.L.H. Ping, B. Veeravallia and D. Bader, “On the Design of High-Performance Algorithms for Aligning Multiple Protein Sequences in Mesh-Based Multiprocessor Architectures,” Journal of Parallel and Distributed Computing, vol. 67, no. 9, 2007, pp. 1007–1017.CrossRefGoogle Scholar
  85. 183.
    D.A.L. Piriyakumar and C.S.R. Murthy, “Distributed Computation for a Hypercube Network of Sensor-Driven Processors with Communication Delays Including Setup Time,” IEEE Transactions on Systems, Man and Cybernetics-Part A: Systems and Humans, vol. 28, no. 2, March 1998, pp. 245–251.Google Scholar
  86. 189.
    M. Reiser and S.S. Lavenberg, “Mean-value Analysis of Closed Multichain Queueing Networks,” Journal of the ACM, vol. 27, no. 2, April 1980, pp. 313–322.Google Scholar
  87. 192.
    (b) T.G. Robertazzi, “Processor Equivalence for a Linear Daisy Chain of Load Sharing Processors,” IEEE Transactions on Aerospace and Electronic Systems, vol. 29, no. 4, Oct. 1993, pp. 1216–1221.Google Scholar
  88. 193.
    T.G. Robertazzi, Planning Telecommunication Networks, Wiley and IEEE Press, 1999.Google Scholar
  89. 195.
    T.G. Robertazzi, “Ten Reasons to Use Divisible Load Theory,” Computer, vol. 36, no. 5, May 2003, pp. 63–68.Google Scholar
  90. 196.
    T.G. Robertazzi, Networks and Grids: Technology and Theory, Springer, NY, 2007.zbMATHGoogle Scholar
  91. 197.
    T.G. Robertazzi, “A Product Form Solution for Tree Networks with Divisible Loads,” Parallel Processing Letters, vol. 21, no.1, March 2011, pp. 13–20.Google Scholar
  92. 212.
    B.A. Shirazi and A.R. Hurson, Scheduling and Load Balancing in Parallel and Distributed Systems, Wiley -IEEE Computer Society Press, 1995.Google Scholar
  93. 213.
    A. Shokripour, M. Othman, H. Ibrahim and S. Subramaniam, “A Method for Scheduling Heterogeneous Multi-Installment Systems,” Lecture Notes in Artificial Intelligence 6592, Springer, 2011, pp. 31–41. In N.T. Nquyen et al. (eds.).Google Scholar
  94. 214.
    A. Shokripour, M. Othman, H. Ibrahim and S. Subramaniam, “New Method for Scheduling Heterogeneous Multi-Installment Systems, Future Generation Computer Systems, vol. 28, no. 8, 2012, pp. 1205–1216.CrossRefGoogle Scholar
  95. 217.
    J. Sohn and T.G. Robertazzi, “Optimal Load Sharing for a Divisible Job on a Bus Network,” IEEE Transactions on Aerospace and Electronic Systems, vol. 32, no. 1, Jan. 1996, pp. 34–40.Google Scholar
  96. 218.
    (a) J. Sohn, T.G. Robertazzi and S. Luryi, “Optimizing Computing Costs using Divisible Load Analysis,” IEEE Transactions on Parallel and Distributed Systems, vol. 9, March 1998, pp. 225–234. Also related: T.G. Robertazzi, S. Luryi and J. Sohn, Load Sharing Controller for Optimizing Monetary Cost, US Patent 5,889,989, March 30, 1999. T.G. Robertazzi, S. Luryi and S. Charcranoon, Load Sharing Controller for Optimizing Resource Utilization Cost, US Patent 6,370,560, April 9, 2002.Google Scholar
  97. 219.
    (b) J. Sohn and T.G. Robertazzi, “Optimal Time Varying Load Sharing for Divisible Loads,” IEEE Transactions on Aerospace and Electronic Systems, vol. 34, no. 3, July 1998, pp. 907–924.Google Scholar
  98. 221.
    S. Suresh, V. Mani and S.N. Omkar, “The Effect of Start-Up Delays in Scheduling Divisible Load on Bus Networks: An Alternate Approach,” Computers and Mathematics with Applications, vol. 46, 2003, 1545–1557.MathSciNetCrossRefGoogle Scholar
  99. 222.
    (a) S. Suresh, C. Run, H.J. Kim, T.G. Robertazzi and Y.-I. Kim, “Scheduling Second Order Computational Load in Master-Slave Paradigm,” IEEE Transactions on Aerospace and Electronic Systems, vol. 48, no. 1, 2012, pp. 380–393.Google Scholar
  100. 223.
    (b) S. Suresh, H.J. Kim, C. Run and T.G. Robertazzi, “Scheduling Nonlinear Divisible Loads in a Single Level Tree Network,” Journal of Supercomputing, vol. 61, 2012, pp. 1068–1088.Google Scholar
  101. 224.
    S. Suresh, H. Huang and H.J. Kim, “Scheduling in Computer Cloud with Multiple Data Banks using Divisible Load Paradigm”, IEEE Transactions on Aerospace and Electronic Systems, vol. 51, no. 2, 2015, pp. 1288–1297.CrossRefGoogle Scholar
  102. 231.
    B. Veeravalli and W.H. Min, “Scheduling Divisible Loads on Heterogenous Linear Daisy Chain Networks with Arbitrary Processor Release Times,” IEEE Transactions on Parallel and Distributed Systems, vol, 15, no. 3, 2004, pp. 273–288.Google Scholar
  103. 237.
    K. Wang and T.G. Robertazzi, “Scheduling Divisible Loads with Nonlinear Communication Time,” IEEE Transactions on Aerospace and Electronic Systems, vol. 51, no. 3, 2015, pp. 2479–2485.CrossRefGoogle Scholar
  104. 238.
    X. Wang, and B. Veeravalli, “Performance Characterization on Handling Large-scale Partitionable Workloads on Heterogeneous Networked Compute Platforms,” IEEE Transactions on Parallel and Distributed Computing, accepted 2019.Google Scholar
  105. 244.
    F. Wu, Scheduling Load Computation and Communication in Virtualized Networks, PhD Thesis, Stony Brook University, Dec. 2018.Google Scholar
  106. 246.
    H. Xuan, S. Wei, W. Tong, et al., “Fault-Tolerant Scheduling Algorithm with Re-allocation for Divisible Task,” IEEE Access, 2018.Google Scholar
  107. 247.
    H. Yamamoto, M. Tsuru and Y. Oie, “Parallel Transferable Uniform Multi-round Algorithm for Achieving Minimum Application Turnaround Times for Divisible Workload,” Lecture Notes in Computer Science 3726, 2005, pp, 817–828, in L.T. Yang et al. (eds.), Proceedings of HPCC 2005.Google Scholar
  108. 248.
    H. Yamamoto, M. Tsuru and Y. Oie, “Parallel Transferable Uniform Multi-round Algorithm in Heterogeneous Distributed Computing Environment,” Lecture Notes in Computer Science 4208, 2006, pp, 51–60, in M. Gerndt and D. Kranzlmuller (eds.), Proceedings of HPCC 2006.Google Scholar
  109. 249.
    Y. Yang, K. van der Raadt and H. Casanova, “Multiround Algorithms for Scheduling Divisible Loads,” IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 11, 2005, pp. 1092–1102.CrossRefGoogle Scholar
  110. 251.
    (a) Z. Ying, Signature Search and Computing Cost Optimization in Distributed Networks, Ph.D Thesis, Stony Brook University, 2014.Google Scholar
  111. 252.
    (b) Z. Ying and T.G. Robertazzi, “Signature Searching in a Networked Collection of Files,” IEEE Transactions on Parallel and Distributed Systems, vol. 25, no. 5, 2014, pp. 1339–1348.Google Scholar
  112. 255.
    Z. Zhang, A Novel Analysis Method for Parallel Processing, Ph.D Thesis, Stony Brook University, Dec. 2014.Google Scholar
  113. 256.
    Z. Zhang and T.G. Robertazzi, “Scheduling Divisible Loads in Gaussian, Mesh and Torus Networks of Processors,” IEEE Transactions on Computers, vol. 64, no. 11, 2015, pp. 3249–3264.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Thomas G. Robertazzi
    • 1
  • Li Shi
    • 1
  1. 1.Stony Brook UniversityStony BrookUSA

Personalised recommendations