Real-Time Disk Scheduling with On-Disk Cache Conscious

2004 ◽  
pp. 88-102
Author(s):  
Hsung-Pin Chang ◽  
Ray-I Chang ◽  
Wei-Kuan Shih ◽  
Ruei-Chuan Chang
Keyword(s):  
Real Time ◽  
Disk Scheduling ◽  
Disk Cache

A new real time disk-scheduling method based on GSR algorithm

2010 ◽  
Vol 83 (11) ◽  
pp. 2147-2164
Author(s):  
Hossein Rahmani ◽  
Mohammad Mehdi Faghih ◽  
Mohsen Ebrahimi Moghaddam
Keyword(s):  
Real Time ◽  
Disk Scheduling ◽  
Scheduling Method

PERFORMANCE MODELS FOR STUDYING AND ANALYZING REAL-TIME MULTIMEDIA SYSTEMS

2006 ◽  
Vol 15 (04) ◽  
pp. 571-606
Author(s):  
SAMIR M. KORIEM
Keyword(s):  
Real Time ◽  
Service System ◽  
Scheduling Algorithm ◽  
Critical Role ◽  
Multimedia Systems ◽  
Mixed Data ◽  
Disk Scheduling ◽  
Data Types ◽  
Performance Models ◽  
The Real

As real-time systems continue to grow, performance evaluation plays a critical role in the design of these systems since the computation time, the service time, and the responsive actions must satisfy the time constraints. One of these systems is the real-time distributed multimedia-on-demand (MOD) service system. The MOD system usually fails when it misses a task deadline. The main units of the MOD system usually communicate with each other and work concurrently under timing constraints. The MOD system is designed to store, retrieve, schedule, synchronize and communicate objects comprising of mixed data types including images, text, video and audio, in real-time. In the MOD system, such data types represent the main concept of movie files. Modeling of such concurrency, communication, timing, and multimedia service (e.g., store, retrieve) is essential for evaluating the real-time MOD system. To illustrate how to model and analyze the important multimedia aspects of the MOD system, we use the Real-net (R-net) modeling technique. We choose R-net as an extension of Time Petri Net due to its ability to specify hard real-time process interaction, represent the synchronization of multimedia entities, describe concurrent multimedia activities, and illustrate the inter-process timing relationships as required for multimedia presentation. Based on modular techniques, we build three R-net performance models for describing the dynamic behavior of the MOD service system. The first model adopts the Earliest Deadline First (EDF) disk scheduling algorithm. The other models adopt the Scan-EDF algorithm. These algorithms help us to illustrate how the real-time user requests can be satisfied within the specified deadline times. Since R-nets are amenable to analysis including Markov process modeling, the interesting performance measures of the MOD service system such as the quality of service, the request response time, the disk scheduling algorithm time, and the actual retrieval time can be easily computed. In the performance analysis of the MOD models, we use our R-NET package.

Scheduling customers in a non-removal real-time system with an application to disk scheduling

1994 ◽  
Vol 6 (1) ◽  
pp. 55-72 ◽  
Author(s):  
Shenze Chen ◽  
Don Towsley
Keyword(s):  
Real Time ◽  
Disk Scheduling ◽  
Time System ◽  
Real Time System

scholarly journals GSR: A global seek-optimizing real-time disk-scheduling algorithm

2007 ◽  
Vol 80 (2) ◽  
pp. 198-215 ◽  
Author(s):  
Hsung-Pin Chang ◽  
Ray-I Chang ◽  
Wei-Kuan Shih ◽  
Ruei-Chuan Chang
Keyword(s):  
Real Time ◽  
Scheduling Algorithm ◽  
Disk Scheduling
Sign in / Sign up

Export Citation Format

Share Document