Add to ORKGPaper/Poster presented in Work in Progress Session, 28th GI/ITG International Conference on Architecture of Computing Systems (ARCS 2015). 24 to 26, Mar, 2015. Porto, Portugal.We consider the scheduling of sequential and fork-join hard real-time tasks by following semi-partitioned scheduling. In this paper we briefly introduce a modification to the limited migrative model in order to support parallel tasks
International audienceWe focus on the class of static-priority partitioning scheduling algorithm on ...
Recent work showed that semi-partitioned scheduling can achieve near-optimal schedulability performa...
This paper tackles the problem of admitting real-time tasks onto a symmetric multi-processor platfor...
Paper/Poster presented in Work in Progress Session, 28th GI/ITG International Conference on Architec...
This paper extends the work presented in Maia et al. (Semi-partitioned scheduling of fork-join tasks...
International audienceIn this paper, we focus on the scheduling of periodic fork-join real-time task...
Algorithms based on semi-partitioned scheduling have been proposed as a viable alternative between t...
This paper presents a new algorithm for scheduling real-time tasks on multiprocessor/multicore syste...
6th Real-Time Scheduling Open Problems Seminar (RTSOPS 2015), Lund, Sweden.No abstract (2 page paper...
the date of receipt and acceptance should be inserted later Abstract As real-time embedded systems i...
International audienceSemi-partitioned scheduling is regarded as a viable alternative to partitioned...
Semi-partitioned real-time scheduling algorithms extend partitioned ones by allowing a (usually smal...
International audienceWe investigate the global scheduling of sporadic, implicit deadline, real-time...
This paper proposes a global multiprocessor scheduling algorithm for the Linux kernel that combines...
This paper presents a novel migration algorithm for real-time tasks on multicore systems, based on t...
International audienceWe focus on the class of static-priority partitioning scheduling algorithm on ...
Recent work showed that semi-partitioned scheduling can achieve near-optimal schedulability performa...
This paper tackles the problem of admitting real-time tasks onto a symmetric multi-processor platfor...
Paper/Poster presented in Work in Progress Session, 28th GI/ITG International Conference on Architec...
This paper extends the work presented in Maia et al. (Semi-partitioned scheduling of fork-join tasks...
International audienceIn this paper, we focus on the scheduling of periodic fork-join real-time task...
Algorithms based on semi-partitioned scheduling have been proposed as a viable alternative between t...
This paper presents a new algorithm for scheduling real-time tasks on multiprocessor/multicore syste...
6th Real-Time Scheduling Open Problems Seminar (RTSOPS 2015), Lund, Sweden.No abstract (2 page paper...
the date of receipt and acceptance should be inserted later Abstract As real-time embedded systems i...
International audienceSemi-partitioned scheduling is regarded as a viable alternative to partitioned...
Semi-partitioned real-time scheduling algorithms extend partitioned ones by allowing a (usually smal...
International audienceWe investigate the global scheduling of sporadic, implicit deadline, real-time...
This paper proposes a global multiprocessor scheduling algorithm for the Linux kernel that combines...
This paper presents a novel migration algorithm for real-time tasks on multicore systems, based on t...
International audienceWe focus on the class of static-priority partitioning scheduling algorithm on ...
Recent work showed that semi-partitioned scheduling can achieve near-optimal schedulability performa...
This paper tackles the problem of admitting real-time tasks onto a symmetric multi-processor platfor...