Kameshwari, R and Gopinath, K (2003) Space & Compute Requirements of PPM* for Migration within the Secondary Storage. In: Conference on Convergent Technologies for the Asia-Pacific Region: IEEE TENCON 2003, 15-17 October, 2003, Bangalore, India, Vol.3 1167-1171.
compute.pdf - Published Version
Restricted to Registered users only
Download (326Kb) | Request a copy
PPM* algorithm is used in this work to dynamically migrate and reorganize data in a thee-tiered secondary storage hierarchy implemented using software RAID. The three levels implemented in the prototype named Temperature Sensitive Storage ('I'SS) are RAID 10, RAID 5 and compressed RMD 5 levels. Our earlier study confirmed the usefulness of this algorithm in reducing performance degradation with compressed RAID 4 levels being 20% or more of the working-set sine. The usefulness of PPM* for such an application is gauged not only by using performance metrics such as throughput, residual compressed RAID 5 migrations, hit & miss ratios at different migration boundaries, but also by its space and 'compute requirements. Results using two file-system traces Sitar & Harp show that the worst case storage requirements of the PPM* has been well below 10 MH and CPU usage lias been moderate. The total migrations generated for 400000 accesses has been less than 3% of the total accesses seen by the TSS device driver.
|Item Type:||Conference Paper|
|Additional Information:||©2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||08 Jul 2004|
|Last Modified:||08 Jul 2011 09:36|
Actions (login required)