Static and Dynamic Allocation Algorithms in Mesh Structured Networks

  • Leszek Koszalka
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4317)


The objective of the paper is an evaluation of task allocation algorithms for computer networks with mesh topology. The properties of algorithms have been researched with the designed and implemented experimentation system. The system gives opportunities for simulating allocation processes in the static mode and in the dynamic mode, as well. The investigations have been concentrated on comparing algorithm complexity as the introduced measure of efficiency. The obtained results justify a conclusion that the proposed Window Stack Based Algorithm is very promising.


Dynamic Mode Allocation Algorithm Task Allocation Queue Size 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.
    Koszalka, L., Kubiak, M., Pozniak-Koszalka, I.: Allocation Algorithm for Mesh-Structured Networks. In: Proc. of 5th ICN Conference IARIA, ICN5: Management, Mauritius, IEEE Computer Society Press, Los Alamitos (2006)Google Scholar
  2. 2.
    Chang, C., Mohapatra, P.: An Integrated Processor Management Scheme for Mesh-Connected Multicomputer System. In: Proc. of International Conference on Parallel Processing (August 1997)Google Scholar
  3. 3.
    Koszalka, L., Lisowski, D., Pozniak-Koszalka, I.: Comparison of Allocation Algorithms for Mesh - Structured Networks with Using Multistage Experiment. In: Gavrilova, M.L., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Laganá, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol. 3984, pp. 58–67. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  4. 4.
    Chmaj, G., Zydek, D., Koszalka, L.: Comparison of Task Allocation Algorithms for Mesh-Structured Systems, Computer Systems Engineering. In: Proc. of 4th Polish-British Workshop, pp. 39–50 (2004)Google Scholar
  5. 5.
    Sharma, D.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 1, 106–118 (1996)CrossRefGoogle Scholar
  6. 6.
    Byung, S., Das, C.R.: A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers. IEEE Trans. on Computers 1, 46–59 (2002)Google Scholar
  7. 7.
    De, M., Das, D., Ghosh, M.: An Efficient Sorting Algorithm on the Multi-Mesh Network. IEEE Trans. on Computers 10, 1132–1136 (1997)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Yang, Y., Wang, J.: Pipelined All-to-All Broadcast in All-Port Meshes and Tori. IEEE Trans. on Computers 10, 1020–1031 (2001)CrossRefGoogle Scholar
  9. 9.
    Agarwal, A.: The MIT Alewife Machine: Architecture and Performance. Computer Architecture, 2–13 (1995)Google Scholar
  10. 10.
    Kasprzak, A.: Packet Switching Wide Area Networks. In: WPWR, Wroclaw (1997) (in Polish)Google Scholar
  11. 11.
    Liu, T., Huang, W., Lombardi, F., Bhutan, L.N.: A Submesh Allocation for Mesh-Connected Multiprocessor Systems. Parallel Processing, 159–163 (1995)Google Scholar
  12. 12.
    Batcher, K.E.: Architecture of a massively parallel processor. In: Proc. of International Conference on Computer Architecture, pp. 174–179 (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Leszek Koszalka
    • 1
  1. 1.Chair of Systems and Computer Networks, Faculty of ElectronicsWroclaw University of TechnologyWroclawPoland

Personalised recommendations