Specific read only data management for memory hierarchy optimization
نویسندگان
چکیده
منابع مشابه
Holographic read-only memory
We describe the three-dimensional holographic optical disc system for application as read-only memory. Several systems design issues are discussed including imaging optics, storage density, readout rate, and the alignment servo system. We demonstrate 40 bits=lm surface density and pixel-matched holographic data readout from a 12 cm disc spinning at 600 RPM.
متن کاملAutomatic Data Layout with Read-Only Replication and Memory Constraints
Besides the algorithm selection, the data layout choice is the key intellectual step in writing an eecient HPF program. Although nding an eecient data layout fully automatically may not be possible in all cases, HPF users will need support during the diicult data layout selection process. In particular, this support is necessary if the user is not familiar with the characteristics of the target...
متن کاملMemory Hierarchy Management for Iterative Graph Structures
The increasing gap in processor and memory speeds has forced microprocessors to rely on deep cache hierarchies to keep the processors from starving for data. For many applications, this results in a wide disparity between sustained and peak achievable speed. Applications need to be tuned to processor and memory system architectures for cache locality, memory layout and data prefetch and reuse. ...
متن کاملExplicit Management of Memory Hierarchy
All scalable parallel computers feature a memory hierarchy, in which some locations are “closer” to a particular processor than others. The hardware in a particular system may support a shared memory or message passing programming model, but these factors effect only the relative costs of local and remote accesses, not the system’s fundamental Non-Uniform Memory Access (NUMA) characteristics. Y...
متن کاملPriority Queues and Sorting for Read-Only Data
We revisit the random-access-machine model in which the input is given on a read-only random-access media, the output is to be produced to a write-only sequential-access media, and in addition there is a limited random-access workspace. The length of the input is N elements, the length of the output is limited by the computation itself, and the capacity of the workspace is O(S + w) bits, where ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGBED Review
سال: 2015
ISSN: 1551-3688
DOI: 10.1145/2724942.2724951