Results 1 - 10 of 1,323

4 Microprocessor Main Memory Cache Memory

by Debdeep Mukhopadhyay , 2009
"... – Access time is less – Power Consumption is less ..."
Abstract - Add to MetaCart
– Access time is less – Power Consumption is less

Cache memories

by Alan Jay Smith - ACM Computing Surveys , 1982
"... Cache memories are used in modern, medium and high-speed CPUs to hold temporarily those portions of the contents of main memory which are {believed to be) currently in use. Since instructions and data in cache memories can usually be referenced in 10 to 25 percent of the time required to access main ..."
Abstract - Cited by 688 (11 self) - Add to MetaCart
Cache memories are used in modern, medium and high-speed CPUs to hold temporarily those portions of the contents of main memory which are {believed to be) currently in use. Since instructions and data in cache memories can usually be referenced in 10 to 25 percent of the time required to access

Cost-Aware WWW Proxy Caching Algorithms

by Pei Cao, Sandy Irani - IN PROCEEDINGS OF THE 1997 USENIX SYMPOSIUM ON INTERNET TECHNOLOGY AND SYSTEMS , 1997
"... Web caches can not only reduce network traffic and downloading latency, but can also affect the distribution of web traffic over the network through costaware caching. This paper introduces GreedyDualSize, which incorporates locality with cost and size concerns in a simple and non-parameterized fash ..."
Abstract - Cited by 540 (6 self) - Add to MetaCart
improve the performance of main-memory caching of Web documents.

Locality-Aware Request Distribution in Cluster-based Network Servers

by Vivek Pai, Mohit Aron, Gaurav Banga, Michael Svendsen, Peter Druschel, Willy Zwaenepoel, Erich Nahum , 1998
"... We consider cluster-based network servers in which a front-end directs incoming requests to one of a number of back-ends. Specifically, we consider content-based request distribution: the front-end uses the content requested, in addition to information about the load on the back-end nodes, to choose ..."
Abstract - Cited by 327 (21 self) - Add to MetaCart
, to choose which back-end will handle this request. Content-based request distribution can improve locality in the back-ends' main memory caches, increase secondary storage scalability by partitioning the server's database, and provide the ability to employ back-end nodes that are specialized

CACHING Registers Cache MainMemory Disk

by Comp /s Week, Cse/unsw Comp /s W P, Cse/unsw Comp /s W P
"... Cache is fast (1–5 cycle access time) memory sitting between fast registers and slow RAM (10–100 cycles access time) ..."
Abstract - Add to MetaCart
Cache is fast (1–5 cycle access time) memory sitting between fast registers and slow RAM (10–100 cycles access time)

Cache-Conscious Index Structures for Main-Memory Databases

by Vilho Raatikka, Vilho Raatikka , 2004
"... access method, cache consciousness, data locality, data structure, main-memory database The recent hardware evolution has widened the speed gap between main memory and the processor. As a consequence, in many cases memory access has become the main bottle-neck even in disk-based databases. The perfo ..."
Abstract - Add to MetaCart
access method, cache consciousness, data locality, data structure, main-memory database The recent hardware evolution has widened the speed gap between main memory and the processor. As a consequence, in many cases memory access has become the main bottle-neck even in disk-based databases

On Null Spaces and their Application to Model Randomisation and Interleaving in Cache Memories

by Hans Vandierendonck, Hans V, Koen De Bosschere, Vakgroep Elektronica , 2002
"... Cache memories bridge the growing access-time gap between the processor and the main memory. Cache memories use randomisation functions for two purposes: (i) to limit the amount of search when looking up an address in the cache and (ii) to interleave the access stream over multiple independent ba ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
Cache memories bridge the growing access-time gap between the processor and the main memory. Cache memories use randomisation functions for two purposes: (i) to limit the amount of search when looking up an address in the cache and (ii) to interleave the access stream over multiple independent

Optimizing main-memory join on modern hardware

by Stefan Manegold, Peter Boncz, Martin Kersten, Ieee Computer Society - IEEE Transactions on Knowledge and Data Eng , 2002
"... AbstractÐIn the past decade, the exponential growth in commodity CPU's speed has far outpaced advances in memory latency. A second trend is that CPU performance advances are not only brought by increased clock rate, but also by increasing parallelism inside the CPU. Current database systems hav ..."
Abstract - Cited by 64 (15 self) - Add to MetaCart
designed to optimize memory access. The performance of this algorithm is quantified using a detailed analytical model that incorporates memory access costs in terms of a limited number of parameters, such as cache sizes and miss penalties. We also present a calibration tool that extracts such parameters

Caching in the Sprite Network File System

by Michael N. Nelson, Brent B. Welch, John K. Ousterhout - ACM Transactions on Computer Systems , 1988
"... The Sprite network operating system uses large main-memory disk block caches to achieve high performance in its file system. It provides non-write-through file caching on both client and server machines. A simple cache consistency mechanism permits files to be shared by multiple clients without dang ..."
Abstract - Cited by 296 (12 self) - Add to MetaCart
The Sprite network operating system uses large main-memory disk block caches to achieve high performance in its file system. It provides non-write-through file caching on both client and server machines. A simple cache consistency mechanism permits files to be shared by multiple clients without

Broadcast Disks: Data Management for Asymmetric Communications Environments

by Swarup Acharya, Rafael Alonso, Michael Franklin, Stanley Zdonik , 1995
"... This paper proposes the use of repetitive broadcast as a way of augmenting the memory hierarchy of clients in an asymmetric communication environment. We describe a new technique called “Broadcast Disks” for structuring the broadcast in a way that provides improved performance for non-uniformly acce ..."
Abstract - Cited by 448 (19 self) - Add to MetaCart
-uniformly accessed data. The Broadcast Disk superimposes multiple disks spinning at different speeds on a single broadcast channel — in effect creating an arbitrarily fine-grained memory hierarchy. In addition to proposing and defining the mechanism, a main result of this work is that exploiting the potential
Results 1 - 10 of 1,323