z-logo
open-access-imgOpen Access
A Task Scheduling Model for Multi-CPU and Multi-Hard Disk Drive in Soft Real-time Systems
Author(s) -
Zeynab Mohseni,
Vahdaneh Kiani,
Amir Masoud Rahmani
Publication year - 2019
Publication title -
international journal of information technology and computer science
Language(s) - English
Resource type - Journals
eISSN - 2074-9015
pISSN - 2074-9007
DOI - 10.5815/ijitcs.2019.01.01
Subject(s) - computer science , scheduling (production processes) , execution time , parallel computing , cpu shielding , central processing unit , worst case execution time , energy consumption , dynamic priority scheduling , task (project management) , real time computing , embedded system , operating system , mathematical optimization , schedule , mathematics , management , economics , ecology , biology
In recent years, by increasing CPU and I/O devices demands, running multiple tasks simultaneously becomes a crucial issue. This paper presents a new task scheduling algorithm for multi-CPU and multi-Hard Disk Drive (HDD) in soft Real-Time (RT) systems, which reduces the number of missed tasks. The aim of this paper is to execute more parallel tasks by considering an efficient trade-off between energy consumption and total execution time. For study purposes, we analyzed the proposed scheduling algorithm, named HCS (Hard disk drive and CPU Scheduling) in terms of the task set utilization, the total execution time, the average waiting time and the number of missed tasks from their deadlines. The results show that HCS algorithm improves the above mentioned criteria compared to the HCS_UE (Hard disk drive and CPU Scheduling _Unchanged Execution time) algorithm.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom