Comparison of SBA – Family Task Allocation Algorithms for Mesh Structured Networks

  • Leszek Koszalka
  • Michal Kubiak
  • Iwona Pozniak-Koszalka
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4331)


In the last years, computer networks with mesh structure become a common computing platform. It is very important to find free resources for executing incoming jobs in a short time. The objective of the paper is a comparison between five task allocation algorithms. The evaluation of algorithms properties has been carried out with utilization of the designed and implemented experimentation system. The investigations have been concentrated on complexity as the introduced measure of efficiency. Moreover, a concept of an experimentation system allowing research for allocation in dynamic mode is presented.


Allocation Algorithm Task Allocation Allocation Process Free Node Candidate Block 
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 IARIA ICN 2006 Conf., 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 Int. Conf. on Parallel Processing (1997)Google Scholar
  3. 3.
    Koszalka, L., Lisowski, D., Pozniak-Koszalka, I.: Comparison of Allocation Algorithms for Mesh Structured Networks with Using Multistage Simulation. 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.
    Batcher, K.E.: Architecture of Massively Parallel Processor. In: Proc. of Intern. Conf. on Computer Architecture, pp. 174–179 (1998)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 Distrib-uted 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, 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Leszek Koszalka
    • 1
  • Michal Kubiak
    • 1
  • Iwona Pozniak-Koszalka
    • 1
  1. 1.Chair of Systems and Computer Networks, Faculty of ElectronicsWroclaw University of TechnologyWroclawPoland

Personalised recommendations