within a small constant factor of log D (i.e., they are provably near-optimal) if r < 1/Klog DL; and (4) we introduce a novel admission control policy that partitions the server bandwidth based on the expected popularities of different request lengths and experimentally demonstrate its benefits comp
β¦ LIBER β¦
Competitive Analysis of On-Line Disk Scheduling
β Scribed by Tzuoo-Hawn Yeh; Cheng-Ming Kuo; Chin-Laung Lei; Hsu-Chun Yen
- Publisher
- Springer
- Year
- 1998
- Tongue
- English
- Weight
- 215 KB
- Volume
- 31
- Category
- Article
- ISSN
- 1433-0490
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Competitive On-line Scheduling of Contin
β
Minos Garofalakis; Yannis Ioannidis; Banu Γzden; Avi Silberschatz
π
Article
π
2002
π
Elsevier Science
π
English
β 277 KB
Competitive Analysis of Scheduling Algor
β
Wojciech Jawor; Marek Chrobak; Christoph DΓΌrr
π
Article
π
2007
π
Springer
π
English
β 470 KB
On the competitiveness of on-line real-t
β
S. Baruah; G. Koren; D. Mao; B. Mishra; A. Raghunathan; L. Rosier; D. Shasha; F.
π
Article
π
1992
π
Springer US
π
English
β 999 KB
Competitive analysis of preemptive singl
β
RenΓ© Sitters
π
Article
π
2010
π
Elsevier Science
π
English
β 204 KB
Competitive analysis of incentive compat
β
Ron Lavi; Noam Nisan
π
Article
π
2004
π
Elsevier Science
π
English
β 322 KB
This paper studies auctions in a setting where the di erent bidders arrive at di erent times and the auction mechanism is required to make decisions about each bid as it is received. Such settings occur in computerized auctions of computational resources as well as in other settings. We call such au
Competitive Analysis for the On-line Tru
β
Weimin Ma; James N. K. Liu; Guoqing Chen; Jane You
π
Article
π
2006
π
Springer US
π
English
β 118 KB