✦ LIBER ✦

Destage algorithms for disk arrays with nonvolatile caches

✍ Scribed by Varma, A.; Jacobson, Q.

Book ID: 119772812
Publisher: IEEE
Year: 1998
Tongue: English
Weight: 156 KB
Volume: 47
Category: Article
ISSN: 0018-9340
DOI: 10.1109/12.663770

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hybrid nonvolatile disk cache for energy

Hybrid nonvolatile disk cache for energy-efficient and high-performance systems

✍ Shi, Liang; Li, Jianhua; Jason Xue, Chun; Zhou, Xuehai 📂 Article 📅 2012 🏛 Association for Computing Machinery 🌐 English ⚖ 673 KB

Strongly competitive algorithms for cach

Strongly competitive algorithms for caching with pipelined prefetching

✍ Alexander Gaysinsky; Alon Itai; Hadas Shachnai 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 215 KB

Hierarchical caching and prefetching for

Hierarchical caching and prefetching for continuous media servers with smart disks

✍ Harizopoulos, S.; Harizakis, C.; Triantafillou, P. 📂 Article 📅 2000 🏛 IEEE Computer Society 🌐 English ⚖ 210 KB

HARDWARE IMPLEMENTATION OF FUZZY REPLACE

HARDWARE IMPLEMENTATION OF FUZZY REPLACEMENT ALGORITHM FOR CACHE MEMORIES USING FIELD-PROGRAMMABLE GATE ARRAYS

✍ HOSSAIN, ASHFAQ; MANZOUL, MAHMOUD A. 📂 Article 📅 1993 🏛 Taylor and Francis Group 🌐 English ⚖ 271 KB

Modified Subspace Algorithms for DoA Est

Modified Subspace Algorithms for DoA Estimation With Large Arrays

✍ Mestre, X.; Lagunas, M.A. 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 844 KB

Designing Lower-Dimensional Regular Arra

Designing Lower-Dimensional Regular Arrays for Algorithms with Uniform Dependencies

✍ Jong-Chuang Tsay; Pen-Yuang Chang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 360 KB

In this paper, we will propose a polynomial-time method to design m-dimensional regular arrays for n (n Ն m ؉ 1) dimensional algorithms with uniform dependencies, regular algorithms. The proposed method has two steps: the first one is to transform an independently partitioned regular algorithm to a