Publication:3977465
From MaRDI portal
zbMath0796.68042MaRDI QIDQ3977465
No author found.
Publication date: 25 June 1992
scheduling; motion planning; paging; caching; \(k\)-server problem; on-line problems; competitive algorithms; task systems; two headed disks
68R10: Graph theory (including graph drawing) in computer science
90B35: Deterministic scheduling theory in operations research
68W10: Parallel algorithms in computer science
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Scheduling in the dark, A comparison of performance measures for online algorithms, A strongly competitive randomized paging algorithm, The relative worst-order ratio applied to paging, Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN, On convex body chasing, Competitive group testing, Randomized competitive algorithms for the list update problem, A new measure for the study of on-line algorithms, Competitive algorithms for the weighted server problem, A formula for incorporating weights into scoring rules, Competitive distributed decision-making, Competitive analysis for the on-line truck transportation problem, Competitive Algorithms for Layered Graph Traversal