{"id":"https://openalex.org/W2171146288","doi":"https://doi.org/10.1145/1345206.1345232","title":"Nested parallelism in transactional memory","display_name":"Nested parallelism in transactional memory","publication_year":2008,"publication_date":"2008-02-20","ids":{"openalex":"https://openalex.org/W2171146288","doi":"https://doi.org/10.1145/1345206.1345232","mag":"2171146288"},"language":"en","primary_location":{"id":"doi:10.1145/1345206.1345232","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1345206.1345232","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming","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/A5035990793","display_name":"Kunal Agrawal","orcid":"https://orcid.org/0000-0001-5882-6647"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kunal Agrawal","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011772692","display_name":"Jeremy T. Fineman","orcid":"https://orcid.org/0009-0000-7483-4532"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeremy T. Fineman","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039750618","display_name":"Jim Sukha","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jim Sukha","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.8648,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.97057208,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"163","last_page":"174"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","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/T10772","display_name":"Distributed systems and fault tolerance","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.9840999841690063,"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/T12288","display_name":"Optimization and Search Problems","score":0.9725000262260437,"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.8633723258972168},{"id":"https://openalex.org/keywords/transactional-memory","display_name":"Transactional memory","score":0.8128370046615601},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7314530611038208},{"id":"https://openalex.org/keywords/nesting","display_name":"Nesting (process)","score":0.6950011253356934},{"id":"https://openalex.org/keywords/software-transactional-memory","display_name":"Software transactional memory","score":0.6795640587806702},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.6625037789344788},{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.4173480272293091},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.39031222462654114},{"id":"https://openalex.org/keywords/database-transaction","display_name":"Database transaction","score":0.20320799946784973}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8633723258972168},{"id":"https://openalex.org/C134277064","wikidata":"https://www.wikidata.org/wiki/Q878206","display_name":"Transactional memory","level":3,"score":0.8128370046615601},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7314530611038208},{"id":"https://openalex.org/C2776937656","wikidata":"https://www.wikidata.org/wiki/Q2229669","display_name":"Nesting (process)","level":2,"score":0.6950011253356934},{"id":"https://openalex.org/C167149655","wikidata":"https://www.wikidata.org/wiki/Q1189004","display_name":"Software transactional memory","level":4,"score":0.6795640587806702},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.6625037789344788},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.4173480272293091},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.39031222462654114},{"id":"https://openalex.org/C75949130","wikidata":"https://www.wikidata.org/wiki/Q848010","display_name":"Database transaction","level":2,"score":0.20320799946784973},{"id":"https://openalex.org/C191897082","wikidata":"https://www.wikidata.org/wiki/Q11467","display_name":"Metallurgy","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1145/1345206.1345232","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1345206.1345232","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.136.106","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.106","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://supertech.csail.mit.edu/~sukhaj/papers/xcilk.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.136.36","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.36","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://supertech.csail.mit.edu/~sukhaj/papers/xcilk.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.142.3462","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.3462","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.csail.mit.edu/~jfineman/xcilk.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.158.8952","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.8952","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://supertech.csail.mit.edu/papers/cwstm.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.184.2422","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.184.2422","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.rochester.edu/meetings/TRANSACT07/papers/agrawal.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.360.950","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.360.950","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.csail.mit.edu/sukhaj/papers/cwstm.pdf","raw_type":"text"},{"id":"pmh:oai:urresearch.rochester.edu:4044","is_oa":false,"landing_page_url":"http://hdl.handle.net/1802/4426","pdf_url":null,"source":{"id":"https://openalex.org/S4306400518","display_name":"UR Research (University of Rochester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5388228","host_organization_name":"University of Rochester","host_organization_lineage":["https://openalex.org/I5388228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.44999998807907104,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1676865579","https://openalex.org/W1986913310","https://openalex.org/W2006562083","https://openalex.org/W2017700354","https://openalex.org/W2026511056","https://openalex.org/W2032204694","https://openalex.org/W2032401773","https://openalex.org/W2043003055","https://openalex.org/W2055100610","https://openalex.org/W2056714230","https://openalex.org/W2056890346","https://openalex.org/W2079854797","https://openalex.org/W2100716766","https://openalex.org/W2105055683","https://openalex.org/W2113751407","https://openalex.org/W2115968584","https://openalex.org/W2135430119","https://openalex.org/W2147801081","https://openalex.org/W2149473197","https://openalex.org/W2752885492","https://openalex.org/W3145128584","https://openalex.org/W4230702135","https://openalex.org/W4254297013","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3148592861","https://openalex.org/W1754753007","https://openalex.org/W190731304","https://openalex.org/W1449437695","https://openalex.org/W2183311152","https://openalex.org/W2348711589","https://openalex.org/W1577309527","https://openalex.org/W2171146288","https://openalex.org/W2104241878","https://openalex.org/W2182108417"],"abstract_inverted_index":{"This":[0],"paper":[1],"investigates":[2],"adding":[3],"transactions":[4,10,41],"with":[5,42,75,96],"nested":[6,9,43],"parallelism":[7,44],"and":[8,45,65,78],"to":[11],"a":[12,26,34,53,73,79],"dynamically":[13],"multithreaded":[14],"parallel":[15],"programming":[16],"language":[17],"that":[18,29,51],"generates":[19],"only":[20,99],"series-parallel":[21],"programs.":[22],"We":[23],"describe":[24],"XConflict,":[25],"data":[27],"structure":[28],"facilitates":[30],"conflict":[31,60],"detection":[32],"for":[33,72],"software":[35],"transactional":[36],"memory":[37],"system":[38],"which":[39],"supports":[40],"unbounded":[46],"nesting":[47],"depth.":[48],"For":[49],"languages":[50],"use":[52],"Cilk-like":[54],"work-stealing":[55],"scheduler,":[56],"XConflict":[57,97],"answers":[58],"concurrent":[59],"queries":[61],"in":[62],"O(1)":[63],"time":[64,88],"can":[66],"be":[67],"maintained":[68],"efficiently.":[69],"In":[70],"particular,":[71],"program":[74,94],"T1":[76],"work":[77],"span":[80],"(or":[81],"critical-path":[82],"length)":[83],"of":[84,92],"T\u221e,":[85],"the":[86,93],"running":[87],"on":[89],"p":[90],"processors":[91],"augmented":[95],"is":[98],"O(T1/p":[100],"+":[101],"pT\u221e).":[102]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}