Multilevel static real-time scheduling algorithms using graph partitioning

Authors:
Kayhan Erciyes;Zehra Soysert
Affiliations:
Computer Eng. Dept., Izmir Institute of Technology, Urla, Izmir, Turkey;Ege University International Computer Institute, Bornova, Izmir, Turkey
Venue:
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
Year:
2005

Citing 7
Cited 0

Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations

IEEE Transactions on Software Engineering
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Scheduling Distributed Real-Time Tasks with Minimum Jitter

IEEE Transactions on Computers
Scheduling and Priority Mapping for Static Real-Time Middleware

Real-Time Systems - Special issue on challenges in design and implementation of middlewares for real time systems
Priority Inheritance Protocols: An Approach to Real-Time Synchronization

IEEE Transactions on Computers
Hybrid Genetic Algorithms for Scheduling Partially Ordered Tasks in a Multi-Processor Environment

RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Genetic-algorithm-based real-time task scheduling with multiple goals

Journal of Systems and Software - Special issue: Computer systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose static task allocation algorithms for the periodic tasks of a distributed real-time system. The cyclic task consists of task threads which may communicate and share resources. A graph partitioning process and a thread sequencing algorithm are applied to these threads to yield local schedules. The exact analysis is then obtained and further refinements are performed if the worst case response time of a task is greater than its deadline.