{"id":"https://openalex.org/W2053350909","doi":"https://doi.org/10.1142/s0129054114500245","title":"ON SCHEDULING SERIES-PARALLEL DAGs TO MAXIMIZE AREA","display_name":"ON SCHEDULING SERIES-PARALLEL DAGs TO MAXIMIZE AREA","publication_year":2014,"publication_date":"2014-08-01","ids":{"openalex":"https://openalex.org/W2053350909","doi":"https://doi.org/10.1142/s0129054114500245","mag":"2053350909"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054114500245","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054114500245","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/A5084267145","display_name":"Gennaro Cordasco","orcid":"https://orcid.org/0000-0001-9148-9769"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"GENNARO CORDASCO","raw_affiliation_strings":["Seconda Universit\u00e0 degli studi di Napoli, Via Vivaldi 43, 81100 Caserta, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Seconda Universit\u00e0 degli studi di Napoli, Via Vivaldi 43, 81100 Caserta, Italy","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032954059","display_name":"Arnold L. Rosenberg","orcid":"https://orcid.org/0000-0002-1171-9323"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"ARNOLD L. ROSENBERG","raw_affiliation_strings":["Northeastern University, Boston, MA 02115, USA","Northeastern University, Boston, MA 02115 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, MA 02115, USA","institution_ids":["https://openalex.org/I12912129"]},{"raw_affiliation_string":"Northeastern University, Boston, MA 02115 USA","institution_ids":["https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5084267145"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.5979,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.93464983,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"25","issue":"05","first_page":"597","last_page":"621"},"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.9995999932289124,"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.996399998664856,"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.8065280914306641},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.7892982959747314},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5744614601135254},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5605524182319641},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5474796891212463},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5292496085166931},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4520636796951294},{"id":"https://openalex.org/keywords/multithreading","display_name":"Multithreading","score":0.410103440284729},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3329065442085266},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.2755824327468872},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.26465263962745667},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1784639060497284},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11697661876678467},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11533796787261963}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8065280914306641},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.7892982959747314},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5744614601135254},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5605524182319641},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5474796891212463},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5292496085166931},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4520636796951294},{"id":"https://openalex.org/C201410400","wikidata":"https://www.wikidata.org/wiki/Q1064412","display_name":"Multithreading","level":3,"score":0.410103440284729},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3329065442085266},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.2755824327468872},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26465263962745667},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1784639060497284},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11697661876678467},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11533796787261963},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054114500245","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054114500245","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":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W73629738","https://openalex.org/W147548490","https://openalex.org/W1501341333","https://openalex.org/W1861377444","https://openalex.org/W1873800894","https://openalex.org/W1969603413","https://openalex.org/W1985495277","https://openalex.org/W2002290086","https://openalex.org/W2009122662","https://openalex.org/W2016559894","https://openalex.org/W2022678927","https://openalex.org/W2072687243","https://openalex.org/W2080162665","https://openalex.org/W2086650959","https://openalex.org/W2104861744","https://openalex.org/W2105057345","https://openalex.org/W2106807934","https://openalex.org/W2110240438","https://openalex.org/W2123147473","https://openalex.org/W2152488234","https://openalex.org/W2154886374"],"related_works":["https://openalex.org/W2355696437","https://openalex.org/W2020582711","https://openalex.org/W2160425906","https://openalex.org/W1882733036","https://openalex.org/W2546696010","https://openalex.org/W1992741870","https://openalex.org/W2055471337","https://openalex.org/W2117014006","https://openalex.org/W2110260278","https://openalex.org/W2997221951"],"abstract_inverted_index":{"The":[0,156,181],"AREA":[1,25],"of":[2,12,22,144,146,152,195],"a":[3,28,93,125,142,173,177],"schedule":[4,126],"for":[5,17,32,127,141,170,183,213],"executing":[6],"DAGs":[7,36,147],"is":[8,27,77,104,118],"the":[9,23,54,57,80,200],"average":[10],"number":[11,143],"DAG-chores":[13],"that":[14,34,49,56,71,88,175],"are":[15,50,72,150],"eligible":[16],"execution":[18],"at":[19,66],"each":[20],"step":[21],"computation.":[24],"maximization":[26],"new":[29],"optimization":[30],"goal":[31],"schedules":[33,139,169,186,205],"execute":[35,92],"within":[37,83],"computational":[38],"environments,":[39,86],"such":[40,124],"as":[41],"Internet-based":[42],"computing,":[43],"clouds,":[44],"and":[45,68],"volunteer":[46],"computing":[47,179],"projects,":[48],"dynamically":[51,84],"heterogeneous,":[52],"in":[53,69],"sense":[55],"environments'":[58],"constituent":[59],"computers":[60],"can":[61],"change":[62],"their":[63],"effective":[64],"powers":[65],"times":[67],"ways":[70],"not":[73],"predictable.":[74],"This":[75],"paper":[76,158],"motivated":[78],"by":[79,106,162],"thesis":[81,103],"that,":[82],"heterogeneous":[85],"DAG-schedules":[87],"have":[89],"larger":[90],"AREAs":[91],"computation-DAG":[94],"with":[95],"smaller":[96],"completion":[97],"time":[98],"under":[99],"many":[100,153],"circumstances;":[101],"this":[102,160],"supported":[105],"preliminary":[107],"simulation-based":[108],"experiments.":[109],"While":[110],"every":[111],"DAG":[112],"admits":[113],"an":[114,128,209],"AREA-maximizing":[115,138,168],"schedule,":[116],"it":[117],"likely":[119],"computationally":[120],"difficult":[121],"to":[122,136,165,188,191,202,208],"find":[123],"arbitrary":[129,215],"DAG.":[130],"Earlier":[131],"work":[132,161],"has":[133],"shown":[134],"how":[135,164],"craft":[137,167],"efficiently":[140,166,206],"families":[145,194],"whose":[148],"structures":[149],"reminiscent":[151],"scientific":[154],"computations.":[155],"current":[157],"extends":[159],"showing":[163],"series-parallel":[171],"DAGs,":[172],"family":[174],"models":[176],"multithreading":[178],"paradigm.":[180],"techniques":[182],"crafting":[184],"these":[185,204],"promise":[187],"apply":[189],"also":[190],"other":[192],"large":[193],"recursively":[196],"defined":[197],"DAGs.":[198,216],"Moreover,":[199],"ability":[201],"derive":[203],"leads":[207],"efficient":[210],"AREA-oriented":[211],"heuristic":[212],"scheduling":[214]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}