{"id":"https://openalex.org/W2128387859","doi":"https://doi.org/10.3217/jucs-010-02-0106","title":"A Message-Optimal Distributed Graph Algorithm: Partial Precedence Constrained Scheduling.","display_name":"A Message-Optimal Distributed Graph Algorithm: Partial Precedence Constrained Scheduling.","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2128387859","doi":"https://doi.org/10.3217/jucs-010-02-0106","mag":"2128387859"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.99.1933","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.99.1933","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.jucs.org/jucs_10_2/a_message_optimal_distributed/Chaudhuri_P.pdf","raw_type":"text"},"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.3217/jucs-010-02-0106","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108198812","display_name":"Pranay Chaudhuri","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pranay Chaudhuri","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5061324030","display_name":"Hussein Thompson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hussein Thompson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19643282,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":null,"first_page":"96","last_page":"109"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"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/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9957000017166138,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.8371028304100037},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5479856729507446},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.44916751980781555},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.43702393770217896},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.42946022748947144},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.416534960269928},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4137350618839264},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4134840965270996},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.38340163230895996},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3697874844074249},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.28390565514564514},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14186310768127441},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.06372162699699402}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8371028304100037},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5479856729507446},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.44916751980781555},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.43702393770217896},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.42946022748947144},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.416534960269928},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4137350618839264},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4134840965270996},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.38340163230895996},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3697874844074249},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28390565514564514},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14186310768127441},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.06372162699699402},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.99.1933","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.99.1933","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.jucs.org/jucs_10_2/a_message_optimal_distributed/Chaudhuri_P.pdf","raw_type":"text"},{"id":"pmh:oai:zenodo.org:6996488","is_oa":true,"landing_page_url":"https://doi.org/10.3217/jucs-010-02-0106","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"JUCS - Journal of Universal Computer Science, 10((2)), 106-119, (2004-02-28)","raw_type":"info:eu-repo/semantics/article"},{"id":"mag:2128387859","is_oa":false,"landing_page_url":"https://www.jucs.org/jucs_10_2/a_message_optimal_distributed/Chaudhuri_P.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S58563349","display_name":"JUCS - Journal of Universal Computer Science","issn_l":"0948-695X","issn":["0948-695X","0948-6968"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317875","host_organization_name":"Verlag der Technischen Universit\u00e4t Graz","host_organization_lineage":["https://openalex.org/P4310317875"],"host_organization_lineage_names":["Verlag der Technischen Universit\u00e4t Graz"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"JUCS - Journal of Universal Computer Science","raw_type":null}],"best_oa_location":{"id":"pmh:oai:zenodo.org:6996488","is_oa":true,"landing_page_url":"https://doi.org/10.3217/jucs-010-02-0106","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"JUCS - Journal of Universal Computer Science, 10((2)), 106-119, (2004-02-28)","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W634463279","https://openalex.org/W1543077467","https://openalex.org/W1974518651","https://openalex.org/W1990389251","https://openalex.org/W2013173096","https://openalex.org/W2029934607","https://openalex.org/W2052385702","https://openalex.org/W2058866309","https://openalex.org/W2073273423","https://openalex.org/W2085540843","https://openalex.org/W2136604606","https://openalex.org/W2142302732"],"related_works":["https://openalex.org/W2058866309","https://openalex.org/W2939986409","https://openalex.org/W1985321454","https://openalex.org/W2050090155","https://openalex.org/W1883192328","https://openalex.org/W2353162411","https://openalex.org/W1975231449","https://openalex.org/W1993030812","https://openalex.org/W1526035966","https://openalex.org/W2095315599","https://openalex.org/W1992739773","https://openalex.org/W2073084198","https://openalex.org/W1967030015","https://openalex.org/W2083199589","https://openalex.org/W1989447432","https://openalex.org/W2089181700","https://openalex.org/W2725890996","https://openalex.org/W3153995913","https://openalex.org/W1510986617","https://openalex.org/W88927000"],"abstract_inverted_index":{"Abstract:":[0],"This":[1],"paper":[2],"presents":[3],"a":[4,42,72,75,123],"distributed":[5,105],"algorithm":[6,106],"for":[7],"the":[8,15,22,29,46,52,55,64,80,91,97,104],"partial":[9,36,81],"precedence":[10,17,37,48,82,98],"constrained":[11,18,38,49,83],"scheduling":[12,19,39,84],"problem.":[13],"In":[14],"classical":[16],"problem":[20,40,50,85],"all":[21],"dependent":[23,58],"tasks":[24,59,92],"must":[25],"be":[26,33,61,68],"scheduled":[27,62,69],"before":[28,63],"task":[30,65],"itself":[31,66],"can":[32,67],"scheduled.":[34],"The":[35],"is":[41,70,101,116],"generalized":[43],"version":[44],"of":[45,57,113],"original":[47],"in":[51,86,118],"sense":[53],"that":[54,103],"number":[56],"to":[60,78,121],"considered":[71],"variable.":[73],"Using":[74],"directed":[76],"graph":[77],"model":[79],"which":[87],"n":[88],"nodes":[89],"represent":[90,96],"and":[93,110,115],"e":[94],"edges":[95],"constraints,":[99],"it":[100],"shown":[102],"requires":[107],"O(e)":[108],"messages":[109],"O(n)":[111],"units":[112],"time":[114],"optimal":[117],"communication":[119],"complexity":[120],"within":[122],"constant":[124],"factor.":[125]},"counts_by_year":[],"updated_date":"2025-10-10T17:16:08.811792","created_date":"2025-10-10T00:00:00"}