Home // ICONS 2013, The Eighth International Conference on Systems // View article

Safety Critical Multiprocessor Real-Time Scheduling with Exact Preemption Cost

Authors:
Falou Ndoye
Yves Sorel

Keywords: multiprocessor real-time scheduling; partitioned scheduling; exact preemption cost; load balancing.

Abstract:
Abstract—In this paper, we address for safety critical applications the problem of multiprocessor real-time scheduling while taking into account the exact preemption cost. In the framework of multiprocessor real-time partitioned scheduling, we propose a greedy heuristic which balances the load of the tasks on all the processors and minimizes the response time of the applications. That heuristic uses a schedulability condition which is based on the ⊕ operation. That operation performs a schedulability analysis while taking into account the exact preemption cost. A performance analysis is achieved which compares the proposed heuristic to the branch and bound exact algorithm and to the worst-fit and best-fit heuristics.

Pages: 127 to 136

Copyright: Copyright (c) IARIA, 2013

Publication date: January 27, 2013

Published in: conference

ISSN: 2308-4243

ISBN: 978-1-61208-246-2

Location: Seville, Spain

Dates: from January 27, 2013 to February 1, 2013