{"id":"https://openalex.org/W1539834906","doi":"https://doi.org/10.1145/3490148","title":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","display_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","publication_year":2022,"publication_date":"2022-07-10","ids":{"openalex":"https://openalex.org/W1539834906","doi":"https://doi.org/10.1145/3490148","mag":"1539834906"},"language":"en","primary_location":{"id":"doi:10.1145/3490148","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3490148","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"proceedings"},"type":"paratext","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":true,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9958000183105469,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9958000183105469,"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"}},{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.9916999936103821,"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.833189845085144},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.6375862956047058},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5360515117645264},{"id":"https://openalex.org/keywords/pleasure","display_name":"Pleasure","score":0.48278844356536865},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4314592480659485},{"id":"https://openalex.org/keywords/data-parallelism","display_name":"Data parallelism","score":0.42534950375556946},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4168532192707062},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3263152539730072},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09337034821510315}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.833189845085144},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.6375862956047058},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5360515117645264},{"id":"https://openalex.org/C2777113389","wikidata":"https://www.wikidata.org/wiki/Q208195","display_name":"Pleasure","level":2,"score":0.48278844356536865},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4314592480659485},{"id":"https://openalex.org/C61483411","wikidata":"https://www.wikidata.org/wiki/Q3124522","display_name":"Data parallelism","level":3,"score":0.42534950375556946},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4168532192707062},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3263152539730072},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09337034821510315},{"id":"https://openalex.org/C169760540","wikidata":"https://www.wikidata.org/wiki/Q207011","display_name":"Neuroscience","level":1,"score":0.0},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3490148","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3490148","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"proceedings"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.9100000262260437}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2950520577","https://openalex.org/W1554644772","https://openalex.org/W2494130044","https://openalex.org/W2003935582","https://openalex.org/W3209384898","https://openalex.org/W74409296","https://openalex.org/W1991844655","https://openalex.org/W1595834484","https://openalex.org/W3170887803","https://openalex.org/W2468095077"],"abstract_inverted_index":{"It":[0,175,182],"is":[1],"our":[2],"great":[3],"pleasure":[4],"to":[5,8,24,43],"welcome":[6],"you":[7],"the":[9,34,58,65,110],"34th":[10],"ACM":[11],"Symposium":[12],"on":[13,144],"Parallelism":[14],"in":[15],"Algorithms":[16],"and":[17,36,70,77,101,116,127,131,149,169,177],"Architectures":[18],"-":[19],"SPAA":[20,22,59],"2022.":[21],"seeks":[23],"develop":[25],"a":[26,139],"deeper":[27],"understanding":[28],"of":[29,38,67,112],"parallelism":[30],"by":[31,166,184],"bringing":[32],"together":[33],"theory":[35],"practice":[37],"parallel":[39,68,126],"computing,":[40],"broadly":[41],"defined":[42],"encompass":[44],"any":[45],"computational":[46],"setting":[47],"where":[48],"multiple":[49],"operations":[50],"can":[51],"be":[52,156],"performed":[53],"simultaneously":[54],"or":[55],"concurrently.":[56],"Continuing":[57],"tradition,":[60],"this":[61],"year's":[62],"program":[63,93,136],"reflects":[64],"diversity":[66],"settings":[69],"showcases":[71],"work":[72],"that":[73,142],"combines":[74],"theoretical":[75],"advancement":[76],"empirical":[78],"evaluation.":[79],"The":[80,92,135],"call":[81],"for":[82],"papers":[83,97],"attracted":[84],"108":[85],"regular":[86,96],"submissions":[87,108],"plus":[88],"7":[89],"brief":[90,103],"announcements.":[91],"accepted":[94],"33":[95],"(30.5%":[98],"acceptance":[99],"rate)":[100],"12":[102],"announcements,":[104],"selected":[105],"from":[106],"all":[107],"with":[109],"goal":[111],"generating":[113],"interesting":[114],"discussions":[115],"new":[117],"directions.":[118],"Several":[119],"traditional":[120],"topics":[121],"are":[122],"well-represented,":[123],"including":[124],"scheduling,":[125],"distributed":[128],"graph":[129],"algorithms,":[130],"concurrent":[132],"data":[133],"structures.":[134],"also":[137],"includes":[138],"few":[140],"works":[141],"touch":[143],"energy":[145],"consumption,":[146],"near-memory":[147],"processing,":[148],"persistent":[150],"memory.":[151],"Two":[152],"keynote":[153],"lectures":[154],"will":[155],"given:":[157],"\"Large":[158],"Scale":[159],"Parallel":[160],"Sparse":[161],"Matrix":[162],"Streaming":[163],"Graph/Network":[164],"Analysis\"":[165],"Jeremy":[167],"Kepner":[168],"\"Algorithm":[170],"Improvement:":[171],"How":[172,178],"Fast":[173],"Has":[174],"Been":[176],"Much":[179],"Farther":[180],"Can":[181],"Go?\"":[183],"Neil":[185],"Thompson.":[186]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}