Rotational position optimization disk scheduling algorithms utilize seek distance versus rotational distance information implemented as rpo tables (arrays) which are stored in flashmemory within each disk drive. We consider a novel representation scheme for this information reducing the required flashmemory by a factor of more than thirty thereby reducing the manufacturing cost per drive. We present simulation results showing the throughput for conservative and aggressive versions of the scheme as well as comparative results with the standard production drives not using these results.
The authors of these documents have submitted their reports to this technical report series for the purpose of non-commercial dissemination of scientific work. The reports are copyrighted by the authors, and their existence in electronic format does not imply that the authors have relinquished any rights. You may copy a report for scholarly, non-commercial purposes, such as research or instruction, provided that you agree to respect the author's copyright. For information concerning the use of this document for other than research or instructional purposes, contact the authors. Other information concerning this technical report series can be obtained from the Computer Science and Engineering Department at the University of California at San Diego, firstname.lastname@example.org.
[ Search ]