{"id":"https://openalex.org/W2115766048","doi":"https://doi.org/10.1145/1007912.1007950","title":"Online algorithms for prefetching and caching on parallel disks","display_name":"Online algorithms for prefetching and caching on parallel disks","publication_year":2004,"publication_date":"2004-06-27","ids":{"openalex":"https://openalex.org/W2115766048","doi":"https://doi.org/10.1145/1007912.1007950","mag":"2115766048"},"language":"en","primary_location":{"id":"doi:10.1145/1007912.1007950","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007912.1007950","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the sixteenth annual 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/A5105778361","display_name":"Rahul Shah","orcid":"https://orcid.org/0000-0002-0605-5681"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rahul Shah","raw_affiliation_strings":["Purdue University, West Lafayette, IN"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purdue University, West Lafayette, IN","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081334414","display_name":"Peter Varman","orcid":"https://orcid.org/0000-0001-6887-1644"},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peter J. Varman","raw_affiliation_strings":["Rice University, Houston, TX","Rice University (Houston, TX)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rice University, Houston, TX","institution_ids":["https://openalex.org/I74775410"]},{"raw_affiliation_string":"Rice University (Houston, TX)","institution_ids":["https://openalex.org/I74775410"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003340402","display_name":"Jeffrey Scott Vitter","orcid":"https://orcid.org/0000-0001-7970-6118"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeffrey Scott Vitter","raw_affiliation_strings":["Purdue University, West Lafayette, IN"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Purdue University, West Lafayette, IN","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1258,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.79675304,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"255","last_page":"264"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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/T11478","display_name":"Caching and Content Delivery","score":0.9970999956130981,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9954000115394592,"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/competitive-analysis","display_name":"Competitive analysis","score":0.8443195223808289},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.824195146560669},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.707165002822876},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.597338855266571},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.594814658164978},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5832972526550293},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5454230904579163},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5312941670417786},{"id":"https://openalex.org/keywords/parallel-i/o","display_name":"Parallel I/O","score":0.45407190918922424},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.41541406512260437},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12362489104270935},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12122151255607605}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8443195223808289},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.824195146560669},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.707165002822876},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.597338855266571},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.594814658164978},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5832972526550293},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5454230904579163},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5312941670417786},{"id":"https://openalex.org/C2781057727","wikidata":"https://www.wikidata.org/wiki/Q9941","display_name":"Parallel I/O","level":2,"score":0.45407190918922424},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.41541406512260437},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12362489104270935},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12122151255607605},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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":2,"locations":[{"id":"doi:10.1145/1007912.1007950","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007912.1007950","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.65.632","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.65.632","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.rice.edu/~pjv/spaa04.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1523918800","https://openalex.org/W1552828154","https://openalex.org/W1821619834","https://openalex.org/W1983866001","https://openalex.org/W1987225815","https://openalex.org/W1993634181","https://openalex.org/W2011670396","https://openalex.org/W2014085448","https://openalex.org/W2041645394","https://openalex.org/W2042961349","https://openalex.org/W2046441184","https://openalex.org/W2046781183","https://openalex.org/W2053035562","https://openalex.org/W2054033098","https://openalex.org/W2074919500","https://openalex.org/W2083392624","https://openalex.org/W2121033525","https://openalex.org/W2124831576","https://openalex.org/W2130167838","https://openalex.org/W2138037408","https://openalex.org/W2141704963","https://openalex.org/W2504389667","https://openalex.org/W4248953486"],"related_works":["https://openalex.org/W4299302777","https://openalex.org/W2777812223","https://openalex.org/W2092227404","https://openalex.org/W1493790977","https://openalex.org/W1580966357","https://openalex.org/W2073006754","https://openalex.org/W2047204419","https://openalex.org/W2169102169","https://openalex.org/W2095572269","https://openalex.org/W2951962248"],"abstract_inverted_index":{"Parallel":[0],"disks":[1],"provide":[2],"a":[3,77,131,142,229,246],"cost":[4],"effective":[5,101,122],"way":[6],"of":[7,18,48,66,169,175,184,225,233],"speeding":[8],"up":[9],"I/Os":[10],"in":[11,36,117,187,206],"applications":[12],"that":[13,212],"work":[14],"with":[15],"large":[16],"amounts":[17],"data.":[19],"The":[20,191],"main":[21,128],"challenge":[22],"is":[23,72,76,130,166,172,181,199,218],"to":[24,33,92,98,220,249],"achieve":[25],"as":[26,29,104],"much":[27],"parallelism":[28],"possible,":[30],"using":[31],"prefetching":[32,74],"avoid":[34],"bottlenecks":[35],"disk":[37,51,161,248,252],"access.":[38],"Efficient":[39],"algorithms":[40,109],"have":[41,89,110,221],"been":[42,111],"developed":[43],"for":[44,80,114,154,201],"some":[45],"particular":[46],"patterns":[47],"accessing":[49],"the":[50,62,70,85,93,115,118,155,159,167,173,182,188,196,214,223,226,241,250],"blocks.":[52],"In":[53],"this":[54],"paper,":[55],"we":[56,96],"consider":[57],"general":[58],"request":[59,63,82,189],"sequences.":[60,83],"When":[61,84],"sequence":[64,87],"consists":[65],"unique":[67],"block":[68],"requests,":[69],"problem":[71,79,157,239,244],"called":[73],"and":[75,141,179],"well-solved":[78],"arbitrary":[81],"reference":[86],"can":[88,235],"repeated":[90],"references":[91],"same":[94],"block,":[95],"need":[97],"devise":[99],"an":[100],"caching":[102],"policy":[103],"well.":[105],"While":[106],"optimum":[107],"offline":[108,227],"recently":[112],"designed":[113],"problem,":[116],"online":[119,133,144,216],"case,":[120],"no":[121],"algorithm":[123,134,145,217],"was":[124],"previously":[125],"known.":[126],"Our":[127],"contribution":[129],"deterministic":[132,215],"threshold-LRU":[135],"which":[136,147],"achieves":[137,148],"O((MD/L)2/3)":[138],"competitive":[139,152,197,231],"ratio":[140,153,198,232],"randomized":[143],"threshold-MARK":[146],"O(\u221a(MD/L)":[149],"log":[150],"(MD/L))":[151],"caching/prefetching":[156],"on":[158,195,245],"parallel":[160,251],"model":[162],"(PDM),":[163],"where":[164],"D":[165],"number":[168],"disks,":[170],"M":[171,205],"size":[174],"fast":[176],"memory":[177,224],"buffer,":[178],"M+L":[180],"amount":[183],"lookahead":[185,202],"available":[186],"sequence.":[190],"best-known":[192],"lower":[193],"bound":[194],"\u03a9(\u227eMD/L)":[200],"L":[203],"\u2265":[204],"both":[207],"models.":[208],"We":[209],"also":[210],"show":[211],"if":[213],"allowed":[219],"twice":[222],"then":[228],"tight":[230],"\u0398(\u227eMD/L)":[234],"be":[236],"achieved.":[237],"This":[238],"generalizes":[240],"well-known":[242],"paging":[243],"single":[247],"model.":[253]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}