Skip to main content
Springer Nature Link
Log in

A Performance Comparison of the Contiguous Allocation Strategies in 3D Mesh Connected Multicomputers

  • Conference paper
Parallel and Distributed Processing and Applications (ISPA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4742))

  • 817 Accesses

Abstract

The performance of contiguous allocation strategies can be significantly affected by the distribution of job execution times. In this paper, the performance of the existing contiguous allocation strategies for 3D mesh multicomputers is re-visited in the context of heavy-tailed distributions (e.g., a Bounded Pareto distribution). The strategies are evaluated and compared using simulation experiments for both First-Come-First-Served (FCFS) and Shortest-Service-Demand (SSD) scheduling strategies under a variety of system loads and system sizes. The results show that the performance of the allocation strategies degrades considerably when job execution times follow a heavy-tailed distribution. Moreover, SSD copes much better than FCFS scheduling strategy in the presence of heavy-tailed job execution times. The results also show that the strategies that depend on a list of allocated sub-meshes for both allocation and deallocation have lower allocation overhead and deliver good system performance in terms of average turnaround time and mean system utilization.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Yoo, B.-S., Das, C.-R.: A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers. IEEE Transactions on Parallel & Distributed Systems 51(1), 46–60 (2002)

    Google Scholar 

  2. Peterson, C., Sutton, J., Wiley, P.: iWARP: a 100-MPOS, LIW microprocessor for multicomputers. IEEE Micro 11(3), 26–29, 81-87 (1991)

    Article  Google Scholar 

  3. Cray: Cray XT3 Datasheet (2004)

    Google Scholar 

  4. Chiu, G.-M., Chen, S.-K.: An efficient submesh allocation scheme for two-dimensional meshes with little overhead. IEEE Transactions on Parallel & Distributed Systems 10(5), 471–486 (1999)

    Article  Google Scholar 

  5. Choo, H., Yoo, S., Youn, H.-Y.: Processor scheduling and allocation for 3D torus multicomputer systems. IEEE Transactions on Parallel & Distributed Systems 11(5), 475–484 (2000)

    Article  Google Scholar 

  6. Ababneh, I.: An Efficient Free-list Submesh Allocation Scheme for two-dimensional mesh-connected multicomputers. Journal of Systems and Software 79(8), 1168–1179 (2006)

    Article  Google Scholar 

  7. Ababneh, I.: Job scheduling and contiguous processor allocation for three-dimensional mesh multicomputers. AMSE Advances in Modelling & Analysis 6(4), 43–58 (2001)

    Google Scholar 

  8. Intel Corporation: A Touchstone DELTA system description (1991)

    Google Scholar 

  9. Wei, J., Zhou, X., Xu, C-Z.: Robust Processing Rate Allocation for Proportional Slowdown Differentiation on Internet Servers. IEEE Transactions on Computers 54(8), 964–977 (2005)

    Article  Google Scholar 

  10. Windisch, K., Miller, J.V., Lo, V.: ProcSimity: an experimental tool for processor allocation and scheduling in highly parallel systems. In: Frontiers 1995. Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation, Washington, DC, USA, pp. 414–421. IEEE Computer Society Press, Los Alamitos (1995)

    Google Scholar 

  11. Seo, K.-H.: Fragmentation-Efficient Node Allocation Algorithm in 2D Mesh-Connected Systems. In: ISPAN 2005. Proceedings of the 8th International Symposium on Parallel Architecture, Algorithms and Networks, pp. 318–323. IEEE Computer Society Press, Los Alamitos (2005)

    Google Scholar 

  12. Seo, K.-H., Kim, S.-C.: Improving system performance in contiguous processor allocation for mesh-connected parallel systems. The Journal of Systems and Software 67(1), 45–54 (2003)

    Article  MathSciNet  Google Scholar 

  13. He, L., Jarvis, S., Spooner, D., Jiang, H., Dillenberger, D., Nudd, G.: Allocating Non-Real-Time and Soft Real-Time Jobs in Multiclusters. IEEE Transactions on Parallel and Distributed Systems 17(2), 99–112 (2006)

    Article  Google Scholar 

  14. Blumrich, M., Chen, D., Coteus, P., Gara, A., Giampapa, M., Heidelberger, P., Singh, S., Steinmacher-Burow, B., Takken, T., Vranas, P.: Design and Analysis of the BlueGene/L Torus Interconnection Network, IBM Research Report RC23025, IBM Research Division, Thomas J. Watson Research Center (December 3, 2003)

    Google Scholar 

  15. Harchol-Balter, M.: The Effect of Heavy-Tailed Job Size Distributions on Computer System Design. In: Proceedings of ASA-IMS Conference on Applications of Heavy Tailed Distributions in Economics, Engineering and Statistics, Washington, DC (June 1999)

    Google Scholar 

  16. Crovella, M.E., Lipsky, L.: Long-Lasting Transient Conditions in Simulations with Heavy-Tailed Workloads. In: Proceedings of the 1997 Winter Simulation Conference, December 7-10, pp. 1005–1012 (1997)

    Google Scholar 

  17. Harchol-Balter, M., Crovella, M.E., Murta, C.D.: On Choosing a Task Assignment Policy for a Distributed Server System. Journal of Parallel and Distributed Computing 59(2), 204–228 (1999)

    Article  Google Scholar 

  18. ProcSimity V4.3 User’s Manual: University of Oregon (1997)

    Google Scholar 

  19. Kessler, R.E., Swarszmeier, J.L.: Cray T3D: a new dimension for Cray research. In: Proc. CompCon., pp. 176–182 (1993)

    Google Scholar 

  20. Bani-Mohammad, S., Ould-Khaoua, M., Ababneh, I., Mackhenzie, L.M.: An Efficient Turning Busy List Sub-mesh Allocation Strategy for 3D Mesh Connected Multicomputers. In: Proceedings of the 7th Annual PostGraduate Symposium on the Convergence of Telecommunications, Networking & Broadcasting PGNET, Liverpool John Moores University, UK, June 26-27, 2006, pp. 37–43 (2006)

    Google Scholar 

  21. Bani-Mohammad, S., Ould-Khaoua, M., Ababneh, I., Mackhenzie, L.M.: An Efficient Processor Allocation Strategy that Maintains a High Degree of Contiguity among Processors in 2D Mesh Connected Multicomputers, 2007. In: AICCSA 2007. ACS/IEEE International Conference on Computer Systems and Applications, Amman, Jordan, 13-16 May, IEEE Computer Society Press, Los Alamitos (2007)

    Google Scholar 

  22. Bani-Mohammad, S., Ould-Khaoua, M., Ababneh, I., Machenzie, L.: A Fast and Efficient Processor Allocation Strategy which Combines a Contiguous and Non-contiguous Processor Allocation Algorithms. Technical Report; TR-2007-229, DCS Technical Report Series, University of Glasgow (January 2007)

    Google Scholar 

  23. Bani-Mohammad, S., Ould-Khaoua, M., Ababneh, I., Machenzie, L.: A Fast and Efficient Strategy for Sub-mesh Allocation with Minimal Allocation Overhead in 3D Mesh Connected Multicomputers. Ubiquitous Computing and Communication Journal 1 (2006) ISSN 1992-8424

    Google Scholar 

  24. Bani-Mohammad, S., Ould-Khaoua, M., Ababneh, I., Machenzie, L.: Non-contiguous Processor Allocation Strategy for 2D Mesh Connected Multicomputers Based on Sub-meshes Available for Allocation. In: ICPADS 2006. Proceedings of the 12th International Conference on Parallel and Distributed Systems, Minneapolis, Minnesota, USA, vol. 2, pp. 41–48. IEEE Computer Society Press, Los Alamitos (2006)

    Google Scholar 

  25. Varavithya, V.: Multicasting in wormhole routed multicomputers, Ph.D. Thesis, Department of Electrical and Computer Engineering, Iowa State University (1998)

    Google Scholar 

  26. Tabatabaee, V., Tiwari, A., Hollingsworth, J.K.: Parallel Parameter Tuning for Applications with Performance Variability. In: Gschwind, T., Aßmann, U., Nierstrasz, O. (eds.) SC 2005. LNCS, vol. 3628, Springer, Heidelberg (2005)

    Google Scholar 

  27. Athas, W., Seitz, C.: Multicomputers: message-passing concurrent computers. IEEE Computer 21(8), 9–24 (1988)

    Google Scholar 

  28. Qiao, W., Ni, L.: Efficient processor allocation for 3D tori, Technical Report, Michigan State University, East Lansing, MI, 48824-1027 (1994)

    Google Scholar 

  29. Zhu, Y.: Efficient processor allocation strategies for mesh-connected parallel computers. Journal of Parallel and Distributed Computing 16(4), 328–337 (1992)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, University of Glasgow, Glasgow G12 8QQ, UK

    Saad Bani-Mohammad, Mohamed Ould-Khaoua & Lewis Mackenzie

  2. Department of Computing Science, Al al-Bayt University, Mafraq, Jordan

    Ismail Ababneh

Authors
  1. Saad Bani-Mohammad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohamed Ould-Khaoua
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ismail Ababneh
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lewis Mackenzie
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ivan Stojmenovic Ruppa K. Thulasiram Laurence T. Yang Weijia Jia Minyi Guo Rodrigo Fernandes de Mello

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bani-Mohammad, S., Ould-Khaoua, M., Ababneh, I., Mackenzie, L. (2007). A Performance Comparison of the Contiguous Allocation Strategies in 3D Mesh Connected Multicomputers. In: Stojmenovic, I., Thulasiram, R.K., Yang, L.T., Jia, W., Guo, M., de Mello, R.F. (eds) Parallel and Distributed Processing and Applications. ISPA 2007. Lecture Notes in Computer Science, vol 4742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74742-0_58

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74742-0_58

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74741-3

  • Online ISBN: 978-3-540-74742-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics