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

  • Leszek Koszalka
  • Dominik Lisowski
  • Iwona Pozniak-Koszalka
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3984)


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.


Completion Time Base Block Allocation Algorithm Base Node Allocation Process 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kasprzak, A.: Topological Design of the Wide Area Networks. Wroclaw University of Technology Press, Wroclaw (2001)Google Scholar
  2. 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. 3.
    Yang, Y., Wang, J.: Pipelined all-to-all Broadcast in all-port Meshes. IEEE Transactions on Computers 10, 1020–1031 (2001)CrossRefGoogle Scholar
  4. 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. 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. 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)CrossRefGoogle Scholar
  7. 7.
    Koszalka, L.: A Concept of Adaptive Control System for Experimentation and Controlling Described by Relation. SAMS 3, 219–235 (1994)Google Scholar
  8. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Leszek Koszalka
    • 1
  • Dominik Lisowski
    • 1
  • Iwona Pozniak-Koszalka
    • 1
  1. 1.Chair of Systems and Computer Networks, Faculty of ElectronicsWrocław University of TechnologyWrocławPoland

Personalised recommendations