Skip Navigation

The Computer Journal 2005 48(3):292-299; doi:10.1093/comjnl/bxh085
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Thomasian, A.
Right arrow Articles by Han, C.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2005. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oupjournals.org

Affinity-Based Routing in Zoned Mirrored Disks

Alexander Thomasian1 * and Chunqi Han2

1 Computer Science Department, New Jersey Institute of Technology (NJIT), Newark, NJ 07102, USA, 2 Hitachi Global Storage Technologies, San Jose, CA, USA

Magnetic disk capacity is increasing rapidly, while disk positioning time is decreasing very slowly. Disks are a system bottleneck for applications generating accesses to random disk blocks, which do not benefit from caching and prefetching. Disk mirroring is a solution to this problem, since it provides twice the access bandwidth of a single disk in processing read requests and in addition tolerates single disk failures. Performance can be further improved by affinity-based routing (ABR), i.e. sending a request to a disk which will yield a reduced positioning time. We analytically evaluate a specific instance of ABR in zoned disks, which improves performance (reduces the seek time) by routing read requests intended for outer disk cylinders to one disk and those for inner disk cylinders to another. We evaluate several criteria for specifying the pivot point, which delineates inner and outer disk cylinders. This is accomplished by analyzing the performance of a single zoned disk with FCFS scheduling. Analytic and numerical results show that balancing disk utilizations achieves the same performance as methods that improve the response time. A transposed disk organization, which stores data in reversed directions on two disks, is also proposed and shown to achieve the best performance for fully loaded disks. We also discuss an adaptive approach to implement ABR, so that the pivot point is determined by the router based on the history of routed requests. The simple criterion of balancing disk loads can then be adopted easily in this context.


Received 6 August 2004. revised 7 January 2005.

* Email: athomas{at}cs.njit.edu


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.