{"id":"https://openalex.org/W2086947259","doi":"https://doi.org/10.1142/s0129054106003838","title":"CRITICAL PATH SCHEDULING PARALLEL PROGRAMS ON AN UNBOUNDED NUMBER OF PROCESSORS","display_name":"CRITICAL PATH SCHEDULING PARALLEL PROGRAMS ON AN UNBOUNDED NUMBER OF PROCESSORS","publication_year":2006,"publication_date":"2006-04-01","ids":{"openalex":"https://openalex.org/W2086947259","doi":"https://doi.org/10.1142/s0129054106003838","mag":"2086947259"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054106003838","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054106003838","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043732741","display_name":"Mourad Hakem","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210156583","display_name":"Laboratoire d'Informatique de Paris-Nord","ror":"https://ror.org/05g1zjw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"MOURAD HAKEM","raw_affiliation_strings":["LIPN, CNRS-UMR-7030, Universit\u00e9 Paris-Nord, Avenue Jean-Baptiste Cl\u00e9ment, 93430 Villetaneuse, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIPN, CNRS-UMR-7030, Universit\u00e9 Paris-Nord, Avenue Jean-Baptiste Cl\u00e9ment, 93430 Villetaneuse, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210156583"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001539341","display_name":"Franck Butelle","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210156583","display_name":"Laboratoire d'Informatique de Paris-Nord","ror":"https://ror.org/05g1zjw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"FRANCK BUTELLE","raw_affiliation_strings":["LIPN, CNRS-UMR-7030, Universit\u00e9 Paris-Nord, Avenue Jean-Baptiste Cl\u00e9ment, 93430 Villetaneuse, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIPN, CNRS-UMR-7030, Universit\u00e9 Paris-Nord, Avenue Jean-Baptiste Cl\u00e9ment, 93430 Villetaneuse, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210156583"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9346,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.78357528,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"17","issue":"02","first_page":"287","last_page":"301"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8226785659790039},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.738741397857666},{"id":"https://openalex.org/keywords/critical-path-method","display_name":"Critical path method","score":0.7205086946487427},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5476226210594177},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.44071513414382935},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.42597341537475586},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.41173025965690613},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.36424869298934937},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3392820358276367},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12903842329978943},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.12803298234939575},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.10475331544876099},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07537832856178284}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8226785659790039},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.738741397857666},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.7205086946487427},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5476226210594177},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.44071513414382935},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.42597341537475586},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.41173025965690613},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36424869298934937},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3392820358276367},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12903842329978943},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.12803298234939575},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.10475331544876099},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07537832856178284},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054106003838","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054106003838","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.4399999976158142,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1549134103","https://openalex.org/W1569267503","https://openalex.org/W1967949408","https://openalex.org/W1989582918","https://openalex.org/W2019356799","https://openalex.org/W2023753260","https://openalex.org/W2037987555","https://openalex.org/W2043331236","https://openalex.org/W2051249422","https://openalex.org/W2065689629","https://openalex.org/W2089265778","https://openalex.org/W2100124280","https://openalex.org/W2110417760","https://openalex.org/W2118396891","https://openalex.org/W2151038512","https://openalex.org/W2187152421","https://openalex.org/W4210896998","https://openalex.org/W4232665025","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3096456556","https://openalex.org/W4240253816","https://openalex.org/W3011443213","https://openalex.org/W2169584677","https://openalex.org/W2979513934","https://openalex.org/W4232954277","https://openalex.org/W2020341030","https://openalex.org/W2749133591","https://openalex.org/W2367473450","https://openalex.org/W23346600"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"present":[4],"an":[5],"efficient":[6],"algorithm":[7,68],"for":[8],"compile-time":[9],"scheduling":[10],"and":[11,50],"clustering":[12],"of":[13,45,58,83],"parallel":[14,17],"programs":[15],"onto":[16],"processing":[18],"systems":[19],"with":[20],"distributed":[21],"memory,":[22],"which":[23,72],"is":[24,34,73],"called":[25],"The":[26,32],"Dynamic":[27],"Critical":[28],"Path":[29],"Scheduling":[30],"DCPS.":[31],"DCPS":[33,53,84],"superior":[35],"to":[36,66],"several":[37],"other":[38],"algorithms":[39],"from":[40],"the":[41,74,81,86],"literature":[42],"in":[43],"terms":[44],"computational":[46],"complexity,":[47],"processors":[48],"consumption":[49],"solution":[51],"quality.":[52],"has":[54],"a":[55],"time":[56],"complexity":[57],"O(e":[59],"+":[60],"v":[61],"log":[62,70],"v),":[63],"as":[64],"opposed":[65],"DSC":[67,87],"O((e+v)":[69],"v)":[71],"best":[75],"known":[76],"algorithm.":[77,88],"Experimental":[78],"results":[79],"demonstrate":[80],"superiority":[82],"over":[85]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}