Reducing disk power consumption in a portable computer

Authors:
William F. Klostermeyer;Kankanahalli Srinivas
Affiliations:
Department of Statistics and Computer Science, West Virginia University, Morgantown, WV;Department of Statistics and Computer Science, West Virginia University, Morgantown, WV
Venue:
ACM SIGOPS Operating Systems Review
Year:
1995

Citing 7
Cited 0

Amortized efficiency of list update and paging rules

Communications of the ACM
Competitive algorithms for server problems

Journal of Algorithms
The harmonic online K-server algorithm is competitive

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
New results on server problems

SIAM Journal on Discrete Mathematics
On fast algorithms for two servers

Journal of Algorithms
Generosity helps, or an 11–competitive algorithm for three servers

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
On the k-server conjecture

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of minimizing disk power consumption in portable personal computers is studied. Two online algorithms for determining when to stop spinning a disk are presented and analyzed using competitive analysis techniques.