Function design of embedded real-time system introduced the problem of real-time task scheduling with precedence constraint which needs that scheduling sequence produced by algorithm satisfying not only real-time constraint of every task, but also precedence constraint among tasks. Based on parallel topological sort, this paper presents a new on-line scheduling algorithm OSA-RPC which can set p...

An optimal solution to the problem of scheduling real-time tasks on a set of identical processors is derived. The described approach is based on solving an equivalent uniprocessor real-time scheduling problem. Although there are other scheduling algorithms that achieve optimality, they usually impose prohibitive preemption costs. Unlike these algorithms, it is observed through simulation that t...

Cloud Computing is an emerging technology evolving to the new computing framework. Scheduling of task and allocation of virtualized resources in such a widely distributed dynamic environment is a challenging assignment. Attaining proficiency and providing fairness to tasks execution is the primary consideration of the task scheduling algorithm. The objective of this paper is to give a comparati...

Liu and Layland discovered the famous utilization bound N(2 1 N − 1) for fixed-priority scheduling on singleprocessor systems in the 1970’s. Since then, it has been a long standing open problem to find fixed-priority scheduling algorithms with the same bound for multiprocessor systems. In this paper, we present a partitioning-based fixed-priority multiprocessor scheduling algorithm with Liu and...

Abstract This paper presents a gain-scheduling-control technique for mechatronic systems with position-dependent dynamics. The proposed method fits in the framework of traditional gain scheduling, where several controllers designed for fixed operating points are interpolated to construct a global gain-scheduling controller. A new interpolation approach is proposed starting from an affine interp...