{"id":"https://openalex.org/W2736645086","doi":"https://doi.org/10.1145/3087556.3087565","title":"Fast Scheduling in Distributed Transactional Memory","display_name":"Fast Scheduling in Distributed Transactional Memory","publication_year":2017,"publication_date":"2017-07-20","ids":{"openalex":"https://openalex.org/W2736645086","doi":"https://doi.org/10.1145/3087556.3087565","mag":"2736645086"},"language":"en","primary_location":{"id":"doi:10.1145/3087556.3087565","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087556.3087565","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures","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/A5044907189","display_name":"Costas Busch","orcid":"https://orcid.org/0000-0002-4381-4333"},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Costas Busch","raw_affiliation_strings":["Louisiana State University, Baton Rouge, LA, USA"],"affiliations":[{"raw_affiliation_string":"Louisiana State University, Baton Rouge, LA, USA","institution_ids":["https://openalex.org/I121820613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086347882","display_name":"Maurice Herlihy","orcid":"https://orcid.org/0000-0002-3059-8926"},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Maurice Herlihy","raw_affiliation_strings":["Brown University, Providence, RI, USA"],"affiliations":[{"raw_affiliation_string":"Brown University, Providence, RI, USA","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074956004","display_name":"Miroslav Popovi\u0107","orcid":"https://orcid.org/0000-0001-8385-149X"},"institutions":[{"id":"https://openalex.org/I170726198","display_name":"University of Novi Sad","ror":"https://ror.org/00xa57a59","country_code":"RS","type":"education","lineage":["https://openalex.org/I170726198"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"Miroslav Popovic","raw_affiliation_strings":["University of Novi Sad, Novi Sad, Serbia"],"affiliations":[{"raw_affiliation_string":"University of Novi Sad, Novi Sad, Serbia","institution_ids":["https://openalex.org/I170726198"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002981812","display_name":"Gokarna Sharma","orcid":"https://orcid.org/0000-0002-4930-4609"},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gokarna Sharma","raw_affiliation_strings":["Kent State University, Kent, OH, USA"],"affiliations":[{"raw_affiliation_string":"Kent State University, Kent, OH, USA","institution_ids":["https://openalex.org/I149910238"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5044907189"],"corresponding_institution_ids":["https://openalex.org/I121820613"],"apc_list":null,"apc_paid":null,"fwci":1.0315,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.79704928,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"173","last_page":"182"},"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.9998999834060669,"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.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9962999820709229,"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.9955999851226807,"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.8454976081848145},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6300142407417297},{"id":"https://openalex.org/keywords/transactional-memory","display_name":"Transactional memory","score":0.6128969788551331},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.6018922328948975},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5466901659965515},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5054092407226562},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.4767509400844574},{"id":"https://openalex.org/keywords/database-transaction","display_name":"Database transaction","score":0.4485425651073456},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42004191875457764},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4142382740974426},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10753196477890015},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.10146951675415039},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09239766001701355}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8454976081848145},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6300142407417297},{"id":"https://openalex.org/C134277064","wikidata":"https://www.wikidata.org/wiki/Q878206","display_name":"Transactional memory","level":3,"score":0.6128969788551331},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.6018922328948975},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5466901659965515},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5054092407226562},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.4767509400844574},{"id":"https://openalex.org/C75949130","wikidata":"https://www.wikidata.org/wiki/Q848010","display_name":"Database transaction","level":2,"score":0.4485425651073456},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42004191875457764},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4142382740974426},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10753196477890015},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.10146951675415039},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09239766001701355},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3087556.3087565","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087556.3087565","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3920014752","display_name":null,"funder_award_id":"1320835, 1420673","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"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":34,"referenced_works":["https://openalex.org/W194026900","https://openalex.org/W195207375","https://openalex.org/W198905962","https://openalex.org/W1595370658","https://openalex.org/W1645186466","https://openalex.org/W1857380652","https://openalex.org/W1887528286","https://openalex.org/W1979642600","https://openalex.org/W1980499862","https://openalex.org/W1988800505","https://openalex.org/W2000997934","https://openalex.org/W2003895614","https://openalex.org/W2005064465","https://openalex.org/W2008258200","https://openalex.org/W2015852161","https://openalex.org/W2032945467","https://openalex.org/W2034297532","https://openalex.org/W2036987653","https://openalex.org/W2044636013","https://openalex.org/W2068529026","https://openalex.org/W2074415746","https://openalex.org/W2097447543","https://openalex.org/W2097755092","https://openalex.org/W2101209730","https://openalex.org/W2106871513","https://openalex.org/W2113751407","https://openalex.org/W2134539478","https://openalex.org/W2135352683","https://openalex.org/W2155979591","https://openalex.org/W2161205537","https://openalex.org/W2165791323","https://openalex.org/W2460947863","https://openalex.org/W2560802770","https://openalex.org/W2769656678"],"related_works":["https://openalex.org/W2413588304","https://openalex.org/W4286907761","https://openalex.org/W2916710807","https://openalex.org/W2009411567","https://openalex.org/W3205447645","https://openalex.org/W2774705104","https://openalex.org/W2097769911","https://openalex.org/W2371629703","https://openalex.org/W72835634","https://openalex.org/W2103422273"],"abstract_inverted_index":{"We":[0,149],"investigate":[1],"scheduling":[2],"algorithms":[3],"for":[4,58,132,152,156,200],"distributed":[5,201],"transactional":[6,202],"memory":[7],"systems":[8],"where":[9],"transactions":[10,115],"residing":[11],"at":[12],"nodes":[13],"of":[14,74,143],"a":[15,124],"communication":[16,60],"graph":[17],"operate":[18],"on":[19,79],"shared,":[20],"mobile":[21],"objects.":[22],"A":[23],"transaction":[24],"requests":[25],"the":[26,72,75,139,144,147,169,192],"objects":[27,33,42,145,158],"it":[28,160,178],"needs,":[29],"executes":[30],"once":[31],"those":[32,41],"have":[34],"been":[35],"assembled,":[36],"and":[37,62,83,108],"then":[38],"possibly":[39],"forwards":[40],"to":[43,55,65,98,123,163,168,181,195],"other":[44],"waiting":[45],"transactions.":[46],"Minimizing":[47],"execution":[48,92,136,165],"time":[49,166],"in":[50,94,100,146],"this":[51,190],"model":[52],"is":[53,161,176,179,191],"known":[54],"be":[56],"NP-hard":[57],"arbitrary":[59],"graphs,":[61],"also":[63],"hard":[64],"approximate":[66,138],"within":[67],"any":[68],"factor":[69,125],"smaller":[70],"than":[71],"size":[73],"graph.":[76,148],"Nevertheless,":[77],"networks":[78],"chips,":[80],"multi-core":[81],"systems,":[82],"clusters":[84],"are":[85],"not":[86],"arbitrary.":[87],"Here,":[88],"we":[89,119],"explore":[90],"efficient":[91],"schedules":[93,199],"specialized":[95],"graphs":[96],"likely":[97],"arise":[99],"practice:":[101],"Clique,":[102],"Line,":[103],"Grid,":[104],"Cluster,":[105],"Hypercube,":[106],"Butterfly,":[107],"Star.":[109],"In":[110],"most":[111],"cases,":[112],"when":[113],"individual":[114],"request":[116],"k":[117],"objects,":[118],"obtain":[120,164,196],"solutions":[121,131],"close":[122,167],"O(k)":[126],"from":[127],"optimal,":[128],"yielding":[129],"near-optimal":[130],"constant":[133],"k.":[134],"These":[135],"times":[137],"TSP":[140,172],"tour":[141,173],"lengths":[142],"show":[150],"that":[151],"general":[153],"networks,":[154],"even":[155],"two":[157],"(k=2),":[159],"impossible":[162],"objects'":[170],"optimal":[171],"lengths,":[174],"which":[175],"why":[177],"useful":[180],"consider":[182],"more":[183],"realistic":[184],"network":[185],"models.":[186],"To":[187],"our":[188],"knowledge,":[189],"first":[193],"attempt":[194],"provably":[197],"fast":[198],"memory.":[203]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}