{"id":"https://openalex.org/W2623757091","doi":"https://doi.org/10.1145/3075564.3075571","title":"Optimal On-Line Computation of Stack Distances for MIN and OPT","display_name":"Optimal On-Line Computation of Stack Distances for MIN and OPT","publication_year":2017,"publication_date":"2017-05-15","ids":{"openalex":"https://openalex.org/W2623757091","doi":"https://doi.org/10.1145/3075564.3075571","mag":"2623757091"},"language":"en","primary_location":{"id":"doi:10.1145/3075564.3075571","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3075564.3075571","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Computing Frontiers Conference","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/A5087688453","display_name":"Gianfranco Bilardi","orcid":"https://orcid.org/0000-0003-0303-8349"},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Gianfranco Bilardi","raw_affiliation_strings":["Department of Information Engineering, University of Padova, Padova, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Engineering, University of Padova, Padova, Italy","institution_ids":["https://openalex.org/I138689650"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064949703","display_name":"Kattamuri Ekanadham","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kattamuri Ekanadham","raw_affiliation_strings":["IBM T.J.Watson Research Center, Yortktown, Heights, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM T.J.Watson Research Center, Yortktown, Heights, NY, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033773138","display_name":"Pratap Pattnaik","orcid":"https://orcid.org/0000-0002-0629-0024"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pratap Pattnaik","raw_affiliation_strings":["IBM T.J.Watson Research Center, Yortktown, Heights, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM T.J.Watson Research Center, Yortktown, Heights, NY, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"237","last_page":"246"},"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/T11181","display_name":"Advanced Data Storage Technologies","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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9979000091552734,"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.7513458728790283},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.6972140669822693},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.6874601244926453},{"id":"https://openalex.org/keywords/stack","display_name":"Stack (abstract data type)","score":0.6608671545982361},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6599801778793335},{"id":"https://openalex.org/keywords/memory-hierarchy","display_name":"Memory hierarchy","score":0.6519067287445068},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.6483147740364075},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6466172933578491},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.6414089798927307},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.5541988015174866},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.5342478156089783},{"id":"https://openalex.org/keywords/access-time","display_name":"Access time","score":0.4752509295940399},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3271441161632538},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.291908860206604},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19458070397377014},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.18969884514808655}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7513458728790283},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6972140669822693},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.6874601244926453},{"id":"https://openalex.org/C9395851","wikidata":"https://www.wikidata.org/wiki/Q177929","display_name":"Stack (abstract data type)","level":2,"score":0.6608671545982361},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6599801778793335},{"id":"https://openalex.org/C2778100165","wikidata":"https://www.wikidata.org/wiki/Q1589327","display_name":"Memory hierarchy","level":3,"score":0.6519067287445068},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.6483147740364075},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6466172933578491},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.6414089798927307},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.5541988015174866},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.5342478156089783},{"id":"https://openalex.org/C194080101","wikidata":"https://www.wikidata.org/wiki/Q46306","display_name":"Access time","level":2,"score":0.4752509295940399},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3271441161632538},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.291908860206604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19458070397377014},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.18969884514808655},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3075564.3075571","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3075564.3075571","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Computing Frontiers Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:www.research.unipd.it:11577/3240408","is_oa":false,"landing_page_url":"http://hdl.handle.net/11577/3240408","pdf_url":null,"source":{"id":"https://openalex.org/S4377196283","display_name":"Research Padua  Archive (University of Padua)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W122763488","https://openalex.org/W1031864535","https://openalex.org/W1492601037","https://openalex.org/W1494930385","https://openalex.org/W1500117749","https://openalex.org/W1505903572","https://openalex.org/W1507039213","https://openalex.org/W1540774993","https://openalex.org/W1552828154","https://openalex.org/W1555915743","https://openalex.org/W1564514837","https://openalex.org/W1584049700","https://openalex.org/W1655990431","https://openalex.org/W1963831729","https://openalex.org/W1974872983","https://openalex.org/W1976316975","https://openalex.org/W1982088146","https://openalex.org/W1985049706","https://openalex.org/W1987225815","https://openalex.org/W2003004068","https://openalex.org/W2004690278","https://openalex.org/W2006355640","https://openalex.org/W2011717090","https://openalex.org/W2023845683","https://openalex.org/W2040342412","https://openalex.org/W2041645394","https://openalex.org/W2059985428","https://openalex.org/W2060983019","https://openalex.org/W2063243181","https://openalex.org/W2064910003","https://openalex.org/W2067242943","https://openalex.org/W2084423058","https://openalex.org/W2096889280","https://openalex.org/W2112482891","https://openalex.org/W2121243500","https://openalex.org/W2136277034","https://openalex.org/W2164705534","https://openalex.org/W2496363571","https://openalex.org/W2751601659","https://openalex.org/W2920901117","https://openalex.org/W3110546893","https://openalex.org/W4251280768"],"related_works":["https://openalex.org/W2147122795","https://openalex.org/W2061075966","https://openalex.org/W3147501184","https://openalex.org/W2167303720","https://openalex.org/W2268996566","https://openalex.org/W2109715593","https://openalex.org/W3161817247","https://openalex.org/W2012518269","https://openalex.org/W1863436361","https://openalex.org/W2068309140"],"abstract_inverted_index":{"The":[0,15,98],"replacement":[1],"policies":[2,23],"known":[3,83],"as":[4],"MIN":[5],"and":[6,62,68],"OPT":[7],"are":[8],"optimal":[9],"for":[10,21,49,84],"a":[11,38,47,55],"two-level":[12],"memory":[13],"hierarchy.":[14],"computation":[16],"of":[17,28,37,46,59,92],"the":[18,25,29,34,43,73,90,96],"cache":[19,48],"content":[20],"these":[22],"requires":[24],"off-line":[26,99],"knowledge":[27],"entire":[30],"address":[31],"trace.":[32,97],"However,":[33],"stack":[35,74],"distance":[36,75],"given":[39],"access,":[40],"that":[41,51],"is,":[42],"smallest":[44],"capacity":[45],"which":[50],"access":[52,80],"results":[53],"in":[54,76],"hit,":[56],"is":[57],"independent":[58],"future":[60],"accesses":[61],"can":[63],"be":[64],"computed":[65],"on-line.":[66],"Off-line":[67],"on-line":[69],"algorithms":[70],"to":[71,105],"compute":[72],"time":[77,100],"O(V)":[78],"per":[79],"have":[81],"been":[82],"several":[85],"decades,":[86],"where":[87],"V":[88],"denotes":[89],"number":[91],"distinct":[93],"addresses":[94],"within":[95],"bound":[101],"was":[102],"recently":[103],"improved":[104],"O(\u221aV":[106],"log":[107],"V).":[108]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}