{"id":"https://openalex.org/W4230609379","doi":"https://doi.org/10.1145/1640089.1640106","title":"The design of a task parallel library","display_name":"The design of a task parallel library","publication_year":2009,"publication_date":"2009-10-25","ids":{"openalex":"https://openalex.org/W4230609379","doi":"https://doi.org/10.1145/1640089.1640106"},"language":"en","primary_location":{"id":"doi:10.1145/1640089.1640106","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1640089.1640106","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications","raw_type":"proceedings-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/A5086447301","display_name":"Daan Leijen","orcid":"https://orcid.org/0000-0003-1027-5430"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Daan Leijen","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081551496","display_name":"Wolfram Schulte","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wolfram Schulte","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045088961","display_name":"Sebastian Burckhardt","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sebastian Burckhardt","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5086447301"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":13.191,"has_fulltext":false,"cited_by_count":155,"citation_normalized_percentile":{"value":0.99023187,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"227","last_page":"242"},"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.9993000030517578,"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.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.8718405365943909},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6358444690704346},{"id":"https://openalex.org/keywords/task-parallelism","display_name":"Task parallelism","score":0.6128953695297241},{"id":"https://openalex.org/keywords/delegate","display_name":"Delegate","score":0.5554062724113464},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5161855816841125},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.503537118434906},{"id":"https://openalex.org/keywords/data-parallelism","display_name":"Data parallelism","score":0.4879879355430603},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4494841992855072},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4068009853363037}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8718405365943909},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6358444690704346},{"id":"https://openalex.org/C42992933","wikidata":"https://www.wikidata.org/wiki/Q691169","display_name":"Task parallelism","level":3,"score":0.6128953695297241},{"id":"https://openalex.org/C143273055","wikidata":"https://www.wikidata.org/wiki/Q2382794","display_name":"Delegate","level":2,"score":0.5554062724113464},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5161855816841125},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.503537118434906},{"id":"https://openalex.org/C61483411","wikidata":"https://www.wikidata.org/wiki/Q3124522","display_name":"Data parallelism","level":3,"score":0.4879879355430603},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4494841992855072},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4068009853363037},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"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":1,"locations":[{"id":"doi:10.1145/1640089.1640106","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1640089.1640106","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W15967947","https://openalex.org/W1545792627","https://openalex.org/W1595593557","https://openalex.org/W1968020161","https://openalex.org/W1975579741","https://openalex.org/W1983587324","https://openalex.org/W1987607743","https://openalex.org/W2008447317","https://openalex.org/W2016559894","https://openalex.org/W2023168372","https://openalex.org/W2026049208","https://openalex.org/W2045867114","https://openalex.org/W2072725684","https://openalex.org/W2098147619","https://openalex.org/W2111946621","https://openalex.org/W2130278109","https://openalex.org/W2160781056","https://openalex.org/W2162450406","https://openalex.org/W2168339347","https://openalex.org/W3045210524","https://openalex.org/W4205190765","https://openalex.org/W4241889953","https://openalex.org/W4294549613","https://openalex.org/W6632982355","https://openalex.org/W6646522387"],"related_works":["https://openalex.org/W2950520577","https://openalex.org/W1501159154","https://openalex.org/W2003935582","https://openalex.org/W74409296","https://openalex.org/W1554644772","https://openalex.org/W2494130044","https://openalex.org/W2468095077","https://openalex.org/W29548032","https://openalex.org/W2593878938","https://openalex.org/W305742777"],"abstract_inverted_index":{"The":[0,23,46],"Task":[1],"Parallel":[2,149,161],"Library":[3],"(TPL)":[4],"is":[5,49,117],"a":[6,21,55,58,76,103,108,135],"library":[7,24,47,69,101,170],"for":[8,151],".NET":[9,153],"that":[10,118,166],"makes":[11],"it":[12],"easy":[13],"to":[14,32,85],"take":[15],"advantage":[16],"of":[17,54,75,114,146,160],"potential":[18],"parallelism":[19,39],"in":[20,43,134,173,181],"program.":[22],"relies":[25],"heavily":[26],"on":[27,96,124],"generics":[28],"and":[29,80,156],"delegate":[30],"expressions":[31],"provide":[33],"custom":[34],"control":[35],"structures":[36],"expressing":[37],"structured":[38],"such":[40],"as":[41,57,144],"map-reduce":[42],"user":[44],"programs.":[45],"implementation":[48],"built":[50],"around":[51],"the":[52,64,68,72,97,100,147,152,158,167,177],"notion":[53],"task":[56],"finite":[59],"CPU-bound":[60],"computation.":[61],"To":[62],"capture":[63,131],"ubiquitous":[65],"apply-to-all":[66],"pattern":[67],"also":[70],"introduces":[71],"novel":[73,104],"concept":[74],"replicable":[77,81],"task.":[78],"Tasks":[79],"tasks":[82],"are":[83],"assigned":[84],"threads":[86],"using":[87],"work":[88],"stealing":[89],"techniques,":[90],"but":[91,130],"unlike":[92],"traditional":[93],"implementations":[94],"based":[95],"THE":[98],"protocol,":[99],"uses":[102],"data":[105],"structure":[106],"called":[107],"'duplicating":[109],"queue'.":[110],"A":[111],"surprising":[112],"feature":[113],"duplicating":[115,140],"queues":[116],"they":[119],"have":[120],"sequentially":[121],"inconsistent":[122],"behavior":[123],"architectures":[125],"with":[126],"weak":[127],"memory":[128],"models,":[129],"this":[132,182],"non-determinism":[133],"benign":[136],"way":[137],"by":[138],"sometimes":[139],"elements.":[141],"TPL":[142,169],"ships":[143],"part":[145],"Microsoft":[148],"Extensions":[150],"framework":[154],"4.0,":[155],"forms":[157],"foundation":[159],"LINQ":[162],"queries":[163],"(however,":[164],"note":[165],"productized":[168],"may":[171],"differ":[172],"significant":[174],"ways":[175],"from":[176],"basic":[178],"design":[179],"described":[180],"article).":[183]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":14},{"year":2015,"cited_by_count":18},{"year":2014,"cited_by_count":15},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":18}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}