{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:18:52Z","timestamp":1781104732729,"version":"3.54.1"},"reference-count":17,"publisher":"IGI Global Scientific Publishing","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,1,1]]},"abstract":"<p>Task scheduling in heterogeneous parallel and distributed computing environment is a challenging problem. Applications identified by parallel tasks can be represented by directed-acyclic graphs (DAGs). Scheduling refers to the assignment of these parallel tasks on a set of bounded heterogeneous processors connected by high speed networks. Since task assignment is an NP-complete problem, instead of finding an exact solution, scheduling algorithms are developed based on heuristics, with the primary goal of minimizing the overall execution time of the application or schedule length. In this paper, the overall execution time (schedule length) of the tasks is reduced using task duplication on top of the Critical-Path-On-a-Processor (CPOP) algorithm.<\/p>","DOI":"10.4018\/jghpc.2011010105","type":"journal-article","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T12:23:58Z","timestamp":1319027038000},"page":"89-97","source":"Crossref","is-referenced-by-count":2,"title":["An Algorithm for Task Scheduling in Heterogeneous Distributed Systems Using Task Duplication"],"prefix":"10.4018","volume":"3","author":[{"given":"Amrit","family":"Agrawal","sequence":"first","affiliation":[{"name":"Jaypee University of Information Technology, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pranay","family":"Chaudhuri","sequence":"additional","affiliation":[{"name":"Heritage Institute of Technology, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jghpc.2011010105-0","first-page":"47","article-title":"A New Approach to Scheduling parallel Programs Using Task Duplication. In","volume":"2","author":"I.Ahmad","year":"1994","journal-title":"Proceedings of the International Conference on Parallel Processing"},{"key":"jghpc.2011010105-1","doi-asserted-by":"publisher","DOI":"10.1109\/71.722221"},{"key":"jghpc.2011010105-2","doi-asserted-by":"crossref","unstructured":"Braun, T. D., & Siegel, H. J. (1998). A taxonomy for describing matching and scheduling heuristics for mixed-machine heterogeneous computing systems. In Proceedings of the Seventeenth IEEE Symposium on Reliable Distributed Systems, West Lafayette, IN (pp. 330-335).","DOI":"10.1109\/RELDIS.1998.740518"},{"key":"jghpc.2011010105-3","unstructured":"Chung, Y., & Ranka, S. (1992). Applications and Performance Analysis of a Compile-time Optimization Approach for List Scheduling Algorithms on Distributed Memory Multiprocessors. Proceedings of the Conference on Supercomputing (pp. 512-521)."},{"key":"jghpc.2011010105-4","author":"L.Davis","year":"1991","journal-title":"Handbook of Genetic Algorithms"},{"key":"jghpc.2011010105-5","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(92)90012-C"},{"key":"jghpc.2011010105-6","doi-asserted-by":"publisher","DOI":"10.1137\/0218016"},{"key":"jghpc.2011010105-7","doi-asserted-by":"publisher","DOI":"10.3844\/jcssp.2007.94.103"},{"key":"jghpc.2011010105-8","first-page":"1","article-title":"A general approach to mapping of parallel computation upon multiprocessor architectures. In","volume":"2","author":"S. J.Kim","year":"1998","journal-title":"Proceedings of the International Conference on Parallel Processing"},{"key":"jghpc.2011010105-9","doi-asserted-by":"publisher","DOI":"10.1109\/52.1991"},{"key":"jghpc.2011010105-10","doi-asserted-by":"publisher","DOI":"10.1109\/71.503776"},{"key":"jghpc.2011010105-11","unstructured":"Park, G., Shirazi, B., & Marquis, J. (1997). DFRN: A New Approach for Duplication Based Scheduling for Distributed Memory Mulitiprocessor Systems. In Proceedings of the International Conference on Parallel Processing (pp. 157-166)."},{"key":"jghpc.2011010105-12","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(90)90042-N"},{"key":"jghpc.2011010105-13","doi-asserted-by":"publisher","DOI":"10.1109\/71.207593"},{"key":"jghpc.2011010105-14","doi-asserted-by":"publisher","DOI":"10.1109\/71.993206"},{"key":"jghpc.2011010105-15","doi-asserted-by":"publisher","DOI":"10.1109\/71.80160"},{"key":"jghpc.2011010105-16","doi-asserted-by":"publisher","DOI":"10.1109\/71.308533"}],"container-title":["International Journal of Grid and High Performance Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=52588","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T19:43:12Z","timestamp":1654112592000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jghpc.2011010105"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2011,1,1]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"URL":"https:\/\/doi.org\/10.4018\/jghpc.2011010105","relation":{},"ISSN":["1938-0259","1938-0267"],"issn-type":[{"value":"1938-0259","type":"print"},{"value":"1938-0267","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,1]]}}}