Results 11 - 20 of 80

Tardiness bounds for FIFO scheduling on multiprocessors

by Hennadiy Leontyev, James H. Anderson - In Proc. of the 19th Euromicro Conf. on Real-Time Systems , 2007
"... FIFO scheduling is often considered to be inappropriate for scheduling workloads that are subject to timing constraints. However, FIFO is implemented in many generalpurpose OSs, and is more widely supported than other priority-based scheduling methods. In this paper, we show that, when the global FI ..."
Abstract - Cited by 11 (8 self) - Add to MetaCart
FIFO scheduling algorithm is used to schedule sporadic real-time tasks on a multiprocessor, deadline tardiness is bounded. This result shows that global FIFO may in fact be useful for scheduling soft real-time workloads. 1.

An Efficient Scheme to Allocate Soft-Aperiodic Tasks in Multiprocessor Hard Real-Time Systems

by Josep M. Banús, Alex Arenas, Jesús Labarta
"... We propose a scheme to allocate individual softaperiodic tasks in a shared memory symmetrical multiprocessor for hard-real time systems applications. The aim of this scheme is to minimize the aperiodic mean response time by running a local uniprocessor scheduler to serve periodic tasks guaranteeing ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
We propose a scheme to allocate individual softaperiodic tasks in a shared memory symmetrical multiprocessor for hard-real time systems applications. The aim of this scheme is to minimize the aperiodic mean response time by running a local uniprocessor scheduler to serve periodic tasks guaranteeing

Exact Schedulability Analysis for Static-Priority Global Multiprocessor Scheduling using Model-Checking

by Nan Guan, Shuaihong Gao, Qingxu Deng, Ge Yu, Zonghua Gu
"... Abstract — To determine schedulability of prioritydriven periodic tasksets on multi-processor systems, it is necessary to rely on utilization bound tests that are safe but pessimistic, since there is no known method for exact schedulability analysis for multi-processor systems analogous to the respo ..."
Abstract - Cited by 6 (2 self) - Add to MetaCart
to the response time analysis algorithm for single-processor systems. In this paper, we use model-checking to provide a technique for exact multiprocessor scheduability analysis by modeling the realtime multi-tasking system with Timed Automata (TA), and transforming the schedulability analysis problem

On-Line Scheduling of Scalable Real-Time Tasks on Multiprocessor Systems

by Wan Y. Lee, Sung J. Hong, Jong Kim - J. Parallel Distrib. Comput , 2003
"... Previous researches on real-time scheduling assume that the number of processors required to execute a task is fixed and its computation time is given based on this fixed number of processors. However, in multiprocessor systems, the computation time of scalable task varies depending on the number o ..."
Abstract - Cited by 12 (0 self) - Add to MetaCart
of processors allocated to it. By determining a proper number of processors to be allocated to each real-time task, more real-time tasks complete their execution before deadlines. In this paper, we propose a new on-line scheduling algorithm for scalable, aperiodic, nonpreemptive, and independent tasks

Feasibility Intervals for Multiprocessor Fixed-Priority Scheduling of Arbitrary Deadline Periodic Systems

by unknown authors
"... In this paper we study the global scheduling of periodic task systems with arbitrary deadlines upon identical multiprocessor platforms. We first show two very general properties which are well-known for uniprocessor platforms and which remain for multiprocessor platforms: (i) under few and not so re ..."
Abstract - Add to MetaCart
In this paper we study the global scheduling of periodic task systems with arbitrary deadlines upon identical multiprocessor platforms. We first show two very general properties which are well-known for uniprocessor platforms and which remain for multiprocessor platforms: (i) under few and not so

Real-Time Scheduling on Uni- and Multiprocessors based on Priority Promotions∗

by Risat Mahmud Pathan
"... This paper addresses the problem of real-time scheduling of a set of sporadic tasks on uni- and multipro-cessor platform based on priority promotion. A new pre-emptive scheduling algorithm, called Fixed-Priority with Priority Promotion (FPP), is proposed. In FPP schedul-ing, tasks are executed simil ..."
Abstract - Add to MetaCart
This paper addresses the problem of real-time scheduling of a set of sporadic tasks on uni- and multipro-cessor platform based on priority promotion. A new pre-emptive scheduling algorithm, called Fixed-Priority with Priority Promotion (FPP), is proposed. In FPP schedul-ing, tasks are executed

Improving Multiprocessor Average-Case Schedulability using A Modified Global Dual Priority Algorithm

by Josep M. Banús, Alex Arenas, Jesús Labarta
"... In this paper we present a modification of the Dual Priority Scheduling Algorithm to work on shared memory multiprocessor systems improving the average-case schedulability. The proposal deals with global fixedpriority preemptive scheduling of periodic tasks on identical processors. The algorithm all ..."
Abstract - Add to MetaCart
In this paper we present a modification of the Dual Priority Scheduling Algorithm to work on shared memory multiprocessor systems improving the average-case schedulability. The proposal deals with global fixedpriority preemptive scheduling of periodic tasks on identical processors. The algorithm

Improving Multiprocessor Average-Case Schedulability using

by Modified Global Dual, Josep M. Banús, Alex Arenas, Jesús Labarta
"... In this paper we present a modification of the Dual Priority Scheduling Algorithm to work on shared memory multiprocessor systems improving the average-case schedulability. The proposal deals with global fixedpriority preemptive scheduling of periodic tasks on identical processors. The algorithm all ..."
Abstract - Add to MetaCart
In this paper we present a modification of the Dual Priority Scheduling Algorithm to work on shared memory multiprocessor systems improving the average-case schedulability. The proposal deals with global fixedpriority preemptive scheduling of periodic tasks on identical processors. The algorithm

Schedulability Analysis of Global Fixed-Priority or EDF Multiprocessor Scheduling with Symbolic Model-Checking∗

by Nan Guan, Zonghua Gu, Mingsong Lv, Qingxu Deng, Ge Yu
"... As Moore’s law comes to an end, multi-processor (MP) sys-tems are becoming increasingly important in embedded sys-tems design, hence real-time schedulability analysis for MP sys-tems has become an important research topic. In this pa-per, we present an exact method for schedulability analysis of glo ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
of global multiprocessor scheduling with either Fixed-Priority (FP) or Earliest-Deadline-First (EDF) algorithms using the model-checker NuSMV. Compared to safe but pessimistic schedulability tests based on processor utilization bounds, model-checking can provide an exact answer to the schedulability of a

New Slack-Monotonic Schedulability Analysis of Real-Time Tasks on Multiprocessors

by Risat Mahmud Pathan, Jan Jonsson
"... Abstract—In this paper, multiprocessor scheduling of a set of real-time periodic tasks with implicit deadlines is addressed. We propose two static priority-assignment policies, called policy Pbound and policy Psearch. Common for both policies is that a subset of a given task set is assigned the slac ..."
Abstract - Add to MetaCart
the slack-monotonic priority while each of the other tasks is assigned the highest static-priority. The tasks are scheduled on m processors using preemptive global multiprocessor scheduling algorithm. First, we show that the utilization bound of global mul-tiprocessor scheduling using our proposed policy
Results 11 - 20 of 80