Pages that link to "Item:Q5491456"
From MaRDI portal
The following pages link to Algorithms for non-uniform size data placement on parallel disks (Q5491456):
Displaying 14 items.
- Random duplicate storage strategies for load balancing in multimedia servers (Q294850) (← links)
- Approximation schemes for generalized two-dimensional vector packing with application to data placement (Q414421) (← links)
- General store placement for response time minimization in parallel disks (Q436635) (← links)
- Dispatching-rule variants algorithms for used spaces of storage supports (Q782053) (← links)
- Algorithms for storage allocation based on client preferences (Q975763) (← links)
- An efficient retrieval selection algorithm for video servers with random duplicated assignment storage technique. (Q1853091) (← links)
- Locality-preserving allocations problems and coloured bin packing (Q2355699) (← links)
- Data migration on parallel disks: Algorithms and evaluation (Q2369881) (← links)
- Improved approximation algorithms for data migration (Q2429330) (← links)
- Optimal data placement on networks with a constant number of clients (Q2453166) (← links)
- The class constrained bin packing problem with applications to video-on-demand (Q2481969) (← links)
- A note on dual approximation algorithms for class constrained bin packing problems (Q3625691) (← links)
- (Q4952620) (← links)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191524) (← links)