Skip to main content

Comparison of Allocation Algorithms for Mesh Structured Networks with Using Multistage Simulation

  • Conference paper

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

Abstract

In multicomputers and computer networks a proper allocation of incoming jobs has a big impact on efficiency of parallel and distributed computing. In this paper, the mesh topology and processor allocation with using First Fit (FF) and Stack-Based (SBA) schemes, are considered. The algorithms proposed by authors SSBA (Stack-Based with Sorting) and BFSBA (Better Fit Stack-Based) are described and analyzed. Evaluation of algorithm’s properties has been done with using the proposed experimentation system. This system consists of such modules like experiment design, visualization of allocation processes, presentation of results of series of experiments for the introduced measures of efficiency. The investigations, carried out in this system, show advantages of the proposed algorithms.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kasprzak, A.: Topological Design of the Wide Area Networks. Wroclaw University of Technology Press, Wroclaw (2001)

    Google Scholar 

  2. Liu, T., Huang, W., Lombardi, F., Bhutan, L.N.: A Submesh Allocation Scheme for Mesh Connected Processor Systems. Parallel Processing 11, 159–163 (1995)

    Google Scholar 

  3. Yang, Y., Wang, J.: Pipelined all-to-all Broadcast in all-port Meshes. IEEE Transactions on Computers 10, 1020–1031 (2001)

    Article  Google Scholar 

  4. Li, K., Cheng, K.H.: A two dimensional Buddy System for Dynamic Resource Allocation in Mesh Connected System. In: Proc. of ACM Computer Science Conference, vol. 2, pp. 22–28 (1990)

    Google Scholar 

  5. Chuang, P.J., Tzeng, N.F.: An Efficient Submesh Allocation Strategy for Mesh Systems. In: Proc. of Int. Conference on Distributed Computing, vol. 5, pp. 256–263 (1991)

    Google Scholar 

  6. Yoo, B.S., Das, C.R.: Fast and Efficient Procesor Allocation Scheme for Mesh-Connected Multicomputers. IEEE Transactions. on Computers 1, 46–59 (2002)

    Article  Google Scholar 

  7. Koszalka, L.: A Concept of Adaptive Control System for Experimentation and Controlling Described by Relation. SAMS 3, 219–235 (1994)

    Google Scholar 

  8. Lisowski, D., Koszalka, L.: Processor Allocation Algorithms for Mesh Systems. In: Proc. of Int. Conference on Systems Engineering, Coventry, vol. 2, pp. 410–416 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koszalka, L., Lisowski, D., Pozniak-Koszalka, I. (2006). Comparison of Allocation Algorithms for Mesh Structured Networks with Using Multistage Simulation. In: Gavrilova, M.L., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3984. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751649_7

Download citation

  • DOI: https://doi.org/10.1007/11751649_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34079-9

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics