{"id":"https://openalex.org/W1498628342","doi":null,"title":"Asynchronous algorithms for shared memory parallel computers","display_name":"Asynchronous algorithms for shared memory parallel computers","publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W1498628342","mag":"1498628342"},"language":"en","primary_location":{"id":"mag:1498628342","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=145920","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5078929461","display_name":"Ramesh Subramonian","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ramesh Subramonian","raw_affiliation_strings":["university of california, davis"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"university of california, davis","institution_ids":["https://openalex.org/I84218800"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5078929461"],"corresponding_institution_ids":["https://openalex.org/I84218800"],"apc_list":null,"apc_paid":null,"fwci":1.3939,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.80339321,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9214000105857849,"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":0.9214000105857849,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.05590000003576279,"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.003000000026077032,"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/pram-simulation","display_name":"PRAM simulation","score":0.8629999756813049},{"id":"https://openalex.org/keywords/shared-memory-multiprocessors","display_name":"shared-memory multiprocessors","score":0.9399999976158142},{"id":"https://openalex.org/keywords/randomization","display_name":"randomization","score":0.5270000100135803},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"fault tolerance","score":0.8809999823570251},{"id":"https://openalex.org/keywords/associative-functions","display_name":"associative functions","score":0.7080000042915344},{"id":"https://openalex.org/keywords/prefix-sums","display_name":"prefix sums","score":0.9879999756813049},{"id":"https://openalex.org/keywords/list-ranking","display_name":"list ranking","score":0.9980000257492065},{"id":"https://openalex.org/keywords/parallel-sorting","display_name":"parallel sorting","score":0.8579999804496765},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"transitive closure","score":1.0}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9138263463973999},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.7815030813217163},{"id":"https://openalex.org/C156891508","wikidata":"https://www.wikidata.org/wiki/Q1004114","display_name":"Bulk synchronous parallel","level":3,"score":0.75738924741745},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7154484391212463},{"id":"https://openalex.org/C538114610","wikidata":"https://www.wikidata.org/wiki/Q24282658","display_name":"Analysis of parallel algorithms","level":3,"score":0.5617666244506836},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.48270559310913086},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.48233863711357117},{"id":"https://openalex.org/C2779019669","wikidata":"https://www.wikidata.org/wiki/Q25203946","display_name":"Asynchrony (computer programming)","level":3,"score":0.4807398319244385},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4651551842689514},{"id":"https://openalex.org/C2780898871","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Performance metric","level":2,"score":0.41430631279945374},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4055331349372864},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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":"mag:1498628342","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=145920","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1994657234","https://openalex.org/W2106780470","https://openalex.org/W2041645051","https://openalex.org/W2113347691","https://openalex.org/W7098639933","https://openalex.org/W1490307003","https://openalex.org/W1967960741","https://openalex.org/W2036724719","https://openalex.org/W2057119155","https://openalex.org/W2009949019"],"abstract_inverted_index":{"We":[0,95,141,221],"propose":[1,287],"a":[2,13,138,145,179,191,213,219,225,281,294,310,315,332],"new":[3],"model":[4,50],"of":[5,17,70,137,159,207,215,227,304,308,331],"asynchronous":[6,170,195,237],"parallel":[7,139,196,216],"computation,":[8],"the":[9,23,124,204,249,257,265,292,305,329],"A-PRAM,":[10],"which":[11,148,198,202],"is":[12,41,51,73,203,231],"more":[14],"realistic":[15,93],"reflection":[16],"shared":[18],"memory":[19,299],"multi-processor":[20,47],"systems":[21],"than":[22],"synchronous":[24],"Parallel":[25],"Random":[26],"Access":[27],"Machine":[28],"(PRAM)":[29],"model.":[30],"The":[31,161],"PRAM":[32,49,79,100],"assumption":[33],"that":[34,97,313],"all":[35],"processors":[36,165,217,244],"operate":[37],"in":[38,111,144,235,335],"lock-step":[39],"synchrony":[40],"expensive":[42],"to":[43,74,77,116,134,166,301],"implement":[44],"for":[45,53,89,194,264,290],"large":[46],"systems.\r\nThe":[48],"good":[52],"designing":[54],"algorithms":[55,151,163,263],"and":[56,81,86,153,184,279],"writing":[57],"programs.":[58],"However,":[59,239],"its":[60],"unrealistic":[61],"assumptions":[62],"distance":[63],"it":[64],"from":[65],"practical":[66],"machines.":[67,94],"So,":[68],"one":[69,303],"our":[71,150],"goals":[72],"allow":[75,164],"programmers":[76],"write":[78,312],"programs":[80,91],"then":[82,248],"provide":[83],"an":[84,106,236,269],"efficient":[85,262],"correct":[87,317],"simulation":[88],"these":[90,129],"on":[92,105,123],"show":[96],"any":[98,182],"n-processor":[99],"program":[101],"can":[102,324],"be":[103,253],"simulated":[104],"A-PRAM":[107,258],"with":[108],"no":[109],"loss":[110],"asymptotic":[112],"efficiency":[113],"using":[114,132],"up":[115],"$n\\over\\log":[117],"n$":[118],"processors,":[119],"provided":[120],"minor":[121],"restrictions":[122],"asynchrony":[125],"are":[126,242],"imposed.\r\nWe":[127],"achieve":[128],"results":[130],"by":[131,212],"randomization":[133,143],"schedule":[135],"sub-tasks":[136],"program.":[140],"use":[142,222],"novel":[146],"way":[147],"makes":[149],"fault-tolerant":[152],"greatly":[154],"reduces":[155],"inefficiency":[156],"arising":[157],"out":[158],"busy-waiting.":[160],"resulting":[162],"(i)":[167],"have":[168],"arbitrary":[169,175],"behavior;":[171],"(ii)":[172],"fail":[173],"at":[174,181,328],"times;":[176],"(iii)":[177],"join":[178],"computation":[180],"time;":[183],"(iv)":[185],"not":[186,233],"require":[187],"unique":[188],"identifiers.\r\nWe":[189],"develop":[190],"performance":[192,228],"metric":[193,226],"computations":[197],"we":[199,260,323],"call":[200],"work":[201,223],"total":[205,336],"number":[206],"instructions":[208],"(including":[209],"busy-waiting)":[210],"performed":[211],"collection":[214],"during":[218],"computation.":[220],"as":[224],"since":[229],"time":[230,250],"often":[232],"meaningful":[234],"environment.":[238],"if":[240],"there":[241],"p":[243],"running":[245],"nearly":[246],"synchronously,":[247],"taken":[251],"would":[252],"expected":[254],"$O({work\\over":[255],"p}).$\r\nIn":[256],"setting,":[259],"design":[261],"following":[266],"problems:":[267],"computing":[268],"associative":[270],"function,":[271],"prefix":[272],"sums,":[273],"list":[274],"ranking,":[275],"sorting,":[276],"transitive":[277],"closure":[278],"evaluating":[280],"bounded":[282],"degree":[283],"fan-in":[284],"circuit.\r\nWe":[285],"also":[286],"hardware":[288],"support":[289],"asynchrony,":[291,309],"TPRAM,":[293],"tagged":[295],"A-PRAM.":[296],"It":[297],"uses":[298],"tags":[300],"handle":[302],"fundamental":[306],"problems":[307],"slow":[311],"overwrites":[314],"current,":[316],"value.":[318],"On":[319],"this":[320],"stronger":[321],"model,":[322],"get":[325],"faster":[326],"simulations,":[327],"cost":[330],"modest":[333],"increase":[334],"work.":[337]},"counts_by_year":[],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2016-06-24T00:00:00"}