{"id":"https://openalex.org/W2581933961","doi":"https://doi.org/10.1145/3018743.3019031","title":"POSTER","display_name":"POSTER","publication_year":2017,"publication_date":"2017-01-26","ids":{"openalex":"https://openalex.org/W2581933961","doi":"https://doi.org/10.1145/3018743.3019031","mag":"2581933961"},"language":"en","primary_location":{"id":"doi:10.1145/3018743.3019031","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3018743.3019031","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3019031&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=3019031&type=pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025290203","display_name":"Rezaul Chowdhury","orcid":"https://orcid.org/0000-0002-7022-5278"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rezaul Chowdhury","raw_affiliation_strings":["Stony Brook University, Stony Brook, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stony Brook University, Stony Brook, NY, USA","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002918693","display_name":"Pramod Ganapathi","orcid":"https://orcid.org/0000-0001-5090-4444"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pramod Ganapathi","raw_affiliation_strings":["Stony Brook University, Stony Brook, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stony Brook University, Stony Brook, NY, USA","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101956627","display_name":"Yuan Tang","orcid":"https://orcid.org/0000-0001-6772-9427"},"institutions":[{"id":"https://openalex.org/I24943067","display_name":"Fudan University","ror":"https://ror.org/013q1eq08","country_code":"CN","type":"education","lineage":["https://openalex.org/I24943067"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuan Tang","raw_affiliation_strings":["Fudan University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fudan University, Shanghai, China","institution_ids":["https://openalex.org/I24943067"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026593207","display_name":"Jesmin Jahan Tithi","orcid":"https://orcid.org/0000-0002-2861-8393"},"institutions":[{"id":"https://openalex.org/I1343180700","display_name":"Intel (United States)","ror":"https://ror.org/01ek73717","country_code":"US","type":"company","lineage":["https://openalex.org/I1343180700"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jesmin Jahan Tithi","raw_affiliation_strings":["Intel Corporation, Santa Clara, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Intel Corporation, Santa Clara, CA, USA","institution_ids":["https://openalex.org/I1343180700"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2312,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.46579917,"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":"435","last_page":"436"},"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9940999746322632,"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.8715819716453552},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6830223798751831},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.6758911609649658},{"id":"https://openalex.org/keywords/fork","display_name":"Fork (system call)","score":0.6080873608589172},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.5868003368377686},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.5447311401367188},{"id":"https://openalex.org/keywords/cache-oblivious-algorithm","display_name":"Cache-oblivious algorithm","score":0.4308670163154602},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3855680525302887},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35082417726516724},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.33247697353363037},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.2950805425643921},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.10182163119316101}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8715819716453552},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6830223798751831},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6758911609649658},{"id":"https://openalex.org/C40523978","wikidata":"https://www.wikidata.org/wiki/Q14675","display_name":"Fork (system call)","level":2,"score":0.6080873608589172},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.5868003368377686},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.5447311401367188},{"id":"https://openalex.org/C59687516","wikidata":"https://www.wikidata.org/wiki/Q5015938","display_name":"Cache-oblivious algorithm","level":5,"score":0.4308670163154602},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3855680525302887},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35082417726516724},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.33247697353363037},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.2950805425643921},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.10182163119316101}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3018743.3019031","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3018743.3019031","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3019031&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3018743.3019031","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3018743.3019031","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3019031&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1124548093","display_name":"CAREER: A Unified Framework for Designing Efficient  Resource-Oblivious Parallel Algorithms","funder_award_id":"1553510","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2770802283","display_name":null,"funder_award_id":"CNS-1553510, CCF-1439084","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4926662827","display_name":"XPS: FULL: CCA: Collaborative Research: Cache-Adaptive Algorithms: How to Share Core among Many Cores","funder_award_id":"1439084","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5175347774","display_name":null,"funder_award_id":"CCF-1439084","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7410429640","display_name":null,"funder_award_id":"CNS-1553510","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":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2581933961.pdf","grobid_xml":"https://content.openalex.org/works/W2581933961.grobid-xml"},"referenced_works_count":1,"referenced_works":["https://openalex.org/W1976888542"],"related_works":["https://openalex.org/W1827355354","https://openalex.org/W4245668848","https://openalex.org/W2001324285","https://openalex.org/W2253769547","https://openalex.org/W2121191383","https://openalex.org/W2052196304","https://openalex.org/W2098406302","https://openalex.org/W2027255782","https://openalex.org/W2274935188","https://openalex.org/W2546991807"],"abstract_inverted_index":{"Standard":[0],"cache-oblivious":[1,33],"recursive":[2,34],"divide-and-conquer":[3],"algorithms":[4,24,37,50],"for":[5,71],"evaluating":[6],"dynamic":[7],"programming":[8],"recurrences":[9],"have":[10,17,38,44],"optimal":[11],"serial":[12],"cache":[13],"complexity":[14],"but":[15],"often":[16],"lower":[18],"parallelism":[19],"compared":[20],"with":[21,73],"iterative":[22],"wavefront":[23,35],"due":[25],"to":[26],"artificial":[27,46],"dependencies":[28],"among":[29],"subtasks.":[30],"Very":[31],"recently":[32],"(COW)":[36],"been":[39],"introduced":[40],"which":[41],"do":[42,76],"not":[43,77],"any":[45],"dependencies.":[47],"Though":[48],"COW":[49],"are":[51],"based":[52],"on":[53],"fork-join":[54,74],"primitives,":[55],"they":[56],"extensively":[57],"use":[58],"atomic":[59],"operations,":[60],"and":[61],"as":[62],"a":[63],"result,":[64],"performance":[65],"guarantees":[66],"provided":[67],"by":[68],"state-of-the-art":[69],"schedulers":[70],"programs":[72],"primitives":[75],"apply.":[78]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2017-02-03T00:00:00"}