Sign in
Feasibility problems for recurring tasks on one processor
Journal article   Peer reviewed

Feasibility problems for recurring tasks on one processor

Sanjoy K. Baruah, Rodney R. Howell, Louis E. Rosier and R. Rodney Howell
Theoretical computer science, Vol.118(1), pp.3-20
1993

Abstract

We give a comprehensive summary of our recent research on the feasibility problems for various types of hard-real-time preemptive task systems on one processor. We include results on periodic, sporadic, and hybrid task systems. While many of the results herein have appeared elsewhere, this is the first paper presenting a holistic view of the entire problem.

Metrics

InCites Highlights

These are selected metrics from InCites Benchmarking & Analytics tool, related to this output

Collaboration types
Domestic collaboration
Citation topics
4 Electrical Engineering, Electronics & Computer Science
4.46 Distributed & Real Time Computing
4.46.1107 Real-Time Systems
Web Of Science research areas
Computer Science, Theory & Methods
ESI research areas
Computer Science

UN Sustainable Development Goals (SDGs)

This output has contributed to the advancement of the following goals:

#11 Sustainable Cities and Communities

Source: InCites

Details