{"id":"https://openalex.org/W2738446583","doi":"https://doi.org/10.1145/3087556.3087572","title":"Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers","display_name":"Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers","publication_year":2017,"publication_date":"2017-07-20","ids":{"openalex":"https://openalex.org/W2738446583","doi":"https://doi.org/10.1145/3087556.3087572","mag":"2738446583"},"language":"en","primary_location":{"id":"doi:10.1145/3087556.3087572","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087556.3087572","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":"conference-paper","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/A5042866153","display_name":"Richard Cole","orcid":"https://orcid.org/0000-0002-5885-0222"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard Cole","raw_affiliation_strings":["New York University, New York, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"New York University, New York, NY, USA","institution_ids":["https://openalex.org/I57206974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101698836","display_name":"Vijaya Ramachandran","orcid":"https://orcid.org/0000-0001-7561-5235"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vijaya Ramachandran","raw_affiliation_strings":["University of Texas at Austin, Austin, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Texas at Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"351","last_page":"362"},"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.9997000098228455,"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.9997000098228455,"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/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9991000294685364,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8359746336936951},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7893359661102295},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.780084490776062},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.6567965149879456},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.581206738948822},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.5416697859764099},{"id":"https://openalex.org/keywords/smart-cache","display_name":"Smart Cache","score":0.5232200622558594},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.496615469455719},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.49436235427856445},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.4558817148208618},{"id":"https://openalex.org/keywords/cache-invalidation","display_name":"Cache invalidation","score":0.42915087938308716},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.42038673162460327},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.25986286997795105},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19714614748954773},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09119325876235962},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.08430257439613342},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.06264272332191467}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8359746336936951},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7893359661102295},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.780084490776062},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.6567965149879456},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.581206738948822},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.5416697859764099},{"id":"https://openalex.org/C167713795","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"Smart Cache","level":5,"score":0.5232200622558594},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.496615469455719},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.49436235427856445},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4558817148208618},{"id":"https://openalex.org/C25536678","wikidata":"https://www.wikidata.org/wiki/Q5015977","display_name":"Cache invalidation","level":5,"score":0.42915087938308716},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.42038673162460327},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.25986286997795105},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19714614748954773},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09119325876235962},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.08430257439613342},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.06264272332191467},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3087556.3087572","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087556.3087572","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/G948724424","display_name":null,"funder_award_id":"CCF-1217989, CCF-1320675, CCF-1527568","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1507039213","https://openalex.org/W1546793677","https://openalex.org/W1604598591","https://openalex.org/W1745592534","https://openalex.org/W1965081941","https://openalex.org/W1995873479","https://openalex.org/W2016559894","https://openalex.org/W2020022171","https://openalex.org/W2026842524","https://openalex.org/W2028637981","https://openalex.org/W2052196304","https://openalex.org/W2062959712","https://openalex.org/W2089064856","https://openalex.org/W2131296084","https://openalex.org/W2136066447","https://openalex.org/W2144031643","https://openalex.org/W2148290033","https://openalex.org/W2152971387","https://openalex.org/W2154995125","https://openalex.org/W2314666169","https://openalex.org/W2605605369","https://openalex.org/W2711285122","https://openalex.org/W2738446583"],"related_works":["https://openalex.org/W2363769136","https://openalex.org/W2114386333","https://openalex.org/W2734782074","https://openalex.org/W2133489088","https://openalex.org/W2031173804","https://openalex.org/W3085471909","https://openalex.org/W2109715593","https://openalex.org/W2086718556","https://openalex.org/W57688818","https://openalex.org/W1965891727"],"abstract_inverted_index":{"We":[0,18],"analyze":[1],"the":[2,26,34,43,49,58],"caching":[3,31,51],"overhead":[4],"incurred":[5],"by":[6,14],"a":[7],"class":[8],"of":[9,45],"multithreaded":[10],"algorithms":[11],"when":[12],"scheduled":[13],"an":[15],"arbitrary":[16],"scheduler.":[17],"obtain":[19],"bounds":[20],"that":[21],"match":[22],"or":[23],"improve":[24],"upon":[25],"well-known":[27],"O(Q+S":[28],"\u00b7":[29],"(M/B))":[30],"cost":[32],"for":[33],"randomized":[35],"work":[36],"stealing":[37],"(RWS)":[38],"scheduler,":[39],"where":[40],"S":[41],"is":[42,48],"number":[44],"steals,":[46],"Q":[47],"sequential":[50],"cost,":[52],"and":[53,55,61],"M":[54],"B":[56],"are":[57],"cache":[59,64],"size":[60,66],"block":[62],"(or":[63],"line)":[65],"respectively.":[67]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}