Skip to main content
SpringerLink
Log in

A “Generalized k-Tree-Based Model to Sub-system Allocation” for Partitionable Multi-dimensional Mesh-Connected Architectures

  • Conference paper
  • First Online:
High Performance Computing (ISHPC 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1940))

Included in the following conference series:

  • 614 Accesses

Abstract

This paper presents a new processor allocation approach called “a generalized k-Tree-based model” to perform dynamic sub-system allocation/ deallocation decision for partitionable multi-dimensional mesh-connected architectures. Time complexity of our generalized k-tree-based sub-system allocation algorithm is O(k42k(NA +NF )+k222k) for the partitionable k-D meshes and O(NA +NF ) for the partitionable 2-D meshes, where NA is the maximum number of allocated tasks, NF is the corresponding number of free sub-meshes, N is the system size, and NA +NF ⩽ N. Most existing processor allocation strategies have been proposed for the partitionable 2-D meshes with various degrees of time complexity and system performance. In order to evaluate the system performance, the generalized k-Tree-based model was developed and by simulation studies the results of applying our k-Tree-based approach for the partitionable 2-D meshes were presented and compared to existing 2-D mesh-based strategies. Our results showed that the k-Tree-based approach (when it was applied for the partitionable 2-D meshes) yielded the comparable system performance to those recently 2-D mesh-based strategies.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chuang, P.J., Tzeng, N.F.: An Efficient Submesh Allocation Strategy for Mesh Computer Systems. In Procs. of Int’l Conf. on Distributed Computing Systems, May (1991) 256–263

    Google Scholar 

  2. Das Sharma, D., Pradhan, D. K.: A Fast and Efficient Strategy for Submesh Allocation in Mesh-Connected Parallel Computers. In Procs. of the 5th IEEE Symp. on Parallel and Distributed Processing (1993) 682–689

    Google Scholar 

  3. Das Sharma, D., Pradhan, D. K.: Submesh Allocation in Mesh Multicomputers Using Busy-List: A Best-Fit Approach with Complete Recognition Capability. Journal of Parallel and Distributed Computing, Vol. 36 (1996) 106–118

    Article  Google Scholar 

  4. Ding, J., Bhuyan, L.N.: An Adaptive Submesh Allocation Strategy for Two-Dimensional Mesh Connected Systems. In Procs. of Int’l Conf. on Parallel Processing, Vol. II (1993) 193–200

    Google Scholar 

  5. Kim, G., Yoon, H.: On Submesh Allocation for Mesh Multicomputers: A Best-Fit Allocation and a Virtual Submesh Allocation for Faulty Meshes. IEEE Transactions on Parallel and Distributed Systems, Vol. 9(2) (1998) 175–185

    Article  Google Scholar 

  6. Li, K., Cheng, K.H.: Job Scheduling in a Partitionable Mesh Using a Two-Dimensional Buddy System Partitioning Scheme. IEEE Transactions on Parallel and Distributed Systems, Vol. 2(4) (1991) 413–422

    Article  Google Scholar 

  7. Liu, T., et. al.: A Submesh Allocation Scheme for Mesh-Connected Multiprocessor Systems. In Proceedings of 1995 Int’l Conf. on Parallel Processing, Vol. II (1995) 159–163

    Google Scholar 

  8. Mattson, et al.: Intel/Sandia ASCI system. In Procs. of Int’l Parallel Processing Symposium (1996)

    Google Scholar 

  9. Mohapatra, P.: Processor Allocation Using Partitioning in Mesh Connected Parallel Computers.: Journal of Parallel and Distributed Computing, Vol. 39 (1996) 181–190

    Article  Google Scholar 

  10. Srisawat, J., Alexandridis, N.A.: Efficient Processor Allocation Scheme with Task Embedding for Partitionable Mesh Architectures. In Procs. of Int’l Conf. on Computer Applications in Industry and Engineering, Las Vegas, November (1998) 305–308

    Google Scholar 

  11. Srisawat, J., Alexandridis, N.A.: Reducing System Fragmentation in Dynamically Partitionable Mesh-Connected Architectures. In Procs. of Int’l Conf. on Parallel and Distributed Computing and Networks, Australia, December (1998) 241–244

    Google Scholar 

  12. Srisawat, J., Alexandridis, N.A.: A New Quad-Tree-Based Sub-System Allocation Technique for Mesh-Connected Parallel Machines. In Procs. of the 13thACM-SIGARCH Int’l Conf. on Supercomputing, Greece, June (1999) 60–67

    Google Scholar 

  13. Yoo, S., et. al.: An Efficient Task Allocation Scheme for 2D Mesh Architectures. IEEE Transactions on Parallel and Distributed systems, Vol. 8(9) (1997) 934–942

    Article  MathSciNet  Google Scholar 

  14. Zhu, Y.: Efficient Processor Allocation Strategies for Mesh-Connected Parallel Computers. Journal of Parallel and Distributed Computing, Vol.16 (1992) 328–337

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. King Mongkut’s Institute of Technology Ladkrabang, 10520, Bangkok, THAILAND

    Srisawat Jeeraporn

  2. The George Washington University, DC 20052, Washington, USA

    Alexandridis A. Nikitas

Authors
  1. Srisawat Jeeraporn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexandridis A. Nikitas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Arquitectura de Computadores, Universidad Politecnica de Catalunya, Spain

    Mateo Valero

  2. Department of Information and Computer Sciences, Nara Women’s University, Japan

    Kazuki Joe

  3. Institute of Industrial Science Center for Conceptual Information Processing Research, University of Tokyo, Japan

    Masaru Kitsuregawa

  4. Graduate School of Engineering Electrical Engineering Department, University of Tokyo, Japan

    Hidehiko Tanaka

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jeeraporn, S., Nikitas, A.A. (2000). A “Generalized k-Tree-Based Model to Sub-system Allocation” for Partitionable Multi-dimensional Mesh-Connected Architectures. In: Valero, M., Joe, K., Kitsuregawa, M., Tanaka, H. (eds) High Performance Computing. ISHPC 2000. Lecture Notes in Computer Science, vol 1940. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39999-2_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-39999-2_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41128-4

  • Online ISBN: 978-3-540-39999-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation