CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Performance Improvement in Multiprocessors using Two Row Boundary Allocation Method and Online Dynamic Compaction Algorithm

by Akram Reza, Mahnaz Rafie
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 123 - Number 1
Year of Publication: 2015
Authors: Akram Reza, Mahnaz Rafie
10.5120/ijca2015904575

Akram Reza, Mahnaz Rafie . Performance Improvement in Multiprocessors using Two Row Boundary Allocation Method and Online Dynamic Compaction Algorithm. International Journal of Computer Applications. 123, 1 ( August 2015), 14-20. DOI=10.5120/ijca2015904575

@article{ 10.5120/ijca2015904575,
author = { Akram Reza, Mahnaz Rafie },
title = { Performance Improvement in Multiprocessors using Two Row Boundary Allocation Method and Online Dynamic Compaction Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { August 2015 },
volume = { 123 },
number = { 1 },
month = { August },
year = { 2015 },
issn = { 0975-8887 },
pages = { 14-20 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume123/number1/21922-2015904575/ },
doi = { 10.5120/ijca2015904575 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:11:30.839087+05:30
%A Akram Reza
%A Mahnaz Rafie
%T Performance Improvement in Multiprocessors using Two Row Boundary Allocation Method and Online Dynamic Compaction Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 123
%N 1
%P 14-20
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper, two row boundary (TRB) allocation algorithm and limited top-down compaction (LT-DC) migration method are proposed. The first scheme, attempts to allocate the free nodes in the center of the mesh and decrease the problem of external fragmentation. The next mechanism use task migration to improve the performance of existing sub-mesh allocation strategies. It should be noted that in this process three key metrics are considered. They are average execution time, average response time, and average wait time. In fact, we perform rigorous simulation experiments based on practical workloads as reported in the literature to quantify all our proposed schemes and compare them against standard schemes existing in the literature. Based on the results, we make clear recommendations on the choice of the strategies.

References
  1. C. Celik, and C. F. Bazlamacci, “Effect of application mapping on network on chip performance”, in Proceedings of the 20th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP), pp. 465-472, 2012.
  2. P. K. Sahu, and S. Chattopadhyay, “A survey on application mapping strategies for Network-on-Chip design”, in Proceedings of the Journal of Systems Architecture, Vol. 59, No. 1, pp. 60-76, 2013.
  3. Y. Zhu, “Efficient processor allocation strategies for mesh-connected parallel computers”, in Proceedings of the Journal of Parallel and Distributed Computing, pp. 328-337, 1992.
  4. S. Bani-Mohammad, M. Ould-Khaoua, and I. Ababneh, “A new processor allocation strategy with a high degree of contiguity in mesh-connected multicomputers”, Simulation Modelling Practice and Theory, pp. 465-480, 2007.
  5. V. Lo, K. Windisch, W. Liu, and B. Nitzberg, “Non-contiguous processor allocation algorithms for mesh-connected multicomputers”, in Proceedings of the IEEE Transactions on Parallel and Distributed Systems, pp. 712-726, 1997.
  6. C. Peterson, J. Sutton, and P. Wiley, “iWARP: a 100-POS, LIW microprocessor for multicomputers”, in Proceedings of the IEEE Micro, pp. 26-29, 1991.
  7. M. Levine, CRAY XT3 at the Pittsburgh Supercomputing Centre, DEISA Symposium, Bologna, 4-5 May 2006.
  8. W. Mao, J. Chen, and W. Watson, Efficient Subtorus Processor Allocation in a Multi-Dimensional Torus, Proceedings of the 8th International Conference on High-Performance Computing in Asia-Pacific Region (HPCASIA’05), IEEE Computer society Press, pp. 53-60, 30 November - 3 December, 2005
  9. J. Ding, and L.N. Bhuyan, “An adaptive submesh allocation strategy for two dimensional mesh connected systems”, in Proceedings of the International Conference on Parallel Processing (ICPP), Vol. 2, pp. 193–200, 1993.
  10. K. Li, and K. Cheng, “A two-dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system”, in Proceedings of the Journal of Parallel and Distributed Computing, Vol. 12, No. 1, pp. 79–83, May 1991.
  11. P. Chuang, and N. Tzeng, “An efficient submesh allocation strategy for mesh computer systems”, in Proceedings of the 11th International Conference on Distributed Computing Systems, pp. 256–263, 1991.
  12. J. Ding, and L.N. Bhuyan, “An adaptive submesh allocation strategy for two dimensional mesh connected systems”, in Proceedings of the International Conference on Parallel Processing (ICPP), Vol. 2, pp. 193–200, 1993.
  13. Y. Zhu, “Efficient processor allocation strategies for mesh-connected parallel computers”, in Proceedings of the Journal of Parallel and Distributed Computing, Vol. 16, No. 4, pp. 328–337, December 1992.
  14. B. S. Yoo, and C. R. Das, “a fast and efficient processor allocation scheme for mesh-connected multicomputers”, in Proceedings of the IEEE transactions on computers, Vol. 51, No. 1, pp. 46-60, January, 2002.
  15. D.D. Sharma, and D.K. Pradhan, “A fast and efficient strategy for submesh allocation in mesh-connected parallel computers”, in Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, pp. 682–689, December 1993.
  16. Z.M. Al-Lami, “Communication Impact on Non-Contiguous Allocation Strategies for 2-D Mesh Multicomputer Systems”, Master Thesis, Middle East University, Amman-Jordan, May 2011.
  17. G. Chmaj, D. Zydek, and L. Koszalka, Allocation Algorithms Problems in Mesh-Connected Systems, 2004.
  18. A. Kelly, and J. D. William, “Migration in single chip multiprocessors”, in Proceedings of the IEEE Computer Architecture Letters, 1, 2002.
  19. M. Kandemir, and G. Chen, “Locality-aware process scheduling for embedded MPSoCs”, in Proceedings of the Design, Automation and Test in Europe Conference (DATE), pp. 870–875, 2005.
  20. S. Bertozzi, A. Acquaviva, D. Bertozzi, and A. Poggiali, “Supporting task migration in multi-processor systems-on-chip: a feasibility study”, in Proceedings of the Design, Automation and Test in Europe (DATE), pp. 15–20, Vol. 1, March 2006.
  21. B. Goudarzi, and H. Sarbazi-Azad, “Task migration in mesh NoCs over virtual point to point connections”, in Proceedings of the 19th Euromicro International Conference on Parallel, Distributed and Network-Based Processing ( PDP), pp. 463–469, 2011.
  22. N.C. Wang, and T.S. Chen, “Task migration in all-port wormhole-routed 2D mesh multicomputers”, in Proceedings of the Seventh International Symposium on Parallel Architectures, Algorithms, and Networks, pp. 123–128, 2004.
  23. T. S. Chen, “Task migration in 2D wormhole-routed mesh multicomputers”, in Proceedings of the Journal of Information Processing Letters, pp. 103–110, Vol. 73, No. 3-4, 2000.
  24. L. K. Goh, and B. Veeravalli, “Design and performance evaluation of combined first-fit task allocation and migration strategies in mesh multicomputer systems”, in Proceedings of the Journal of Parallel Computing, pp. 508–520, Vol. 34, No. 9, September 2008.
  25. S. Bani-Ahmad, “On Improved Processor Allocation in 2D Mesh-based Multicomputers: Controlled Splitting of Parallel Requests”, in Proceedings of the 2011 International Conference on Communication, Computing and Security (ICCCS'11), pp. 204-209, 2011.
  26. Z.M. Al-Lami, “Communication Impact on Non-Contiguous Allocation Strategies for 2-D Mesh Multicomputer Systems”, Master Thesis, Middle East University, Amman-Jordan, May 2011.
  27. G. L. Kee, “Design and performance evaluation of migration-based submesh allocation strategies in mesh multicomputers”, Master Thesis, National University of Singapore, 2005.
Index Terms

Computer Science
Information Sciences

Keywords

Allocation Fragmentation Migration Two row boundary

Powered by PhDFocusTM