On the performance of D-redundant storage systems Eitan Bachmat Ben Gurion U., Beer Sheva, Israel email : ebachmat@cs.bgu .ac.il 1. A D-redundant storage system is a system containing D identical disks whichhold data whose total capacity is that of a single disk . A simple example of a D-redundant storage system is the Dshadowed disk system in which there are D copies of each data element. These copies are placed at identical locations on the different disks. The existence of multiple copies can be exploited to improve read request access time . In a shadowed system, for example, aread request may be serviced by the disk whose head position is closest to the copy of the requested data. In this note we will assume for simplicity that all requests are read requests . The analysis of write requests has a different character since writes may in general be serviced asynchronously . Despite the apparent simplicity of D-shadowed systems, the average access time of requests in a D-shadowed system is not known in general. For the case D = 2 an analysis of the average radial seek time is presented in [2]. In the general case a widely quoted
End of preview. The entire article is 2 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/on-the-performance-of-d-redundant-storage-systems-TBJx92bsG4
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
On the performance of D-redundant storage systems
Bachmat, Eitan
Follow ACM SIGMETRICS Performance Evaluation Review
, Volume 31 (2)
Association for Computing Machinery – Sep 1, 2003
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
