Optimization of disk scheduling to reduce completion time and missed tasks using multi-objective genetic algorithm

N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The crucial challenge that decides the success of real-time disk scheduling algorithm lies in simultaneously achieving the two contradicting objectives namely - completion time and missed tasks. This work is motivated toward developing such an algorithm. The goal of this paper is to demonstrate that the simultaneous optimization of completion time and missed tasks produces an efficient schedule for real-time disk scheduling. The objective function is designed to minimize the two parameters. An extensive experimental evaluation to compare the performance of the proposed system vs. other disk scheduling algorithms conducted on 1000 disk request sets. The observations reported that the proposed scheme is a state-of-the-art model offering minimum completion time and missed tasks. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Selvi, R. M., & Rajaram, R. (2011). Optimization of disk scheduling to reduce completion time and missed tasks using multi-objective genetic algorithm. In Communications in Computer and Information Science (Vol. 198 CCIS, pp. 68–75). https://doi.org/10.1007/978-3-642-22555-0_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free