Pages that link to "Item:Q5957577"
From MaRDI portal
The following pages link to New algorithms for disk scheduling (Q5957577):
Displaying 21 items.
- Mathematical adventures in performance analysis. From storage systems, through airplane boarding, to express line queues (Q405515) (← links)
- Hardware design of a new genetic based disk scheduling method (Q617747) (← links)
- The cost of cache-oblivious searching (Q639274) (← links)
- Evaluating disk idle behavior by leveraging disk schedulers (Q662847) (← links)
- SIMPLE: An optimal disk system with two restricted heads (Q672661) (← links)
- A tight upper bound of the lumped disk seek time for the Scan disk scheduling policy (Q672979) (← links)
- Optimal read-once parallel disk scheduling (Q818672) (← links)
- The optimum execution order of queries in linear storage (Q917278) (← links)
- An adversarial queueing model for online server routing (Q995586) (← links)
- Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN (Q1195936) (← links)
- Competitive analysis of on-line disk scheduling (Q1271270) (← links)
- Adaptive disk spindown via optimal rent-to-buy in probabilistic environments (Q1277322) (← links)
- The two headed disk: Stochastic dominance of the greedy policy (Q1351613) (← links)
- Optimal allocation of data sets to magnetic disks (Q1816047) (← links)
- Phased RGSS: An improved disk array scheduling for continuous media retrieval (Q1848545) (← links)
- Average case analysis of disk scheduling, increasing subsequences and spacetime geometry (Q2461547) (← links)
- Improved disk scheduling algorithms based on rotational position (Q3368132) (← links)
- Euro-Par 2004 Parallel Processing (Q5311345) (← links)
- Min-max subsequence problems in multi-zone disk recording (Q5952432) (← links)
- Cello: A disk scheduling framework for next generation operating systems (Q5959745) (← links)
- Competitive analysis of on-line disk scheduling (Q6487455) (← links)
