Sciweavers

204 search results - page 12 / 41
» Deconstructing storage arrays
Sort
View
ICPADS
1998
IEEE
15 years 8 months ago
Probability Based Replacement Algorithm for WWW Server Arrays
This paper describes a scalable Web server array architecture which uses a caching policy called Probability Based Replacement (PBR) algorithm [5, 6]. The server array consists of...
K. H. Yeung, K. W. Suen
CW
2002
IEEE
15 years 8 months ago
Efficient Data Compression Methods for Multi-Dimensional Sparse Array Operations
For sparse array operations, in general, the sparse arrays are compressed by some data compression schemes in order to obtain better performance. The Compressed Row/Column Storage...
Chun-Yuan Lin, Yeh-Ching Chung, Jen-Shiuh Liu
ISCIS
2003
Springer
15 years 9 months ago
An Alternative Compressed Storage Format for Sparse Matrices
The handling of the sparse matrix vector product(SMVP) is a common kernel in many scientific applications. This kernel is an irregular problem, which has led to the development of...
Anand Ekambaram, Eurípides Montagne
162
Voted
CASES
2008
ACM
15 years 5 months ago
Power management of MEMS-based storage devices for mobile systems
Because of its small form factor, high capacity, and expected low cost, MEMS-based storage is a suitable storage technology for mobile systems. MEMS-based storage devices should a...
Mohammed G. Khatib, Pieter H. Hartel
140
Voted
MSS
2007
IEEE
82views Hardware» more  MSS 2007»
15 years 10 months ago
Tornado Codes for MAID Archival Storage
This paper examines the application of Tornado Codes, a class of low density parity check (LDPC) erasure codes, to archival storage systems based on massive arrays of idle disks (...
Matthew Woitaszek, Henry M. Tufo