On the complexity of fixed-priority scheduling of periodic, real-time tasks

Joseph Y.‐T. Leung; Jennifer Whitehead

doi:10.1016/0166-5316(82)90024-4

ScienceGate Book Chapters

JOURNAL ARTICLE

On the complexity of fixed-priority scheduling of periodic, real-time tasks

Joseph Y.‐T. Leung Jennifer Whitehead

Year: 1982 Journal: Performance Evaluation Vol: 2 (4)Pages: 237-250 Publisher: Elsevier BV

DOI: 10.1016/0166-5316(82)90024-4

Get Full-Text PDF Get Analytical Report

Keywords:

Computer science Deadline-monotonic scheduling Scheduling (production processes) Earliest deadline first scheduling Dynamic priority scheduling Mathematical optimization Rate-monotonic scheduling Mathematics Quality of service Computer network

Metrics

1124

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.23

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Real-Time Systems Scheduling

Physical Sciences → Computer Science → Hardware and Architecture

Interconnection Networks and Systems

Physical Sciences → Computer Science → Computer Networks and Communications

Petri Nets in System Modeling

Physical Sciences → Computer Science → Computational Theory and Mathematics

On the complexity of fixed-priority scheduling of periodic, real-time tasks

Metrics

Citation History

Topics

Related Documents

Gang fixed priority scheduling of periodic moldable real-time tasks

Preference-oriented fixed-priority scheduling for periodic real-time tasks

Non-preemptive Fixed Priority Scheduling of Hard Real-Time Periodic Tasks

Energy-Efficient Fixed-Priority Scheduling for Periodic Real-Time Tasks with Multi-priority Subtasks

On harmonic fixed-priority scheduling of periodic real-time tasks with constrained deadlines