{"id":"https://openalex.org/W2129990308","doi":"https://doi.org/10.1145/1065944.1065952","title":"Composable memory transactions","display_name":"Composable memory transactions","publication_year":2005,"publication_date":"2005-06-15","ids":{"openalex":"https://openalex.org/W2129990308","doi":"https://doi.org/10.1145/1065944.1065952","mag":"2129990308"},"language":"en","primary_location":{"id":"doi:10.1145/1065944.1065952","doi":"https://doi.org/10.1145/1065944.1065952","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1065944.1065952","pdf_url":null,"source":{"id":"https://openalex.org/S4306417578","display_name":"ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5018504427","display_name":"Tim Harris","orcid":"https://orcid.org/0000-0001-9628-130X","observed_orcids":["https://orcid.org/0000-0001-9628-130X"]},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Tim Harris","raw_affiliation_strings":["Microsoft Research, Cambridge, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Cambridge, UK","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055243106","display_name":"Simon Marlow","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Simon Marlow","raw_affiliation_strings":["Microsoft Research, Cambridge, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Cambridge, UK","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072362603","display_name":"Simon Jones","orcid":"https://orcid.org/0000-0002-6085-1435","observed_orcids":["https://orcid.org/0000-0002-6085-1435","https://orcid.org/0000-0003-4111-0591"]},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Simon Peyton-Jones","raw_affiliation_strings":["Microsoft Research, Cambridge, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Cambridge, UK","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086347882","display_name":"Maurice P. Herlihy","orcid":"https://orcid.org/0000-0002-3059-8926","observed_orcids":["https://orcid.org/0000-0002-3059-8926"]},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Maurice Herlihy","raw_affiliation_strings":["Microsoft Research, Cambridge, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Cambridge, UK","institution_ids":["https://openalex.org/I4210164937"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210164937"],"apc_list":null,"apc_paid":null,"fwci":44.5149,"has_fulltext":false,"cited_by_count":731,"citation_normalized_percentile":{"value":0.99924171,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"48","last_page":"60"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9970999956130981,"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":0.9970999956130981,"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/T10126","display_name":"Logic, programming, and type systems","score":0.002400000113993883,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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":9.999999747378752e-05,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/transactional-memory","display_name":"transactional memory","score":0.8859999775886536},{"id":"https://openalex.org/keywords/concurrency-abstractions","display_name":"concurrency abstractions","score":0.7570000290870667},{"id":"https://openalex.org/keywords/blocking","display_name":"blocking","score":0.421999990940094},{"id":"https://openalex.org/keywords/choice","display_name":"choice","score":0.7110000252723694},{"id":"https://openalex.org/keywords/modular-composition","display_name":"modular composition","score":0.5289999842643738},{"id":"https://openalex.org/keywords/deadlock-freedom","display_name":"deadlock freedom","score":0.6660000085830688},{"id":"https://openalex.org/keywords/concurrent-programming","display_name":"concurrent programming","score":0.6579999923706055}],"concepts":[{"id":"https://openalex.org/C134277064","wikidata":"https://www.wikidata.org/wiki/Q878206","display_name":"Transactional memory","level":3,"score":0.8753576278686523},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.864274263381958},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.8035354614257812},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.6934763789176941},{"id":"https://openalex.org/C167149655","wikidata":"https://www.wikidata.org/wiki/Q1189004","display_name":"Software transactional memory","level":4,"score":0.6390609741210938},{"id":"https://openalex.org/C84511453","wikidata":"https://www.wikidata.org/wiki/Q2914952","display_name":"Concurrency control","level":3,"score":0.6293649077415466},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.6073434352874756},{"id":"https://openalex.org/C108744092","wikidata":"https://www.wikidata.org/wiki/Q93695","display_name":"Multiversion concurrency control","level":5,"score":0.5420381426811218},{"id":"https://openalex.org/C150495011","wikidata":"https://www.wikidata.org/wiki/Q128392","display_name":"Concurrent computing","level":2,"score":0.498272180557251},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4972105324268341},{"id":"https://openalex.org/C68489960","wikidata":"https://www.wikidata.org/wiki/Q2370659","display_name":"Transactional leadership","level":2,"score":0.4679834842681885},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.44904035329818726},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.4157448410987854},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3867112100124359},{"id":"https://openalex.org/C75949130","wikidata":"https://www.wikidata.org/wiki/Q848010","display_name":"Database transaction","level":2,"score":0.17823830246925354},{"id":"https://openalex.org/C208087996","wikidata":"https://www.wikidata.org/wiki/Q5283142","display_name":"Distributed concurrency control","level":4,"score":0.11772927641868591},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07089591026306152},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1065944.1065952","doi":"https://doi.org/10.1145/1065944.1065952","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1065944.1065952","pdf_url":null,"source":{"id":"https://openalex.org/S4306417578","display_name":"ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W657285","https://openalex.org/W1495087637","https://openalex.org/W1515932031","https://openalex.org/W1577809294","https://openalex.org/W1980895171","https://openalex.org/W1991494135","https://openalex.org/W2001657718","https://openalex.org/W2037521957","https://openalex.org/W2073256416","https://openalex.org/W2073407646","https://openalex.org/W2078944436","https://openalex.org/W2092911542","https://openalex.org/W2105055683","https://openalex.org/W2105772643","https://openalex.org/W2108204150","https://openalex.org/W2109052065","https://openalex.org/W2113751407","https://openalex.org/W2118317839","https://openalex.org/W2139077453","https://openalex.org/W2141094479","https://openalex.org/W2146516325","https://openalex.org/W2148186799","https://openalex.org/W2151290553","https://openalex.org/W2155323584","https://openalex.org/W2165825461","https://openalex.org/W2169000705","https://openalex.org/W2175492000","https://openalex.org/W2187800381","https://openalex.org/W2188944230","https://openalex.org/W2296715995","https://openalex.org/W4231885549","https://openalex.org/W4242949098"],"related_works":["https://openalex.org/W7096569068","https://openalex.org/W7097111089","https://openalex.org/W7098691467","https://openalex.org/W2241823029","https://openalex.org/W16757783","https://openalex.org/W2901379038","https://openalex.org/W7000281035","https://openalex.org/W7095570972","https://openalex.org/W7097760259","https://openalex.org/W4321466410"],"abstract_inverted_index":{"Writing":[0],"concurrent":[1],"programs":[2],"is":[3,7,17],"notoriously":[4],"difficult,":[5],"and":[6,72],"of":[8,15,53,70],"increasing":[9],"practical":[10],"importance.":[11],"A":[12],"particular":[13],"source":[14],"concern":[16],"that":[18,44,74],"even":[19],"correctly-implemented":[20],"concurrency":[21,38],"abstractions":[22],"cannot":[23],"be":[24],"composed":[25],"together":[26],"to":[27],"form":[28],"larger":[29],"abstractions.":[30],"In":[31],"this":[32],"paper":[33],"we":[34,65],"present":[35,57],"a":[36],"new":[37,67],"model,":[39],"based":[40],"on":[41],"transactional":[42,54],"memory,":[43],"offers":[45],"far":[46],"richer":[47],"composition.":[48],"All":[49],"the":[50],"usual":[51],"benefits":[52],"memory":[55],"are":[56],"(e.g.":[58],"freedom":[59],"from":[60],"deadlock),":[61],"but":[62],"in":[63,78],"addition":[64],"describe":[66],"modular":[68],"forms":[69],"blocking":[71],"choice":[73],"have":[75],"been":[76],"inaccessible":[77],"earlier":[79],"work.":[80]},"counts_by_year":[{"year":2026,"cited_by_count":8},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":15},{"year":2017,"cited_by_count":21},{"year":2016,"cited_by_count":24},{"year":2015,"cited_by_count":32},{"year":2014,"cited_by_count":33},{"year":2013,"cited_by_count":49},{"year":2012,"cited_by_count":41}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}