CFP last date
16 December 2024
Call for Paper
January Edition
IJAIS solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 16 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Ordered Frequent Itemsets Matrix Based On Fp-Tree Structure And Apriori Algorithm

Abdulkader M. Al-Badani Abdualmajed A. Al-Khulaidi
Random Articles
Reseach Article

Task Allocation on Linearly Extensible Multiprocessor System

by Abdus Samad, Jamshed Siddiqui, Zaki Ahmad Khan
journal cover thumbnail

International Journal of Applied Information Systems
Foundation of Computer Science (FCS), NY, USA
Volume 10 - Number 5
Year of Publication: 2016
Authors: Abdus Samad, Jamshed Siddiqui, Zaki Ahmad Khan
10.5120/ijais2016451480

Abdus Samad, Jamshed Siddiqui, Zaki Ahmad Khan . Task Allocation on Linearly Extensible Multiprocessor System. International Journal of Applied Information Systems. 10, 5 ( February 2016), 1-5. DOI=10.5120/ijais2016451480

@article{ 10.5120/ijais2016451480,
author = { Abdus Samad, Jamshed Siddiqui, Zaki Ahmad Khan },
title = { Task Allocation on Linearly Extensible Multiprocessor System },
journal = { International Journal of Applied Information Systems },
issue_date = { February 2016 },
volume = { 10 },
number = { 5 },
month = { February },
year = { 2016 },
issn = { 2249-0868 },
pages = { 1-5 },
numpages = {9},
url = { https://www.ijais.org/archives/volume10/number5/859-2016451480/ },
doi = { 10.5120/ijais2016451480 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2023-07-05T19:02:31.395826+05:30
%A Abdus Samad
%A Jamshed Siddiqui
%A Zaki Ahmad Khan
%T Task Allocation on Linearly Extensible Multiprocessor System
%J International Journal of Applied Information Systems
%@ 2249-0868
%V 10
%N 5
%P 1-5
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A novel dynamic scheduling scheme that supports task unbiased structure approach is proposed for multiprocessor networks. The significance of proposed scheduling scheme is remedying the communication overhead, delay in task execution and in efficient processor utilization and hence improves the total execution time. The proposed algorithm is implemented on a set of processors known as nodes which are linked through certain interconnection network. In particular, the recital is appraised for a linear kind of multiprocessor interconnection network known as Linear Crossed Cube (LCQ) multiprocessor system. In addition, a comparison is also made by implementing the same algorithm on other similar standard multiprocessor systems. The performance is examined with regards to the performance indexed known as Load Imbalance Factor (LIF), which corresponds to the variant of load among processors. The comparative simulation research reveals that the proposed scheme provides more advantageous performance in terms of task scheduling on numerous linear along with on cube-based multiprocessor networks.

References
  1. J. Jia, B. Veeravalli and J. Weissman, “Scheduling Multiprocessor Divisible Loads on Arbitrary Networks”, IEEE Transactions on Parallel and Distributed Systems, vol. 21, No. 4, pp. 520-531, 2010.
  2. F. Martelli and A. M. Bonuccelli, “Minimum Message Waiting Time Scheduling in Distributed Systems”, IEEE Transactions On Parallel And Distributed Systems, vol. 24, no. 9 pp. 1797–1806, 2013.
  3. A. F. Omara and M. M. Arafa, “Genetic Algorithms for Task Scheduling Problem”, Journal Parallel Distributed Computing, vol. 70, pp. 13–22, 2010.
  4. E. Dodonov and D. F. R. Mello, “A Novel Approach for Distributed Application Scheduling Based On Prediction of communication events”, Future Generation Computer Systems, vol. 26, pp. 740–752, 2010.
  5. Z. Lan, E. V. Taylor and G. Bryan,“A Novel Dynamic Load Balancing Scheme for Parallel systems”, Journal of Parallel and Distributed Computing, vol. 62, pp. 1763–1781, 2002.
  6. R. Hwang, M. Gen and H. Katayama,“A Comparision of Multiprocessor Task Scheduling Algorithms with Communication Costs”, Computers and Operations Resaerch, vol. 35, pp. 976-993, 2008.
  7. H. W. M. LeMair and A. P. Reeves, “Strategies for dynamic load balancing on highly parallel computers”, IEEE Transaction on Parallel and Distributed Systems, vol. 4, no. 9, pp. 979-992, 1993.
  8. A. Samad, M. Q. Rafiq and O. Farooq, “Two Round Scheduling (TRS) Scheme for Linearly Extensible Multiprocessor Systems”, International Journal of Computer Applications, vol. 38 no. 10, pp. 34-40, 2012.
  9. M. Bertogna, M. Cirinei, and G. Lipari, “Schedulability analysis of Global scheduling algorithm on multiprocessor platforms”, IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 4, pp. 553-566, 2009.
  10. M. Dobber, R. V. D. Mei, and G. Koole, “Dynamic Load Balancing and Job Replication in a Global-Scale Grid Environment”, A Comparison. IEEE Transaction on Parallel and Distributed Systems, vol. 20, no. 2, pp. 207-218, 2009.
  11. Q. Kang, H. He, and H. Song, “Task Assignment in Heterogeneous Computing Systems Using an Effective Iterated Greedy Algorithm”, The Journal of Systems and Software, vol. 84, pp. 985–992, 2011.
  12. K. Efe, “The crossed cube architecture for parallel computation”, IEEE Transactions on Parallel and Distributed Systems, vol. 3, no. 5, pp. 513–524, 1992.
  13. C. R. Tripathy, “Star-cube: A New Fault Tolerant Interconnection Topology For Massively Parallel Systems”, IE (I) Journal, ETE Div, vol. 84, no. 2, pp. 83- 92, 2004.
  14. A. Samad, M. Q. Rafiq, and O. Farooq, “LEC: An Efficient Scalable Parallel Interconnection Network”, In proceeding International Conference on Emerging Trends in Computer Science, Communication and Information Technology, pp 453-458, 2010.
  15. N. Adhekari and C. R. Tripathy, “Star Crossed Cube: An Alternative to Star Graph”, Turkish Journal of Electrical Engineering and Computer Science, vol. 2, no. 3, pp. 719- 734, 2014.
  16. Z. A. Khan, J. Siddiqui and A. Samad, “Linear Crossed Cube (LCQ): A New Interconnection Network Topology for Massively Parallel System”, International Journal of Computer Network and Information Security, vol. 7, no. 3, pp 18-25, 2015.
  17. R. F. DeMello, L. J. Senger and L. T. Yang, “Performance Evaluation of Route”, A Load Balancing Algorithm for Grid Computing. RITA, vol. 13, no. 1, pp 87-108, 2006.
  18. A. J. Andrade, R. F. De Mello, E. Dodonov, L. J. Senger, L. T. Yang and K. C. Li, “Toward an Efficient Middleware for Multithreaded Applications in Computational Grid”, In proceeding of 11th IEEE International Conference on Computational Science and Engineering, CSE-08, Sao Paulo, Brazil, 2008.
  19. R. P. Ishii, R. F. De Mello and L. T. Yang, “A Complex Network Based Approach for Job Scheduling in Grid Environments”, HPC, in: Lecture Notes in Computer Science, Vol. 4782, Springer, pp. 204-2015, 2007.
  20. H. Jin, D. Jespersen, P. Mehrotra, R. Biswas, L.Huang and B. Chapman, “High Performance Computing Using MPI and Open MP on Multicore Parallel System”, Parallel Computing, Vol. 37, pp. 562-575, 2011.
Index Terms

Computer Science
Information Sciences

Keywords

Distributed Control dynamic load balancing scheduling scheme Parallel Systems Task Scheduling.

Powered by PhDFocusTM