{"id":"https://openalex.org/W2085445007","doi":"https://doi.org/10.1109/tc.1985.5009413","title":"Some Aspects of the Dynamic Behavior of Hierarchical Memories","display_name":"Some Aspects of the Dynamic Behavior of Hierarchical Memories","publication_year":1985,"publication_date":"1985-06-01","ids":{"openalex":"https://openalex.org/W2085445007","doi":"https://doi.org/10.1109/tc.1985.5009413","mag":"2085445007"},"language":"en","primary_location":{"id":"doi:10.1109/tc.1985.5009413","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1985.5009413","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","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/A5108377482","display_name":"Peter Fenwick","orcid":null},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ"],"is_corresponding":true,"raw_author_name":"Peter M. Fenwick","raw_affiliation_strings":["Department of Computer Science, University of Auckland, Auckland, New Zealand","Dept. of Computer Science, University of Auckland Auckland, New Zealand"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Auckland, Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]},{"raw_affiliation_string":"Dept. of Computer Science, University of Auckland Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5108377482"],"corresponding_institution_ids":["https://openalex.org/I154130895"],"apc_list":null,"apc_paid":null,"fwci":1.021,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.81176471,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"C-34","issue":"6","first_page":"570","last_page":"573"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":1.0,"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":1.0,"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.996999979019165,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9965000152587891,"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.8169748783111572},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.6977342367172241},{"id":"https://openalex.org/keywords/cache-only-memory-architecture","display_name":"Cache-only memory architecture","score":0.6347095966339111},{"id":"https://openalex.org/keywords/cache-coloring","display_name":"Cache coloring","score":0.6018552184104919},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.596611738204956},{"id":"https://openalex.org/keywords/cache-pollution","display_name":"Cache pollution","score":0.5594776272773743},{"id":"https://openalex.org/keywords/memory-hierarchy","display_name":"Memory hierarchy","score":0.5583265423774719},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.5158959627151489},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.44632619619369507},{"id":"https://openalex.org/keywords/cache-invalidation","display_name":"Cache invalidation","score":0.42249464988708496},{"id":"https://openalex.org/keywords/memory-map","display_name":"Memory map","score":0.41773465275764465},{"id":"https://openalex.org/keywords/non-uniform-memory-access","display_name":"Non-uniform memory access","score":0.4138239026069641},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.2355436086654663}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8169748783111572},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6977342367172241},{"id":"https://openalex.org/C3720319","wikidata":"https://www.wikidata.org/wiki/Q5015937","display_name":"Cache-only memory architecture","level":5,"score":0.6347095966339111},{"id":"https://openalex.org/C201148951","wikidata":"https://www.wikidata.org/wiki/Q5015976","display_name":"Cache coloring","level":4,"score":0.6018552184104919},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.596611738204956},{"id":"https://openalex.org/C113166858","wikidata":"https://www.wikidata.org/wiki/Q5015981","display_name":"Cache pollution","level":5,"score":0.5594776272773743},{"id":"https://openalex.org/C2778100165","wikidata":"https://www.wikidata.org/wiki/Q1589327","display_name":"Memory hierarchy","level":3,"score":0.5583265423774719},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.5158959627151489},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.44632619619369507},{"id":"https://openalex.org/C25536678","wikidata":"https://www.wikidata.org/wiki/Q5015977","display_name":"Cache invalidation","level":5,"score":0.42249464988708496},{"id":"https://openalex.org/C74426580","wikidata":"https://www.wikidata.org/wiki/Q719484","display_name":"Memory map","level":3,"score":0.41773465275764465},{"id":"https://openalex.org/C133371097","wikidata":"https://www.wikidata.org/wiki/Q868014","display_name":"Non-uniform memory access","level":5,"score":0.4138239026069641},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.2355436086654663}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.1985.5009413","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1985.5009413","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.6800000071525574}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320801","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1986209913","https://openalex.org/W2023090668","https://openalex.org/W2075183163","https://openalex.org/W2086364491","https://openalex.org/W2117625644","https://openalex.org/W2124477009"],"related_works":["https://openalex.org/W2121191383","https://openalex.org/W3216288082","https://openalex.org/W2976775806","https://openalex.org/W2147511796","https://openalex.org/W4255807648","https://openalex.org/W2033486618","https://openalex.org/W2066160958","https://openalex.org/W2115782696","https://openalex.org/W2074326206","https://openalex.org/W2159120180"],"abstract_inverted_index":{"In":[0],"a":[1,5,14,19,37,52],"computer":[2],"system":[3],"with":[4],"cache":[6,9,29],"memory,":[7,72],"the":[8,28,45,79],"is":[10],"effectively":[11],"empty":[12],"following":[13],"job":[15,38],"switch,":[16],"leading":[17],"to":[18],"low":[20],"hit":[21],"rate":[22],"and":[23],"consequently":[24],"lowered":[25],"performance":[26,47],"until":[27],"becomes":[30],"reasonably":[31],"full.":[32],"The":[33],"analysis":[34],"shows":[35],"that":[36,49],"must":[39],"run":[40],"for":[41],"several":[42],"milliseconds":[43],"before":[44],"average":[46],"approaches":[48],"expected":[50],"from":[51,70],"steady-state":[53],"analysis.":[54],"Care":[55],"may":[56],"therefore":[57],"be":[58],"needed":[59],"in":[60,78],"designing":[61],"memory":[62,80],"systems":[63],"which":[64,74],"have":[65],"very":[66],"high":[67],"page-fault":[68],"rates":[69],"main":[71],"or":[73],"include":[75],"many":[76],"levels":[77],"hierarchy.":[81]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}