Omar Kermia

Learn More
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the distribution and the scheduling of these tasks onto a multiprocessor is an NP-hard problem we propose a greedy heuristic to solve it. Our heuristic sequences three algorithms:(More)
In this paper we propose a greedy heuristic to solve the non preemptive multiprocessor static scheduling problem with precedence and strict periodicity constraints. The system of periodic tasks is described by a graph where dependent tasks are connected by precedence constraints. First, each task is repeated within the LCM of all periods of tasks(More)
Real-time systems are often designed using preemptive scheduling to guarantee the execution of high priority tasks. For multiple reasons there is a great interest in exploring non-preemptive scheduling in the case of hard real-time systems where missing deadline leads to catastrophic situations. This paper presents a necessary and sufficient schedu-lability(More)
This paper focuses on the analysis of real-time non preemptive multiprocessor scheduling with precedence and several latency constraints. It aims to specify a schedulability condition which enables a designer to check a priori-without executing or simulating-if its scheduling of tasks will hold the precedences between tasks as well as several latency(More)
This paper deals with load balancing and efficient memory usage for homogeneous distributed real-time embedded applications with dependence and strict periodicity constraints. Most of load balancing heuristics tend to minimize the total execution time of distributed applications by equalizing the workloads of processors. In addition, our heuris-tic(More)
  • 1