Scalable Schesuling for Cluster and Grids using Cut Through Switching

J.T. Hung and T.G. Robertazzi

References

  1. [1] V. Bharadwaj, D. Ghose, V. Mani, & T.G. Robertazzi, Scheduling divisible loads in parallel and distributed systems (Los Alamitos, CA: IEEE Computer Society, 1996).
  2. [2] Y.C. Cheng & T.G. Robertazzi, Distributed computation with communication delays, IEEE Trans. on Aerospace and Electronic Systems, 24(6), 1988, 700–712. doi:10.1109/7.18637
  3. [3] G.D. Barlas, Collection aware optimum sequencing of operations and closed form solutions for the distribution of divisible load on arbitrary processor trees, IEEE Trans. on Parallel and Distributed Systems, 9(5), 1998, 429–441. doi:10.1109/71.679214
  4. [4] S. Bataineh & T.G. Robertazzi, Bus oriented load sharing for anetwork of sensor driven processors, IEEE Trans. on Systems,Man and Cybernetics, 21(5), 1991, 1202–1205. doi:10.1109/21.120070
  5. [5] V. Bharadwaj, D. Ghose, & V. Mani, Multi-installment loaddistribution in tree networks with delay, IEEE Trans. onAerospace and Electronic Systems, 31(2), 1995, 555–567. doi:10.1109/7.381944
  6. [6] V. Bharadwaj, D. Ghose, & V. Mani, An efficient load distribution strategy for a distributed linear network of processorswith communication delays, Computers and Mathematics withApplications, 29(9), 1995, 95–112. doi:10.1016/0898-1221(95)00039-2
  7. [7] J. Blazewicz & M. Drozdowski, Scheduling divisible jobs onhypercubes, Parallel Computing, 21(12), 1995, 1945–1956. doi:10.1016/0167-8191(95)00046-1
  8. [8] J. Blazewicz & M. Drozdowski, The performance limits of a twodimensional network of load sharing processors, Foundationsof Computing and Decision Sciences, 21(1), 1996, 3–15.
  9. [9] J. Blazewicz & M. Drozdowski, Distributed processing ofdivisible jobs with communication start-up costs, DiscreteApplied Mathematics, 76(1–3), 1997, 21–41. doi:10.1016/S0166-218X(96)00115-1
  10. [10] J. Sohn & T.G. Robertazzi, Optimal time varying load sharingfor divisible loads, IEEE Trans. on Aerospace and ElectronicSystems, 34(3), 1998, 907–924. doi:10.1109/7.705897
  11. [11] V. Bharadwaj & G. Barlas, Efficient scheduling strategies forprocessing multiple divisible loads on bus networks, Journalof Parallel and Distributed Computing, 62, 2002, 132–151. doi:10.1006/jpdc.2001.1778
  12. [12] O. Beaumont, L. Carter, J. Ferrante, A. Legrand, & Y. Robert,Bandwidth-centric allocation of independent tasks on heterogeneous platforms, Proc. Int. Parallel and Distributed ProcessingSymp. (IPDPS ’02), Ft. Lauderdale, FL, 2002. doi:10.1109/IPDPS.2002.1015568
  13. [13] Y. Yang & H. Casanova, UMR: A multi-round algorithmfor scheduling divisible workloads, Proc. Int. Parallel andDistributed Processing Symp. (IPDPS ’03), Nice, France, 2003.
  14. [14] J.T. Hung, H.J. Kim, & T.G. Robertazzi, Scalable scheduling inparallel processors, Proc. 2002 Conf. on Information Sciencesand Systems, Princeton, NJ, 2002.
  15. [15] D.A.L. Piriyakumar & C.S.R. Murthy, Distributed computation for a hypercube network of sensor-driven processors with communication delays including setup time, IEEE Trans.on Systems, Man, and Cybernetics—Part A: Systems and Humans, 28(2), 1998, 245–251. doi:10.1109/3468.661152
  16. [16] V. Kumar, A.Y. Grama, & N.R. Vempaty, Scalable loadbalancing techniques for parallel computers, Journal of Paralleland Distributed Computing, 22, 1994, 60–79. doi:10.1006/jpdc.1994.1070
  17. [17] S. Pande, D.P. Agrawal, & J. Mauney, A scalable schedulingscheme for functional parallelism on distributed memory multiprocessor systems, IEEE Trans. on Parallel and Distributed Systems, 6, 1995, 388–399. doi:10.1109/71.372792
  18. [18] D.E. Culler & J.P. Singh, Parallel computer architecture (SanFrancisco, CA: Morgan Kaufmann, 1999).
  19. [19] J.T. Hung, Scalable scheduling in parallel, distributed, andgrid systems, doctoral diss., Stony Brook University, StonyBrook, NY, 2003.
  20. [20] H.J. Kim, A novel load distribution algorithm for divisibleloads, Special Issue of Cluster Computing on Divisible LoadScheduling, 6(1), 2002, 41–46.
  21. [21] S. Bataineh, T.Y. Hsiung, & T.G. Robertazzi, Closed form solutions for bus and tree networks of processors load sharing a divisible job, IEEE Trans. on Computers, 43(10), 1994, 1184-1196 doi:10.1109/12.324544

Important Links:

Go Back