Open Access System for Information Sharing

Login Library

 

Article
Cited 0 time in webofscience Cited 1 time in scopus
Metadata Downloads
Full metadata record
Files in This Item:
There are no files associated with this item.
DC FieldValueLanguage
dc.contributor.authorKim, DW-
dc.contributor.authorLee, SH-
dc.contributor.authorPark, CI-
dc.date.accessioned2016-03-31T12:24:10Z-
dc.date.available2016-03-31T12:24:10Z-
dc.date.created2009-02-28-
dc.date.issued2004-01-
dc.identifier.issn0302-9743-
dc.identifier.other2004-OAK-0000004335-
dc.identifier.urihttps://oasis.postech.ac.kr/handle/2014.oak/17873-
dc.description.abstractThere is a growing demand for high data reliability beyond what current RAIDs can provide and users need various levels of data reliability. In order to meet these requirements, an efficient data placement scheme called RM2 has been proposed in [1], which enables a disk array system to tolerate double disk failures. However, RM2 has high data reconstruction overhead due to data dependency between parity groups in the case of double disk failures, suffering from large performance fluctuation according to disk failure patterns. To minimize the reconstruction overhead, this paper presents an improved data placement scheme called Balanced RM2. Experimental results show that the performance fluctuation of the Balanced RM2 becomes much less than that of the RM2 regardless of read or write. It is also shown that Balanced RM2 provides better performance than RM2 by 5 similar to 20% in the case of double disk failures.-
dc.description.statementofresponsibilityX-
dc.languageEnglish-
dc.publisherSPRINGER-VERLAG BERLIN-
dc.relation.isPartOfLECTURE NOTES IN COMPUTER SCIENCE-
dc.titleBalanced RM2: An improved data placement scheme for tolerating double disk failures in disk arrays-
dc.typeArticle-
dc.contributor.college컴퓨터공학과-
dc.identifier.doi10.1007/978-3-540-24688-6_50-
dc.author.googleKim, DW-
dc.author.googleLee, SH-
dc.author.googlePark, CI-
dc.relation.volume3038-
dc.relation.startpage371-
dc.relation.lastpage378-
dc.contributor.id10054851-
dc.relation.journalLECTURE NOTES IN COMPUTER SCIENCE-
dc.relation.indexSCI급, SCOPUS 등재논문-
dc.relation.sciSCIE-
dc.collections.nameConference Papers-
dc.type.rimsART-
dc.identifier.bibliographicCitationLECTURE NOTES IN COMPUTER SCIENCE, v.3038, pp.371 - 378-
dc.identifier.wosid000222048900050-
dc.date.tcdate2018-03-23-
dc.citation.endPage378-
dc.citation.startPage371-
dc.citation.titleLECTURE NOTES IN COMPUTER SCIENCE-
dc.citation.volume3038-
dc.contributor.affiliatedAuthorPark, CI-
dc.identifier.scopusid2-s2.0-35048816075-
dc.description.journalClass1-
dc.description.journalClass1-
dc.type.docTypeArticle; Proceedings Paper-
dc.relation.journalWebOfScienceCategoryComputer Science, Hardware & Architecture-
dc.relation.journalWebOfScienceCategoryComputer Science, Theory & Methods-
dc.relation.journalWebOfScienceCategoryTelecommunications-
dc.description.journalRegisteredClassscie-
dc.description.journalRegisteredClassscopus-
dc.relation.journalResearchAreaComputer Science-
dc.relation.journalResearchAreaTelecommunications-

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher

박찬익PARK, CHAN IK
Dept of Computer Science & Enginrg
Read more

Views & Downloads

Browse