{"id":"https://openalex.org/W2026074395","doi":"https://doi.org/10.1137/0203002","title":"Stack Replacement Algorithms for Two-Level Directly Addressable Paged Memories","display_name":"Stack Replacement Algorithms for Two-Level Directly Addressable Paged Memories","publication_year":1974,"publication_date":"1974-03-01","ids":{"openalex":"https://openalex.org/W2026074395","doi":"https://doi.org/10.1137/0203002","mag":"2026074395"},"language":"en","primary_location":{"id":"doi:10.1137/0203002","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0203002","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","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/A5113699788","display_name":"Richard R. Muntz","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"R. R. Muntz","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5070117776","display_name":"H. Opderbeck","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"H. Opderbeck","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113699788"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5986,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.62944162,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":"1","first_page":"11","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9958999752998352,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9958999752998352,"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/T11478","display_name":"Caching and Content Delivery","score":0.9883000254631042,"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.9581000208854675,"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.725092351436615},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6287943124771118},{"id":"https://openalex.org/keywords/stack","display_name":"Stack (abstract data type)","score":0.6051509380340576},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.486568808555603},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3630245625972748},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35326671600341797}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.725092351436615},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6287943124771118},{"id":"https://openalex.org/C9395851","wikidata":"https://www.wikidata.org/wiki/Q177929","display_name":"Stack (abstract data type)","level":2,"score":0.6051509380340576},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.486568808555603},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3630245625972748},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35326671600341797}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0203002","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0203002","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W2164705534"],"related_works":["https://openalex.org/W2380576232","https://openalex.org/W2937054111","https://openalex.org/W2066223521","https://openalex.org/W2013178899","https://openalex.org/W373327546","https://openalex.org/W2321534397","https://openalex.org/W2051487156","https://openalex.org/W2058958858","https://openalex.org/W2073681303","https://openalex.org/W2148243540"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"consider":[4],"the":[5,8,26,40,66,71,77,86,122],"application":[6],"of":[7,43,53,68,74,79,104,124],"stack":[9,87,109,125],"algorithm":[10,57,88],"concept":[11,89],"to":[12,48,70,94,96],"a":[13,46,54,60],"two-level":[14,97],"paged":[15],"storage":[16,61],"hierarchy":[17,62],"in":[18,39,58],"which":[19],"both":[20,30],"levels":[21,31],"are":[22,32],"directly":[23,33,98],"addressable":[24,99],"by":[25,65],"central":[27],"processor.":[28],"Since":[29],"addressable,":[34],"pages":[35],"need":[36],"not":[37],"reside":[38],"first":[41,72],"level":[42,73],"memory":[44,75,100],"for":[45,118],"reference":[47],"be":[49,92],"completed.":[50],"The":[51],"effectiveness":[52],"page":[55,80,105],"replacement":[56,106,110,126],"such":[59],"is":[63,83,112],"measured":[64],"frequency":[67],"references":[69],"and":[76],"number":[78],"promotions.":[81],"It":[82],"shown":[84],"that":[85],"can":[90],"easily":[91],"extended":[93],"apply":[95],"hierarchies.":[101],"A":[102],"class":[103],"algorithms":[107,111],"called":[108],"defined.":[113],"An":[114],"efficient":[115],"procedure":[116],"exists":[117],"collecting":[119],"data":[120],"on":[121],"performance":[123],"algorithms.":[127]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}