A continuum of disk scheduling algorithms
ACM Transactions on Computer Systems (TOCS)
Principles of delay-sensitive multimedia data storage retrieval
ACM Transactions on Information Systems (TOIS)
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
I/O issues in a multimedia system
Computer
Scheduling algorithms for modern disk drives
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Real-time transaction scheduling in database systems
Information Systems
On-line extraction of SCSI disk drive parameters
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Integrating standard transactions in firm real-time database systems
Information Systems - Special issue on real-time database systems
Temporally determinate disk access (extended abstract): an experimental approach
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Minimizing Expected Head Movement in One-Dimensional and Two-Dimensional Mass Storage Systems
ACM Computing Surveys (CSUR)
Disk scheduling: FCFS vs.SSTF revisited
Communications of the ACM
Journal of Systems and Software
Earliest-Deadline-First Scheduling on Nonpreemptive Real-Time Threads
HPCN Europe '97 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Proceedings of the Third International Workshop on Network and Operating System Support for Digital Audio and Video
Deadline-Modification-SCAN with Maximum-Scannable-Groups for Multimedia Real-Time Disk Scheduling
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Disk scheduling in a multimedia I/O system
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
The NP-Hardness and the Algorithm for Real-Time Disk-Scheduling in a Multimedia System
RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
General Architecture for Hardware Implementation of Genetic Algorithm
FCCM '06 Proceedings of the 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
GSR: A global seek-optimizing real-time disk-scheduling algorithm
Journal of Systems and Software
On multidimensional data and modern disks
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
Journal of Systems and Software
Effects of scheduling on file memory operations
AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
DIG: Rapid Characterization of Modern Hard Disk Drive and Its Performance Implication
SNAPI '08 Proceedings of the 2008 Fifth IEEE International Workshop on Storage Network Architecture and Parallel I/Os
Operating system support for multimedia systems
Computer Communications
Hi-index | 0.00 |
Disk scheduling is an operating system process to service disk requests. It has an important role in QOS guarantee of soft real-time environments such as video-on-demand and multimedia servers. Since now, some disk scheduling algorithms have been proposed to schedule disk requests in an optimized manner. Most of these methods try to minimize makespan by decreasing the number of disk head seeks as one of the slowest operations in modern computers and crucial for system performance because it usually takes some milli-seconds. In this paper, we propose a new disk scheduling method based on genetic algorithm that considers makespan and number of missed tasks simultaneously. In the proposed method, a new coding scheme is presented which employs simple GA procedures such as crossover and mutation and a penalty function in fitness. To get the best performance of the proposed method, its parameters such as number of chromosomes in initial population, mutation, and crossover probabilities, etc have been adjusted by applying it on some sample problems. The algorithm has been tested on several problems and its results were compared with well-known related methods. Experimental results showed that the proposed method worked very well and excelled most related works in terms of miss ratio and average seeks.