Advertisement

Comparison of Allocation Algorithms in Mesh Oriented Structures for Different Scheduling Techniques

  • Bartosz Bodzon
  • Leszek Koszalka
  • Iwona Pozniak-Koszalka
  • Andrzej Kasprzak
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7654)

Abstract

The paper concerns task allocation problem in mesh structured system. The dynamic case is considered. Four allocation algorithms have been evaluated. The research was focused on the impact of task scheduling technique co-operated with allocation algorithms. Two queuing schemes were compared: well-known First Come First Served and newly created, by the authors of this paper, heuristic scheduling technique called First Few Random. The comparison of efficiencies of different allocation algorithms combined with different queuing schemes has been done on the basis of simulation experiments made with a designed experimentation system. The discussion of the obtained results confirms that the proposed approach and created queuing scheme seem to be promising.

Keywords

Mesh structure task allocation algorithm scheduling experimentation system 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    The New York Times, http://www.nytimes.com/ (accessed June 20, 2011)
  2. 2.
    Koszalka, L.: Static and Dynamic Allocation Algorithms in Mesh Structured Networks. In: Madria, S.K., Claypool, K.T., Kannan, R., Uppuluri, P., Gore, M.M. (eds.) ICDCIT 2006. LNCS, vol. 4317, pp. 89–101. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  3. 3.
    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
  4. 4.
    Sharma, D.D., Pradhan, K.: Submesh Allocation in Mesh Multicomputers Using Busy-List: A Best Fit Approach with Complete Recognition Capability. Journal of Parallel and Distributed Computing 36(2), 106–118 (1996)CrossRefGoogle Scholar
  5. 5.
    Bani-Mohammad, S., Ababneh, I., Hamdan, M.: Comparative Performance Evaluation of Non-Contiguous Allocation Algorithms in 2D Mesh-Connected Multicomputers. In: CIT, pp. 2933–2939 (2010)Google Scholar
  6. 6.
    Parallel Machines and Topologies, https://charm.cs.uiuc.edu/ (accessed June 29, 2011)
  7. 7.
    Gabrani, G., Mulkar, T.: A Quad-Tree Based Algorithm for Processor Allocation in 2D Mesh-Connected Multicomputers. Computer Standards & Interfaces 27(2), 133–147 (2005)CrossRefGoogle Scholar
  8. 8.
    Gupta, V., Jayendran, A.: A Flexible Processor Allocation Strategy for Mesh Connected Parallel Systems. In: Proceedings to Parallel Processing Conference, pp. 166–193 (1996)Google Scholar
  9. 9.
    Seo, K.-H.: Fragmentation-Efficient Node Allocation Algorithm in 2D Mesh-Connected Systems. In: Proceedings of the 8th International Symposium on Parallel Architecture, Algorithms and Networks, ISPAN 2005, pp. 318–323. IEEE Computer Society Press, Washington, DC (2005)Google Scholar
  10. 10.
    Li, K., Cheng, K.H.: A Two-Dimensional Buddy System for Dynamic Resource Allocation in a Partitionable Mesh Connected System. Journal of Parallel and Distributed Computing 12(1), 79–83 (1991)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Zhu, Y.: Efficient processor allocation strategies for mesh-connected parallel computers. Journal of Parallel and Distributed Computing 16(4), 328–337 (1992)zbMATHCrossRefGoogle Scholar
  12. 12.
    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., Kenneth Tan, C.J., Taniar, D., Laganá, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol. 3984, pp. 58–67. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  13. 13.
    Kmiecik, W., Wojcikowski, M., Koszalka, L., Kasprzak, A.: Task Allocation in Mesh Connected Processors with Local Search Meta-heuristic Algorithms. In: Nguyen, N.T., Le, M.T., Świątek, J. (eds.) ACIIDS 2010. LNCS (LNAI), vol. 5991, pp. 215–224. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  14. 14.
    Barnett, M., Littlefield, R.J., Payne, D.G., van de Geijn, R.A.: Global Combine Algorithms for 2-D Meshes with Wormhole Routing. J. Parallel Distributed Computing 24(2), 191–201 (1995)CrossRefGoogle Scholar
  15. 15.
    Seo, K.-H., Kim, S.-H.: Improving System Performance in Contiguous Processor Al-location for Mesh Connected Parallel Systems. Journal of Systems and Software 67(1), 45–54 (2003)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Zydek, D., Selvaraj, H., Koszalka, L., Pozniak-Koszalka, I.: Evaluation scheme for NoC-based CMP with integrated processor management system. International Journal of Electronics and Telecommunications 56(2), 157–167 (2010)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Bartosz Bodzon
    • 1
  • Leszek Koszalka
    • 1
  • Iwona Pozniak-Koszalka
    • 1
  • Andrzej Kasprzak
    • 1
  1. 1.Department of Systems and Computer NetworksWroclaw University of TechnologyWroclawPoland

Personalised recommendations