{"id":"https://openalex.org/W2799001871","doi":"https://doi.org/10.1145/3192366.3192391","title":"Heartbeat scheduling: provable efficiency for nested parallelism","display_name":"Heartbeat scheduling: provable efficiency for nested parallelism","publication_year":2018,"publication_date":"2018-06-11","ids":{"openalex":"https://openalex.org/W2799001871","doi":"https://doi.org/10.1145/3192366.3192391","mag":"2799001871"},"language":"en","primary_location":{"id":"doi:10.1145/3192366.3192391","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3192366.3192391","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-01937946/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015051107","display_name":"Umut A. Acar","orcid":"https://orcid.org/0000-0002-2623-4986"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Umut A. Acar","raw_affiliation_strings":["Carnegie Mellon University, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025324126","display_name":"Arthur Chargu\u00e9raud","orcid":"https://orcid.org/0000-0001-7764-4507"},"institutions":[{"id":"https://openalex.org/I68947357","display_name":"Universit\u00e9 de Strasbourg","ror":"https://ror.org/00pg6eq24","country_code":"FR","type":"education","lineage":["https://openalex.org/I68947357"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Arthur Chargu\u00e9raud","raw_affiliation_strings":["University of Strasbourg, France / Inria, France"],"affiliations":[{"raw_affiliation_string":"University of Strasbourg, France / Inria, France","institution_ids":["https://openalex.org/I68947357"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090595902","display_name":"Adrien Guatto","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Adrien Guatto","raw_affiliation_strings":["Inria, France"],"affiliations":[{"raw_affiliation_string":"Inria, France","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009476343","display_name":"Mike Rainey","orcid":null},"institutions":[{"id":"https://openalex.org/I4210137396","display_name":"Centre de Recherche en \u00c9conomie et Statistique","ror":"https://ror.org/0449khs19","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I142476485","https://openalex.org/I4210108488","https://openalex.org/I4210108488","https://openalex.org/I4210137396","https://openalex.org/I4210145102","https://openalex.org/I4210145102","https://openalex.org/I4210150854","https://openalex.org/I84009706"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mike Rainey","raw_affiliation_strings":["Inria, France / CREST, USA"],"affiliations":[{"raw_affiliation_string":"Inria, France / CREST, USA","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210137396"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047754900","display_name":"Filip Sieczkowski","orcid":"https://orcid.org/0000-0001-5011-3458"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Filip Sieczkowski","raw_affiliation_strings":["Inria, France"],"affiliations":[{"raw_affiliation_string":"Inria, France","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5015051107"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":3.1565,"has_fulltext":true,"cited_by_count":20,"citation_normalized_percentile":{"value":0.91919544,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"769","last_page":"782"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":1.0,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9995999932289124,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9987999796867371,"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.8817360997200012},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7609999775886536},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.6407769918441772},{"id":"https://openalex.org/keywords/task-parallelism","display_name":"Task parallelism","score":0.5075792074203491},{"id":"https://openalex.org/keywords/implicit-parallelism","display_name":"Implicit parallelism","score":0.48583337664604187},{"id":"https://openalex.org/keywords/data-parallelism","display_name":"Data parallelism","score":0.4542038142681122},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.45052370429039},{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.41209131479263306},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.39873817563056946}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8817360997200012},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7609999775886536},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.6407769918441772},{"id":"https://openalex.org/C42992933","wikidata":"https://www.wikidata.org/wiki/Q691169","display_name":"Task parallelism","level":3,"score":0.5075792074203491},{"id":"https://openalex.org/C3543717","wikidata":"https://www.wikidata.org/wiki/Q6007302","display_name":"Implicit parallelism","level":4,"score":0.48583337664604187},{"id":"https://openalex.org/C61483411","wikidata":"https://www.wikidata.org/wiki/Q3124522","display_name":"Data parallelism","level":3,"score":0.4542038142681122},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.45052370429039},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.41209131479263306},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.39873817563056946},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3192366.3192391","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3192366.3192391","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01937946v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01937946","pdf_url":"https://inria.hal.science/hal-01937946/document","source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"PLDI\u201918 - 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, Jun 2018, Philadelphia, United States. ⟨10.1145/3192366.3192391⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01937946v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01937946","pdf_url":"https://inria.hal.science/hal-01937946/document","source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"PLDI\u201918 - 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, Jun 2018, Philadelphia, United States. ⟨10.1145/3192366.3192391⟩","raw_type":"Conference papers"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.46000000834465027}],"awards":[{"id":"https://openalex.org/G6667505585","display_name":null,"funder_award_id":"ERC-2012-StG-308246","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"}],"funders":[{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2799001871.pdf","grobid_xml":"https://content.openalex.org/works/W2799001871.grobid-xml"},"referenced_works_count":64,"referenced_works":["https://openalex.org/W57462620","https://openalex.org/W869573524","https://openalex.org/W1505725463","https://openalex.org/W1557865944","https://openalex.org/W1578086264","https://openalex.org/W1965708711","https://openalex.org/W1967882079","https://openalex.org/W1972174903","https://openalex.org/W1972200437","https://openalex.org/W1973739282","https://openalex.org/W1974146675","https://openalex.org/W1975579741","https://openalex.org/W1979201594","https://openalex.org/W1983744444","https://openalex.org/W1993621349","https://openalex.org/W1994257154","https://openalex.org/W1995873479","https://openalex.org/W1999241319","https://openalex.org/W2002209075","https://openalex.org/W2009122662","https://openalex.org/W2015003898","https://openalex.org/W2016559894","https://openalex.org/W2019380637","https://openalex.org/W2045271686","https://openalex.org/W2054983537","https://openalex.org/W2056656593","https://openalex.org/W2060847221","https://openalex.org/W2062273873","https://openalex.org/W2068042411","https://openalex.org/W2072725684","https://openalex.org/W2087610851","https://openalex.org/W2090247159","https://openalex.org/W2098147619","https://openalex.org/W2098297530","https://openalex.org/W2101132897","https://openalex.org/W2101951782","https://openalex.org/W2109065830","https://openalex.org/W2113563476","https://openalex.org/W2116718945","https://openalex.org/W2125650214","https://openalex.org/W2127523684","https://openalex.org/W2130566259","https://openalex.org/W2135490589","https://openalex.org/W2142729958","https://openalex.org/W2148049665","https://openalex.org/W2149663533","https://openalex.org/W2152971387","https://openalex.org/W2157542044","https://openalex.org/W2176686728","https://openalex.org/W2325254668","https://openalex.org/W2469198586","https://openalex.org/W2508222108","https://openalex.org/W2508784218","https://openalex.org/W2554354717","https://openalex.org/W2561675875","https://openalex.org/W3021594640","https://openalex.org/W3098874119","https://openalex.org/W4230609379","https://openalex.org/W4233778051","https://openalex.org/W4241618768","https://openalex.org/W4244257941","https://openalex.org/W4245607618","https://openalex.org/W4247176905","https://openalex.org/W6649120592"],"related_works":["https://openalex.org/W2003935582","https://openalex.org/W74409296","https://openalex.org/W2950520577","https://openalex.org/W2494130044","https://openalex.org/W1554644772","https://openalex.org/W2468095077","https://openalex.org/W305742777","https://openalex.org/W2567390125","https://openalex.org/W2105992728","https://openalex.org/W1229628"],"abstract_inverted_index":{"A":[0],"classic":[1],"problem":[2,31],"in":[3,16,36,40],"parallel":[4,11,49,57],"computing":[5],"is":[6],"to":[7,66,70],"take":[8],"a":[9,27,71],"high-level":[10],"program":[12],"written,":[13],"for":[14],"example,":[15],"nested-parallel":[17],"style":[18],"with":[19],"fork-join":[20],"constructs":[21],"and":[22,47,64],"run":[23],"it":[24],"efficiently":[25],"on":[26],"real":[28],"machine.":[29],"The":[30],"could":[32],"be":[33],"considered":[34],"solved":[35],"theory,":[37],"but":[38],"not":[39],"practice,":[41],"because":[42],"the":[43,74],"overheads":[44,75],"of":[45],"creating":[46],"managing":[48],"threads":[50],"can":[51],"overwhelm":[52],"their":[53],"benefits.":[54],"Developing":[55],"efficient":[56],"codes":[58],"therefore":[59],"usually":[60],"requires":[61],"extensive":[62],"tuning":[63],"optimizations":[65],"reduce":[67],"parallelism":[68],"just":[69],"point":[72],"where":[73],"become":[76],"acceptable.":[77]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4}],"updated_date":"2026-03-11T14:59:36.786465","created_date":"2025-10-10T00:00:00"}