| Paper Abstract and Keywords |
| Presentation |
2004-12-10 16:00
Constructions of Cluttered Orderings for the Complete Bipartite Graph to speed up RAID
Tomoko Adachi (Toho Univ.) |
| Abstract |
(in Japanese) |
(See Japanese page) |
| (in English) |
The desire to speed up secondary storage systems has lead to the development of redundant arrays of independent disks (RAID) which incorporate redundancy utilizing erasure codes. To minimize the access cost in RAID, Cohen, Colbourn and Froncek (2001) introduced (d, f)-cluttered orderings of various set system for positive integers d, f. In case of a graph this amounts to an ordering of the edge set such that the number of points contained in any d consecutive edges is bounded by the number f. For the complete graph, Cohen et al. gave some cyclic constructions of cluttered orderings based on wrapped ρ-labellings. Mueller, Adachi and Jimbo (2004) investigated cluttered orderings for the complete bipartite graph. RAID utilizing two-dimensional parity code can be modeled by the complete bipartite graph. Mueller et al. adapted the concept of wrapped Δ-labellings to the bipartite case instead of wrapped ρ-labellings, and gave the explicit construction of several infinite families of wrapped Δ-labellings. Here, we investigate constructions of more generalized infinite families of wrapped Δ-labellings leading to cluttered orderings for the corresponding bipartite graphs. In this paper, we will give constructions of wrapped Δ-labellings for such cases. |
| Keyword |
(in Japanese) |
(See Japanese page) |
| (in English) |
RIAD / Cluttered Ordering / Complete Bipartite Graph / Mathematical Modeling / / / / |
| Reference Info. |
IEICE Tech. Rep., vol. 104, no. 501, COMP2004-59, pp. 37-44, Dec. 2004. |
| Paper # |
COMP2004-59 |
| Date of Issue |
2004-12-03 (COMP) |
| ISSN |
Print edition: ISSN 0913-5685 |
| Download PDF |
|
| Conference Information |
| Committee |
COMP |
| Conference Date |
2004-12-10 - 2004-12-10 |
| Place (in Japanese) |
(See Japanese page) |
| Place (in English) |
Toho University |
| Topics (in Japanese) |
(See Japanese page) |
| Topics (in English) |
|
| Paper Information |
| Registration To |
COMP |
| Conference Code |
2004-12-COMP |
| Language |
Japanese |
| Title (in Japanese) |
(See Japanese page) |
| Sub Title (in Japanese) |
(See Japanese page) |
| Title (in English) |
Constructions of Cluttered Orderings for the Complete Bipartite Graph to speed up RAID |
| Sub Title (in English) |
|
| Keyword(1) |
RIAD |
| Keyword(2) |
Cluttered Ordering |
| Keyword(3) |
Complete Bipartite Graph |
| Keyword(4) |
Mathematical Modeling |
| Keyword(5) |
|
| Keyword(6) |
|
| Keyword(7) |
|
| Keyword(8) |
|
| 1st Author's Name |
Tomoko Adachi |
| 1st Author's Affiliation |
Toho University (Toho Univ.) |
| 2nd Author's Name |
|
| 2nd Author's Affiliation |
() |
| 3rd Author's Name |
|
| 3rd Author's Affiliation |
() |
| 4th Author's Name |
|
| 4th Author's Affiliation |
() |
| 5th Author's Name |
|
| 5th Author's Affiliation |
() |
| 6th Author's Name |
|
| 6th Author's Affiliation |
() |
| 7th Author's Name |
|
| 7th Author's Affiliation |
() |
| 8th Author's Name |
|
| 8th Author's Affiliation |
() |
| 9th Author's Name |
|
| 9th Author's Affiliation |
() |
| 10th Author's Name |
|
| 10th Author's Affiliation |
() |
| 11th Author's Name |
|
| 11th Author's Affiliation |
() |
| 12th Author's Name |
|
| 12th Author's Affiliation |
() |
| 13th Author's Name |
|
| 13th Author's Affiliation |
() |
| 14th Author's Name |
|
| 14th Author's Affiliation |
() |
| 15th Author's Name |
|
| 15th Author's Affiliation |
() |
| 16th Author's Name |
|
| 16th Author's Affiliation |
() |
| 17th Author's Name |
|
| 17th Author's Affiliation |
() |
| 18th Author's Name |
|
| 18th Author's Affiliation |
() |
| 19th Author's Name |
|
| 19th Author's Affiliation |
() |
| 20th Author's Name |
|
| 20th Author's Affiliation |
() |
| Speaker |
Author-1 |
| Date Time |
2004-12-10 16:00:00 |
| Presentation Time |
30 minutes |
| Registration for |
COMP |
| Paper # |
COMP2004-59 |
| Volume (vol) |
vol.104 |
| Number (no) |
no.501 |
| Page |
pp.37-44 |
| #Pages |
8 |
| Date of Issue |
2004-12-03 (COMP) |
|