2010•International Journal of Computer and Electrical EngineeringOpen access

A New Scheduling Algorithm for Real Time System

Calpakkam Yaashuwanth, R. Ramesh

Open full text 15 citations

Abstract

The main objective of this paper is to develop a new algorithm for scheduling real time tasks.Real time scheduling algorithms such as rate monotonic and deadline monotonic plays an important role in scheduling real time tasks in a real time environment .There are some cases where may arise inconsistencies such as tasks having less task period but their execution is not very important.In this case, when scheduled under rate monotonic algorithm the cpu unnecessarily spends time in scheduling the tasks that are not uttermost importance.The proposed algorithm eliminate this drawback and combines the advantages of both Rate monotonic and Deadline monotonic algorithms.It also incorporates a priority component which is specified by the user which denotes the importance of tasks in the system.

Open-access reader

About this research paper

What this paper is about

The main objective of this paper is to develop a new algorithm for scheduling real time tasks.Real time scheduling algorithms such as rate monotonic and deadline monotonic plays an important role in scheduling real time tasks in a real time environment .There are some cases where may arise inconsistencies such as tasks having less task period but their execution is not very important.In this case, when scheduled under rate monotonic algorithm the cpu unnecessarily spends time in scheduling the tasks that are not uttermost importance.The proposed algorithm eliminate this drawback and combines the advantages of both Rate monotonic and Deadline monotonic algorithms.It also incorporates a priority component which is specified by the user which denotes the importance of tasks in the system.

Why it matters

OpenAlex reports 15 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The main objective of this paper is to develop a new algorithm for scheduling real time tasks.Real time scheduling algorithms such as rate monotonic and deadline monotonic plays an important role in scheduling real time tasks in a real time environment .There are some cases where may arise inconsistencies such as tasks having less task period but their execution is not very important.In this case, when scheduled under rate monotonic algorithm the cpu unnecessarily spends time in scheduling the tasks that are not uttermost importance.The proposed algorithm eliminate this drawback and combines the advantages of both Rate monotonic and Deadline monotonic algorithms.It also incorporates a priority component which is specified by the user which denotes the importance of tasks in the system.

Key concepts: Computer science, Scheduling (production processes), Real-time computing, Real-time operating system, Embedded system, Mathematical optimization, Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
A New Scheduling Algorithm for Real Time System — Research Paper | ScholarLens