CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

A Layout Scheme for Duplicated RAID Systems

by S.Subha
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 3 - Number 11
Year of Publication: 2010
Authors: S.Subha
10.5120/784-1110

S.Subha . A Layout Scheme for Duplicated RAID Systems. International Journal of Computer Applications. 3, 11 ( July 2010), 4-6. DOI=10.5120/784-1110

@article{ 10.5120/784-1110,
author = { S.Subha },
title = { A Layout Scheme for Duplicated RAID Systems },
journal = { International Journal of Computer Applications },
issue_date = { July 2010 },
volume = { 3 },
number = { 11 },
month = { July },
year = { 2010 },
issn = { 0975-8887 },
pages = { 4-6 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume3/number11/784-1110/ },
doi = { 10.5120/784-1110 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:51:37.397350+05:30
%A S.Subha
%T A Layout Scheme for Duplicated RAID Systems
%J International Journal of Computer Applications
%@ 0975-8887
%V 3
%N 11
%P 4-6
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Failure of disks in RAID is a bottleneck in processing. Data replication of RAID array systems is proposed in this paper for data validity. For a k-times replicated data in a RAID system with n disk arrays, the scheme takes the mean time between failures of the disks in a RAID system, allocates the data of the k-replicas in the n-RAID arrays based on the remaining time to the next failure and the distance of the disk array from the original copy of the data. The heuristics adapted places data in remote disks during the initial time period after a recovery and migrates the data to nearer disks as time advances to the next failure. A mathematical model is developed for the proposed scheme. Simulations support the proposed model.

References
Index Terms

Computer Science
Information Sciences

Keywords

RAID Performance Duplicate data

Powered by PhDFocusTM