PROCESSOR ALLOCATION AND JOB SCHEDULING ON 3D MESH INTERCONNECTION NETWORKS

S.B. Mohammad, M.O. Khaoua, L.M. Mackenzie, and I. Ababneh

References

  1. [1] G.-M. Chiu & S.-K. Chen, An efficient submesh allocation scheme for two-dimensional meshes with little overhead, IEEE Transactions Parallel and Distributed Systems, 10 (5), 1999, 471–486. doi:10.1109/71.770192
  2. [2] H. Choo, S. Yoo, & H.-Y. Youn, Processor scheduling and allocation for 3D torus multicomputer systems, IEEE Transactions Parallel and Distributed Systems, 11 (5), 2000, 475–484. doi:10.1109/71.852400
  3. [3] P.-J. Chuang & N.-F. Tzeng, Allocating precise submeshes in mesh connected systems, IEEE Transactions Parallel and Distributed Systems, 5 (2), 1994, 211–217. doi:10.1109/71.265948
  4. [4] W. Qiao & L. Ni, Efficient processor allocation for 3D tori, Technical Report, Michigan State University, East Lansing, MI, 48824-1027, 1994.
  5. [5] Y. Zhu, Efficient processor allocation strategies for mesh-connected parallel computers, Journal of Parallel and Distributed Computing, 16 (4), 1992, 328–337. doi:10.1016/0743-7315(92)90016-G
  6. [6] C.-Y. Chang & P. Mohapatra, Performance improvementof allocation schemes for mesh-connected computers, Journal Parallel and Distributed Computing, 52 (1), 1998,40–68. doi:10.1006/jpdc.1998.1459
  7. [7] I. Ababneh & F. Fraij, Folding contiguous and non-contiguous space sharing policies for parallel computers, Mu’tah Lil-Buhuth wad-Dirasat, Natural and Applied Sciences Series, 16 (3), 2001, 9–34.
  8. [8] I. Ababneh, Job scheduling and contiguous processor allocation for three-dimensional mesh multicomputers, AMSE Advances in Modelling and Analysis, 6 (4), 2001, 43–58.
  9. [9] V. Lo, K. Windisch, W. Liu, & B. Nitzberg, Non-contiguous processor allocation algorithms for mesh-connected multicomputers, IEEE Transactions Parallel and Distributed Systems, 8 (7), 1997, 712–726. doi:10.1109/71.598346
  10. [10] K. Li & K.-H. Cheng, A two-dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system, Journal of Parallel and Distributed Computing, 12 (1), 1991, 79–83. doi:10.1016/0743-7315(91)90032-5
  11. [11] Y.-J. Tsai & P. McKinley, An extended dominating node approach to broadcast and global combine in multiport wormhole-routed mesh networks, IEEE Transactions Parallel and Distributed Systems, 8 (1), 1997, 41–58. doi:10.1109/71.569654
  12. [12] E. Anderson, J. Brooks, C. Grassl, & S. Scott, Performance of the Cray T3E multiprocessor, Proc. Supercomputing Conference, San Jose, CA, 1997, 1–17.
  13. [13] W. Athas & C. Seitz, Multicomputers: Message-passing concurrent computers, IEEE Computer, 21 (8), 1988, 9–24.
  14. [14] B.-S.Yoo & C.-R. Das, A fast and efficient processor allocation scheme for mesh-connected multicomputers, IEEE Transactions on Parallel and Distributed Systems, 51 (1), 2002, 46–60.
  15. [15] S. Bani-Mohammad, M. Ould-Khaoua, & I. Ababneh, A simulation study of allocation strategies on the mesh interconnection networks, Proc. PGNet 2005, The 6th Annual PostGraduate Symposium on the Convergence of Telecommunications, Networking and Broadcasting, Liverpool John Moores University, Liverpool, UK, 2005, 197–202.
  16. [16] I. Ismail & J. Davis, Program-based static allocation policies for highly parallel computers, Proc. IPCCC 95, IEEE Computer Society Press, Scottsdale, AZ, USA, 1995, 61–68.

Important Links:

Go Back