{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:03:03Z","timestamp":1781107383443,"version":"3.54.1"},"reference-count":14,"publisher":"IGI Global Scientific Publishing","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,1,1]]},"abstract":"<p>Scheduling tasks in heterogeneous parallel and distributed computing environments continues to be a challenging problem. In this paper, the authors investigate the Heterogeneous Earliest Finish Time (HEFT) algorithm, along with alternative scheduling policies for task prioritising phases and the Critical Path on a Processor (CPOP) for scheduling tasks on a heterogeneous multiprocessor system. The authors show that by combining the HEFT algorithm selection policy with the task duplication strategy, it is possible to further reduce the schedule length produced by both HEFT and CPOP. The process scheduling algorithm presented in this paper compares favourably with other algorithms that use a similar strategy. The proposed algorithm has a time complexity of ?(\u00a6V\u00a62(p + d)), whererepresents the number of tasks, p represents the number of processors and d the maximum in-degree of tasks.<\/p>","DOI":"10.4018\/jbdcn.2010010104","type":"journal-article","created":{"date-parts":[[2010,4,16]],"date-time":"2010-04-16T17:08:01Z","timestamp":1271437681000},"page":"58-69","source":"Crossref","is-referenced-by-count":5,"title":["Process Scheduling in Heterogeneous Multiprocessor Systems Using Task Duplication"],"prefix":"10.4018","volume":"6","author":[{"given":"Pranay","family":"Chaudhuri","sequence":"first","affiliation":[{"name":"Heritage Institute of Technology, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeffrey","family":"Elcock","sequence":"additional","affiliation":[{"name":"University of the West Indies, Barbados"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"issue":"5","key":"jbdcn.2010010104-0","first-page":"560","article-title":"Dynamic critical-path scheduling: An effective technique for allocating tasks graphs to multiprocessors.","volume":"7","author":"I.Ahmad","year":"1996","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"jbdcn.2010010104-1","doi-asserted-by":"publisher","DOI":"10.1109\/71.722221"},{"issue":"2","key":"jbdcn.2010010104-2","first-page":"107","article-title":"Improving scheduling of tasks in a heterogeneous environment.","volume":"15","author":"R.Bajaj","year":"2004","journal-title":"IEEE Transactions on Computers"},{"key":"jbdcn.2010010104-3","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2003.1206502"},{"key":"jbdcn.2010010104-4","unstructured":"Chaudhuri, P., & Elcock, J. (2005). Scheduling on multiprocessors using task duplication. In D. Tutsch (Ed.), Proceedings of the 2005 Design, Analysis and Simulation of Distributed Systems (DASD 2005) (pp. 28-35). San Diego, CA: SCS."},{"key":"jbdcn.2010010104-5","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-Completeness. New York: W.H. Freeman."},{"key":"jbdcn.2010010104-6","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"jbdcn.2010010104-7","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2005.04.002"},{"key":"jbdcn.2010010104-8","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676376"},{"key":"jbdcn.2010010104-9","unstructured":"Liu, C.-H., Li, C.-F., Lai, K.-C., & Wu, C.-C. (2006). Dynamic critical path duplication task scheduling algorithm for distributed heterogeneous computing systems. In Proceedings of the 12th International Conference on Parallel and Distributed Systems (ICPADS\u201906) (Vol. 1, pp. 365-374). Washington, DC: IEEE Computer Society."},{"key":"jbdcn.2010010104-10","doi-asserted-by":"publisher","DOI":"10.1109\/12.995454"},{"key":"jbdcn.2010010104-11","doi-asserted-by":"publisher","DOI":"10.1109\/71.993206"},{"issue":"3","key":"jbdcn.2010010104-12","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","article-title":"NP-Complete scheduling problems.","volume":"10","author":"J. D.Ullman","year":"1975","journal-title":"Journal of Computer and System Sciences"},{"key":"jbdcn.2010010104-13","doi-asserted-by":"publisher","DOI":"10.1109\/71.80160"}],"container-title":["International Journal of Business Data Communications and Networking"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=40914","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T23:06:17Z","timestamp":1654124777000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jbdcn.2010010104"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2010,1,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"URL":"https:\/\/doi.org\/10.4018\/jbdcn.2010010104","relation":{},"ISSN":["1548-0631","1548-064X"],"issn-type":[{"value":"1548-0631","type":"print"},{"value":"1548-064X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,1]]}}}