Sciweavers

202 search results - page 25 / 41
» Schedulability analysis of multiprocessor real-time applicat...
Sort
View
ECRTS
2007
IEEE
14 years 2 months ago
The Global Feasibility and Schedulability of General Task Models on Multiprocessor Platforms
Feasibility analysis determines (prior to system execution-time) whether a specified collection of hard-realtime jobs executed on a processing platform can meet all deadlines. In...
Nathan Fisher, Sanjoy K. Baruah
EMSOFT
2007
Springer
14 years 1 months ago
Scheduling multiple independent hard-real-time jobs on a heterogeneous multiprocessor
This paper proposes a scheduling strategy and an automatic scheduling flow that enable the simultaneous execution of multiple hard-real-time dataflow jobs. Each job has its own ...
Orlando Moreira, Frederico Valente, Marco Bekooij
TACAS
2004
Springer
107views Algorithms» more  TACAS 2004»
14 years 1 months ago
Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata
Abstract. We study schedulability problems of timed systems with nonuniformly recurring computation tasks. Assume a set of real time tasks whose best and worst execution times, and...
Pavel Krcál, Wang Yi
CP
2007
Springer
14 years 1 months ago
Scheduling Conditional Task Graphs
The increasing levels of system integration in Multi-Processor System-on-Chips (MPSoCs) emphasize the need for new design flows for efficient mapping of multi-task applications o...
Michele Lombardi, Michela Milano
EMSOFT
2008
Springer
13 years 9 months ago
Portioned EDF-based scheduling on multiprocessors
This paper presents an EDF-based algorithm, called Earliest Deadline Deferrable Portion (EDDP), for efficient scheduling of recurrent real-time tasks on multiprocessor systems. Th...
Shinpei Kato, Nobuyuki Yamasaki