Two models for the storage and placement of files on disk storage devices are presented. Both models assume knowledge of certain aspects of the I/O behaviour in the system. The models are based on the system viewpoint and the program viewpoint, respectively, of I/O measurements and they both use the seek delay time as the performance measure to be optimised. The underlying analytic problem in each case is NP-hard. Efficient heuristic algorithms are presented and numerically tested
Disk storage subsystems have not kept up the speed with processors. Processor performance has been i...
Summarization: Recently, technological advances have resulted in the wide availability of commercial...
Finding a good rest position for the disk head is very important for the performance of a hard disk....
When the amount of space required for file storage exceeds the amount which can be kept online, deci...
It is anticipated that in the near future disk storage systems will surpass application servers and ...
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbr...
We study integrated prefetching and caching problems following the work of Cao et al. [1995] and Kim...
This paper analyzes various algorithms for scheduling low priority disk drive tasks. The derived clo...
Recently, technological advances have resulted in the wide availability of commercial products offer...
AbstractGiven a set of variable length records and their access probabilities, we address the proble...
The response time of a storage system is mainly influenced by its shape (configuration), the storage...
In this paper we present a simulation study of an automated storage/retrieval system and examine a w...
disk layout algorithms, seek distance optimization, disk data placement, disk reorganization © Copyr...
Abstract. One of the most effective ways to improve the I/O perfor-mance of a storage system is to e...
In high performance computing, researchers try to optimize the CPU Scheduling algorithms, for faster...
Disk storage subsystems have not kept up the speed with processors. Processor performance has been i...
Summarization: Recently, technological advances have resulted in the wide availability of commercial...
Finding a good rest position for the disk head is very important for the performance of a hard disk....
When the amount of space required for file storage exceeds the amount which can be kept online, deci...
It is anticipated that in the near future disk storage systems will surpass application servers and ...
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbr...
We study integrated prefetching and caching problems following the work of Cao et al. [1995] and Kim...
This paper analyzes various algorithms for scheduling low priority disk drive tasks. The derived clo...
Recently, technological advances have resulted in the wide availability of commercial products offer...
AbstractGiven a set of variable length records and their access probabilities, we address the proble...
The response time of a storage system is mainly influenced by its shape (configuration), the storage...
In this paper we present a simulation study of an automated storage/retrieval system and examine a w...
disk layout algorithms, seek distance optimization, disk data placement, disk reorganization © Copyr...
Abstract. One of the most effective ways to improve the I/O perfor-mance of a storage system is to e...
In high performance computing, researchers try to optimize the CPU Scheduling algorithms, for faster...
Disk storage subsystems have not kept up the speed with processors. Processor performance has been i...
Summarization: Recently, technological advances have resulted in the wide availability of commercial...
Finding a good rest position for the disk head is very important for the performance of a hard disk....