Analysis of simple randomized buffer management for parallel I/O
From MaRDI portal
Publication:2390215
Recommendations
Cites work
- scientific article; zbMATH DE number 3548141 (Why is no real title available?)
- scientific article; zbMATH DE number 1775431 (Why is no real title available?)
- scientific article; zbMATH DE number 1419218 (Why is no real title available?)
- scientific article; zbMATH DE number 1445386 (Why is no real title available?)
- A strongly competitive randomized paging algorithm
- Algorithms for parallel memory, I: Two-level memories
- Competitive Parallel Disk Prefetching and Buffer Management
- Competitive paging algorithms
- Near-Optimal Parallel Prefetching and Caching
- On competitive on-line paging with lookahead
- On the influence of lookahead in competitive paging algorithms
- Random duplicate storage strategies for load balancing in multimedia servers
- Simple randomized mergesort on parallel disks
Cited in
(5)
This page was built for publication: Analysis of simple randomized buffer management for parallel I/O
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390215)