{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:07:53Z","timestamp":1759133273766},"reference-count":15,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2006,4]]},"abstract":"<jats:p> In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is called The Dynamic Critical Path Scheduling DCPS. The DCPS is superior to several other algorithms from the literature in terms of computational complexity, processors consumption and solution quality. DCPS has a time complexity of O(e + v log v), as opposed to DSC algorithm O((e+v) log v) which is the best known algorithm. Experimental results demonstrate the superiority of DCPS over the DSC algorithm. <\/jats:p>","DOI":"10.1142\/s0129054106003838","type":"journal-article","created":{"date-parts":[[2006,4,3]],"date-time":"2006-04-03T05:47:03Z","timestamp":1144043223000},"page":"287-301","source":"Crossref","is-referenced-by-count":8,"title":["CRITICAL PATH SCHEDULING PARALLEL PROGRAMS ON AN UNBOUNDED NUMBER OF PROCESSORS"],"prefix":"10.1142","volume":"17","author":[{"given":"MOURAD","family":"HAKEM","sequence":"first","affiliation":[{"name":"LIPN, CNRS-UMR-7030, Universit\u00e9 Paris-Nord, Avenue Jean-Baptiste Cl\u00e9ment, 93430 Villetaneuse, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"FRANCK","family":"BUTELLE","sequence":"additional","affiliation":[{"name":"LIPN, CNRS-UMR-7030, Universit\u00e9 Paris-Nord, Avenue Jean-Baptiste Cl\u00e9ment, 93430 Villetaneuse, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(90)90116-7"},{"key":"rf3","first-page":"50","volume":"6","author":"Efe K.","journal-title":"IEEE Computer"},{"key":"rf4","volume-title":"Computer and Intractability: A guide to the Theory of NP-Completness","author":"Garey M.","year":"1979"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(92)90012-C"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1109\/71.242154"},{"key":"rf7","first-page":"951","volume":"5","author":"Gerasoulis A.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1137\/0218016"},{"key":"rf9","first-page":"1","volume":"3","author":"Kim S. J.","journal-title":"International Conference on Parallel Processing"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1109\/71.503776"},{"key":"rf13","first-page":"322","volume":"19","author":"Kwok Y.-K.","journal-title":"SIAM Journal on Computing"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(90)90042-N"},{"key":"rf15","volume-title":"Partitionning and Scheduling Parallel Programs for Execution on Multiprocessors","author":"Sarkar V.","year":"1989"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(93)90079-Z"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1007\/BF00129784"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1109\/71.80160"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054106003838","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T11:28:32Z","timestamp":1565177312000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054106003838"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4]]},"references-count":15,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,4]]}},"alternative-id":["10.1142\/S0129054106003838"],"URL":"https:\/\/doi.org\/10.1142\/s0129054106003838","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,4]]}}}