{"id":"https://openalex.org/W2809629215","doi":"https://doi.org/10.1145/3210377.3210395","title":"Laika","display_name":"Laika","publication_year":2018,"publication_date":"2018-07-11","ids":{"openalex":"https://openalex.org/W2809629215","doi":"https://doi.org/10.1145/3210377.3210395","mag":"2809629215"},"language":"en","primary_location":{"id":"doi:10.1145/3210377.3210395","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3210377.3210395","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210395","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210395","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069163294","display_name":"Predrag Gruevski","orcid":"https://orcid.org/0000-0003-2713-6621"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Predrag Gruevski","raw_affiliation_strings":["Kensho Technologies, Inc., Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Kensho Technologies, Inc., Cambridge, MA, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084297749","display_name":"William Hasenplaugh","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":"William Hasenplaugh","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"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/A5074518242","display_name":"David Lugato","orcid":null},"institutions":[{"id":"https://openalex.org/I2738703131","display_name":"Commissariat \u00e0 l'\u00c9nergie Atomique et aux \u00c9nergies Alternatives","ror":"https://ror.org/00jjx8s55","country_code":"FR","type":"government","lineage":["https://openalex.org/I2738703131"]},{"id":"https://openalex.org/I129235615","display_name":"CEA CESTA","ror":"https://ror.org/026ma2c10","country_code":"FR","type":"government","lineage":["https://openalex.org/I129235615","https://openalex.org/I4210101455"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"David Lugato","raw_affiliation_strings":["CEA Cesta, Le Barp, France"],"affiliations":[{"raw_affiliation_string":"CEA Cesta, Le Barp, France","institution_ids":["https://openalex.org/I129235615","https://openalex.org/I2738703131"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101937942","display_name":"James J. Thomas","orcid":"https://orcid.org/0000-0001-6823-3685"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James J. Thomas","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5069163294"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2627,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.50842372,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"415","last_page":"426"},"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.9998999834060669,"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.9998999834060669,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9995999932289124,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.7858930826187134},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6065307855606079},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.4879142940044403},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.46818840503692627},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44832199811935425},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.41541779041290283},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3529689311981201},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33565765619277954},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20914220809936523}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7858930826187134},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6065307855606079},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.4879142940044403},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.46818840503692627},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44832199811935425},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.41541779041290283},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3529689311981201},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33565765619277954},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20914220809936523},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3210377.3210395","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3210377.3210395","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210395","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3210377.3210395","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3210377.3210395","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210395","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320332503","display_name":"Lincoln Laboratory, Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2809629215.pdf","grobid_xml":"https://content.openalex.org/works/W2809629215.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W111446673","https://openalex.org/W1489951562","https://openalex.org/W1507039213","https://openalex.org/W1530872699","https://openalex.org/W1559687661","https://openalex.org/W1589213590","https://openalex.org/W1722263007","https://openalex.org/W1774183074","https://openalex.org/W1968747715","https://openalex.org/W1975464357","https://openalex.org/W1979566015","https://openalex.org/W1994182141","https://openalex.org/W2002555321","https://openalex.org/W2011024650","https://openalex.org/W2016559894","https://openalex.org/W2028045344","https://openalex.org/W2042587503","https://openalex.org/W2043003055","https://openalex.org/W2044593618","https://openalex.org/W2045271686","https://openalex.org/W2053486661","https://openalex.org/W2057542391","https://openalex.org/W2070232376","https://openalex.org/W2072605585","https://openalex.org/W2096544401","https://openalex.org/W2109991971","https://openalex.org/W2112397379","https://openalex.org/W2114301203","https://openalex.org/W2131221153","https://openalex.org/W2132745343","https://openalex.org/W2159772324","https://openalex.org/W2186799393","https://openalex.org/W2209640591","https://openalex.org/W2477959380","https://openalex.org/W2946046356","https://openalex.org/W3009233884","https://openalex.org/W3098342588"],"related_works":["https://openalex.org/W1571368810","https://openalex.org/W2808189470","https://openalex.org/W2379400621","https://openalex.org/W2372170743","https://openalex.org/W1558545464","https://openalex.org/W1579918296","https://openalex.org/W1484089092","https://openalex.org/W3003912857","https://openalex.org/W2390922181","https://openalex.org/W1572523360"],"abstract_inverted_index":{"Scientific":[0],"computing":[1],"problems":[2],"are":[3,116],"frequently":[4,117],"solved":[5],"using":[6,119,147,161,228],"data-graph":[7,29],"computations":[8,32],"--":[9],"algorithms":[10],"that":[11,235],"perform":[12],"local":[13],"updates":[14],"on":[15,131,203,213,236],"application-specific":[16],"data":[17],"associated":[18],"with":[19,256],"vertices":[20,39],"of":[21,57,62,80,87,135,217,224,291],"a":[22,35,93,99,141,148,162,204,222,225,229,237,289],"graph,":[23,37],"over":[24,288],"many":[25],"time":[26],"steps.":[27],"The":[28],"in":[30,42,108,285],"such":[31],"is":[33,111,193],"commonly":[34],"mesh":[36,238],"where":[38],"have":[40],"positions":[41],"3D":[43],"space,":[44],"and":[45,67,170,192,251,272,298],"edges":[46],"connect":[47],"physically":[48],"nearby":[49],"vertices.":[50],"A":[51],"scheduler":[52,144],"controls":[53],"the":[54,58,88,132,158,199,214,303],"parallel":[55,63,172,200,270,296],"execution":[56,179],"algorithm.":[59],"Two":[60],"classes":[61],"schedulers":[64,70,191,297],"exist:":[65],"double-buffering":[66],"in-place.":[68],"Double-buffering":[69],"do":[71],"not":[72],"incur":[73],"synchronization":[74,125],"overheads":[75,126],"due":[76,97],"to":[77,98,127,166],"an":[78,120,210],"absence":[79],"read-write":[81,129],"conflicts,":[82],"but":[83],"require":[84],"two":[85],"copies":[86],"vertices,":[89],"as":[90,92],"well":[91,275],"higher":[94],"iteration":[95,197],"count":[96],"slower":[100],"convergence":[101,109],"rate.":[102],"Computations":[103],"for":[104,153],"which":[105,123],"this":[106],"difference":[107],"rate":[110],"significant":[112],"(e.g.,":[113],"multigrid":[114],"method)":[115],"performed":[118],"in-place":[121,143,190],"scheduler,":[122],"incurs":[124],"avoid":[128],"conflicts":[130],"single":[133],"copy":[134],"vertex":[136],"data.":[137],"We":[138,208,232],"present":[139],"Laika,":[140],"deterministic":[142],"we":[145],"created":[146],"principled":[149],"three-step":[150],"design":[151],"strategy":[152],"high-performance":[154],"schedulers.":[155],"Laika":[156,182,244,267],"reorders":[157],"input":[159,206,292],"graph":[160,226,239],"Hilbert":[163],"space-filling":[164,230],"curve":[165],"improve":[167],"cache":[168,218],"locality":[169],"minimizes":[171],"coordination":[173],"overhead":[174,187],"by":[175],"explicitly":[176],"curbing":[177],"excess":[178],"parallelism.":[180],"Consequently,":[181],"has":[183],"significantly":[184],"lower":[185],"scheduling":[186],"than":[188,198,294,302],"alternative":[189],"even":[194],"faster":[195,284,301],"per":[196],"double-buffered":[201],"implementation":[202],"reordered":[205,227],"graph.":[207],"derive":[209],"improved":[211],"bound":[212],"expected":[215,254],"number":[216],"misses":[219],"incurred":[220],"during":[221],"traversal":[223],"curve.":[231],"also":[233],"prove":[234],"G":[240],"=":[241,258],"(V,":[242],"E),":[243],"performs":[245],"O(|V|":[246,259],"+":[247],"|E|)":[248],"total":[249],"work":[250],"achieves":[252],"linear":[253],"speedup":[255,271],"P":[257],"/":[260],"log^2":[261],"|V|)":[262],"workers.":[263],"On":[264],"48":[265],"cores,":[266],"yields":[268],"38.4x":[269],"empirically":[273],"fares":[274],"against":[276],"comparably":[277],"well-engineered":[278],"alternatives:":[279],"it":[280],"runs":[281],"6.97--12.60":[282],"times":[283,300],"geometric":[286],"mean":[287],"suite":[290],"graphs":[293],"other":[295],"222.57":[299],"baseline":[304],"serial":[305],"implementation.":[306]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2018-06-29T00:00:00"}