CFP last date
20 January 2025
Reseach Article

Mathematical Model for Real Time Disk Scheduling Problem

Published on April 2012 by S. Y. Amdani, M. S. Ali, S. M. Mundada
Emerging Trends in Computer Science and Information Technology (ETCSIT2012)
Foundation of Computer Science USA
ETCSIT - Number 3
April 2012
Authors: S. Y. Amdani, M. S. Ali, S. M. Mundada
5d8ed733-953b-4721-afd3-e822b203027b

S. Y. Amdani, M. S. Ali, S. M. Mundada . Mathematical Model for Real Time Disk Scheduling Problem. Emerging Trends in Computer Science and Information Technology (ETCSIT2012). ETCSIT, 3 (April 2012), 21-24.

@article{
author = { S. Y. Amdani, M. S. Ali, S. M. Mundada },
title = { Mathematical Model for Real Time Disk Scheduling Problem },
journal = { Emerging Trends in Computer Science and Information Technology (ETCSIT2012) },
issue_date = { April 2012 },
volume = { ETCSIT },
number = { 3 },
month = { April },
year = { 2012 },
issn = 0975-8887,
pages = { 21-24 },
numpages = 4,
url = { /proceedings/etcsit/number3/5978-1021/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 Emerging Trends in Computer Science and Information Technology (ETCSIT2012)
%A S. Y. Amdani
%A M. S. Ali
%A S. M. Mundada
%T Mathematical Model for Real Time Disk Scheduling Problem
%J Emerging Trends in Computer Science and Information Technology (ETCSIT2012)
%@ 0975-8887
%V ETCSIT
%N 3
%P 21-24
%D 2012
%I International Journal of Computer Applications
Abstract

A real time system is a system that must satisfy explicit bounded response-time constraints. Real time data base systems combine the concepts from real time systems and conventional database systems. Real time systems are mainly characterized by their strict timing constraints. Conventional databases are mainly characterized by their strict data consistency and integrity requirements. Thus, real time database systems should satisfy both the timing constraints with data integrity and consistency constraints. Real-time systems can be defined as those computing systems that are designed to operate in a timely manner. That is, performing certain actions within specific timing constraints; e. g. producing results while meeting predefined deadlines. Real-time disk I/O scheduling is extremely important to the performance improvement of the whole real-time system since the disk devices are the system's bottleneck. The design of mathematical model shows the correctness of real-time disk scheduling algorithms, as the effectiveness of any algorithm can only be detected or calculated using the mathematical model. This paper represents the design of our mathematical model which helps in evaluating the result of different scheduling algorithms.

References
  1. Ben Kao and Hector Garcia-Molina "An Overview of Real-Time Database Systems", in proceedings of NATO Advanced Study Institute on Real-Time Computing. St. Maarten, Netherlands Antilles, Springer-Verlag, 1993.
  2. Saud A. Aldarmi, "Real-time Database Systems: Concepts and Design" , Department of Computer science, The University of York, April 1998.
  3. Fengxiang Zhang, Alan Burns, Sanjoy Baruah, "Task Parameter Computations for Constraint Deadline Real-Time Systemswith EDF Scheduling" 201O International Conference On Computer Design And Appliations (ICCDA 2010) Volume 3.
  4. R. 1. Chang, W K. Shih, and R. C. Chang, "Deadline-modification-scan with maximum scannable-groups for multimedia real-time disk scheduling," in Proceedings of the 19th IEEE Real-Time Systems Symposium, pp. 40-49, 1998.
  5. H. -P. Chang, R. -I. Chang, W. -K. Shih, and R. -C. Chang, "GSR: A global seek-optimizing real-time disk-scheduling algorithm," The Journal of Systems and Software, vol. 80, no. 2, pp. 198-215, 2007.
Index Terms

Computer Science
Information Sciences

Keywords

Real-time Disk Deadline Scheduling Parameters