Sciweavers

204 search results - page 28 / 41
» Deconstructing storage arrays
Sort
View
JOT
2006
121views more  JOT 2006»
13 years 7 months ago
Constructing persistent object-oriented models with standard C++
In this paper, it is suggested an approach and a design pattern for developing object-oriented models that need to be persistent, including the databases of moderate size, with us...
Alexander Kozynchenko
CLUSTER
2000
IEEE
13 years 7 months ago
Dynamic Max-Min fairness in ring networks
Ring networks are enjoying renewed interest as Storage Area Networks (SANs), i.e., networks for interconnecting storage devices (e.g., disk, disk arrays and tape drives) and stora...
Giuseppe Anastasi, Luciano Lenzini, M. La Porta, Y...
SAC
1997
ACM
13 years 11 months ago
The RasDaMan approach to multidimensional database management
Multidimensional discrete data (MDD), i.e., arrays of arbitrary size, dimension, and base type, are receiving growing attention among the database community. MDD occur in a variet...
Peter Baumann, Paula Furtado, Roland Ritsch, Norbe...
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 7 months ago
An approach to RAID-6 based on cyclic groups of a prime order
As the size of data storing arrays of disks grows, it becomes vital to protect data against double disk failures. An economic way of providing such protection consists of adding tw...
R. Jackson, D. Rumynin, O. Zaboronski
TIT
2002
126views more  TIT 2002»
13 years 7 months ago
Two-dimensional interleaving schemes with repetitions: Constructions and bounds
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
Tuvi Etzion, Alexander Vardy