G. A. Alvarez, W. A. Burkhard, L. J. Stockmeyer, and F. Cristian, "Declustered Disk Array Architectures with Optimal and Near-Optimal Parallelism," in Proceedings of the 25th ACM/IEEE International Symposium on Computer Architecture, pp. 109--120 (1998).  Home/Search   Document Details and Download   Summary   Related Articles   Check

....store the entire disk layout in array format and undertake table lookups whenever a block is to be mapped to a disk location. For this reason, recent work has concentrated on properties of designs that make them quick to generate on the fly [142] This problem is addressed by Alvarez et al. [136]. They also examine disk layouts which permit reconstruction from multiple failures. C. J. Colbourn, J. H. Dinitz, D. R. Stinson Mapping data to memory arises elsewhere in connection with designs, for example in the processing of partial match queries (x10) and in the mapping of matrix data to ....

G. A. Alvarez, W. A. Burkhard, L. J. Stockmeyer & F. Cristian, Declustered disk array architectures with optimal and near-optimal parallelism, in Proc. 25th ACM/IEEE Int. Sympos. Computer Architecture, Barcelona, Spain (1998),

....in parallel during reconstruction and recon guration. Prime groups satis es the new goal when the write request begins in the rst disk of the array. It is also near optimal in term of declustering ratio when p is a prime. Prime groups can compliment the layouts proposed by Alvarez et. el. [2] for the criteria to obtain a good layout is quite di erent between Prime groups and those proposed by Alvarez et. el. 2] Keywords: Fault Tolerant, RAID, Declustered RAID, Disk Arrays 1 Introduction Many applications such as on line transaction processing, image processing, and scienti c ....

....begins in the rst disk of the array. It is also near optimal in term of declustering ratio when p is a prime. Prime groups can compliment the layouts proposed by Alvarez et. el. 2] for the criteria to obtain a good layout is quite di erent between Prime groups and those proposed by Alvarez et. el. [2]. Keywords: Fault Tolerant, RAID, Declustered RAID, Disk Arrays 1 Introduction Many applications such as on line transaction processing, image processing, and scienti c computing, require high throughput from cost e ective storage sub This research was supported by the National Sciences and ....

[Article contains additional citation context not shown here]

Guillermo A. Alvarez, Walter A. Burkhard, Larry J. Stockmeyer and Flaviu Cristian, Declustered Disk Array Architectures with Optimal and Near-optimal Parallelism, in Proceedings of the 25th Annual International Symposium on Computer Architecture (ISCA'98), June 1998, pages 109-120.

....Level 5 [11] a stripe contains stripe units on all the disks. If a disk fails, all the other disks must process additional accesses for every read from the failed disk. The surviving disks then carry not only their own load, but also the read load of the failed disk. In a declustered disk array [1, 2, 6, 7, 10], the number of stripe units per stripe is smaller than the total number of disks. Any usable data layout (the assignment of stripe units to stripes) fulfills a number of fairly natural criteria: 1) Each stripe contains the same number k of stripe units. 2) Each disk contains the same number b ....

....disk organized as a linear address space of stripe units, and the actual placement of these stripe units on the various disks in the disk array. PDDL uses almost no storage or calculation to determine its mapping. Recent declustering schemes PRIME of Alvarez, Burkhard, Stockmeyer and Cristian [2] and DATUM of Alvarez, Burkhard, and Cristian [1] also use straightforward, efficient calculation to map stripe units to disks thereby avoiding table lookup. Previous schemes include Parity Declustering of Holland and Gibson [6] which uses table lookup to specify balanced incomplete block design ....

G.A. Alvarez, W.A. Burkhard, L.J. Stockmeyer, F. Cristian: "Declustered Disk Array Architectures with Optimal and Near-Optimal Parallelism", Proceedings of the 25th Annual ACM/IEEE International Symposium on Computer Architecture, pp. 109-120, 1998.

....units of an unavailable disk can be reconstructed via the redundancy of the scheme and stored in the allocated spare space. In a declustered data organization (originally suggested by Muntz and Liu [13] evaluated by Holland and Gibson [9, 10] and more recently improved upon by Alvarez et al.[1, 2], Merchant and Yu [12] Ng and Mattson [14] Reddy and Bannerjee [16] and Schwabe and Sutherland [17] each stripe is mapped to k of the n disks in the array (where k n) to achieve significant performance improvements during both degraded operation and on line disk reconstruction. These ....

....are expected to be evenly distributed. Alvarez, Burkhard and Cristian [1] investigate the DATUM data layout which utilizes the binomial number system (based upon complete block designs) to obtain the mapping; the scheme calculates addresses on demand. Alvarez, Burkhard, Stockmeyer, and Cristian [2] study the PRIME and RELPR layouts which utilize on demand calculation to obtain the mapping. These schemes come very close to meeting the layout goals that we discuss below. Schwabe and Sutherland [17] introduce a slightly relaxed BIBD designs which obtain approximately balanced layouts ....

[Article contains additional citation context not shown here]

G.A. Alvarez, W.A. Burkhard, L.J. Stockmeyer, F. Cristian: "Declustered Disk Array Architectures with Optimal and Near-optimal Parallelism," Proceedings of the 25th Annual ACM/IEEE International Symposium on Computer Architecture, June 1998.

....BIBD [11] to transaction processing with workload characteristics vastly different from those of video streams. This includes the work of Holland and Gibson [14] Ng and Mattson [18] Reddy, Chandy and Banerjee [22] Alvarez, Burkhard and Cristian [1] Alvarez, Burkhard, Stockmeyer, and Cristian [2] as well as Schwarz, Steinberg, and Burkhard [25] Disk array declustering for video servers based on BIBD has been considered by Cohen [9] and independently by Ozden, Rastogi, Shenoy and Silberschatz [20] The very recent overlay striping data layout of Triantafillou and Faloutsos [27] maintains ....

Alvarez, G.A., W.A. Burkhard, L.J. Stockmeyer, and F. Cristian, Declustered Disk Array Architectures with Optimal and Near-optimal Parallelism. Proceedings of the 25th Annual International Symposium on Computer Architecture, pp. 109-120, 1998.

....and RAID 5 [20] where a single parity block protects the data in a stripe from disk drive failures. RAID 1 0 provides greater read performance and failure tolerance but requires almost twice as many disk drives to do so. Much prior work has studied the properties of different RAID levels (e.g. [2, 6, 20, 11]) Disk arrays organize their data storage into Logical Units,orLUs, which appear as linear block spaces to their clients. A small disk array, with a few disks, might support up to 8 LUs; a large one, with hundreds of disk drives, can support thousands. Each LU typically has a given RAID ....

....cases, e.g. if a workload contains mostly small writes, use RAID 1 0 instead of RAID 5 . No attempt is made to resolve contradictory recommendations from different rules, or to determine threshold values for essential definitions like small write or write mostly . Simulation based studies [2, 14, 17] quantify the relative strengths of different RAID levels (including some not mentioned in this paper) but do not derive general guidelines for choosing a RAID level for given access patterns. The HP AutoRAID disk array [24] side steps the issue by dynamically, and transparently, migrating data ....

G. A. Alvarez, W. Burkhard, L. Stockmeyer, and F. Cristian. Declustered disk array architectures with optimal and near-optimal parallelism. In Proceedings of International Symposium on Computer Architecture (ISCA), pages 109--20, June 1998.

No context found.

G. A. Alvarez, W. A. Burkhard, L. J. Stockmeyer, and F. Cristian, "Declustered Disk Array Architectures with Optimal and Near-Optimal Parallelism," in Proceedings of the 25th ACM/IEEE International Symposium on Computer Architecture, pp. 109--120 (1998).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC