Filters








120,493 Hits in 5.0 sec

Applying fixed priority scheduling in practice

Raimondas Lencevicius, Alexander Ran
2004 Software engineering notes  
In this case, different schedules are used for different featuresets. Such priority assignment is called in fixed priority scheduling a mode [5] [7] .  ...  Multivariate task scheduling is not fully addressed by fixed priority scheduling methods, requiring new extensions.  ... 
doi:10.1145/974044.974069 dblp:conf/wosp/LenceviciusR04 fatcat:yyvtrwkobnb2jclr5jwjocjc4y

Applying fixed priority scheduling in practice

Raimondas Lencevicius, Alexander Ran
2004 Software engineering notes  
In this case, different schedules are used for different featuresets. Such priority assignment is called in fixed priority scheduling a mode [5] [7] .  ...  Multivariate task scheduling is not fully addressed by fixed priority scheduling methods, requiring new extensions.  ... 
doi:10.1145/974043.974069 fatcat:t3hdburrlfdc7eq5xekfwlaa7q

Mixed Critical Earliest Deadline First

Dario Socci, Peter Poplavko, Saddek Bensalem, Marius Bozga
2013 2013 25th Euromicro Conference on Real-Time Systems  
In this work we propose an algorithm which is proved to dominate OCBP, a state-of-theart algorithm for this problem that is optimal over fixed job priority algorithms.  ...  In the context of mixed-critical scheduling theory, we studied the dual criticality problem of scheduling a finite set of hard real-time jobs.  ...  fixed-priority scheduler.  ... 
doi:10.1109/ecrts.2013.20 dblp:conf/ecrts/SocciPBB13 fatcat:pp7umlkocjgyneyrbdj43463xy

A review of priority assignment in real-time systems

Robert I. Davis, Liliana Cucu-Grosjean, Marko Bertogna, Alan Burns
2016 Journal of systems architecture  
It examines the role and importance of priority in fixed priority scheduling in all of its guises, including: preemptive and non-pre-emptive scheduling; covering single-and multi-processor systems, and  ...  This tutorial style review provides an in-depth assessment of priority assignment techniques for hard real-time systems scheduled using fixed priorities.  ...  Research into fixed priority scheduling with deferred pre-emption has one of its practical applications in automotive systems.  ... 
doi:10.1016/j.sysarc.2016.04.002 fatcat:ziodjnqp7jby5pskfspogugd4u

Efficient schedulability tests for real-time embedded systems with urgent routines

J. Augusto Santos, George Lima, Konstantinos Bletsas
2013 Design automation for embedded systems  
Although fixed-priority schedulers such as Rate-Monotonic (RM) are in line with this need, they usually make a low processor utilization available to the system.  ...  In this paper we describe a scheduling model according to which urgent routines are executed at the highest priority level and all other system tasks are scheduled by EDF.  ...  can be scheduled either in a fixed-priority fashion or by EDF.  ... 
doi:10.1007/s10617-013-9113-6 fatcat:bsqncyox2nbnxfmdhxlbmqejnq

On priority assignment for controller area network when some message identifiers are fixed

Robert I. Davis, Alan Burns, Victor Pollex, Frank Slomka
2015 Proceedings of the 23rd International Conference on Real Time and Networks Systems - RTNS '15  
This paper addresses the problem of priority assignment when some message identifiers are fixed.  ...  Controller Area Network (CAN) is widely used in automotive applications.  ...  In 1994, Tindell et al. [24] , [25] , [26] showed how research into fixed priority scheduling for single processor systems could be adapted and applied to the scheduling of messages on CAN.  ... 
doi:10.1145/2834848.2834866 dblp:conf/rtns/DavisBPS15 fatcat:7nmjxsepnrfkbbmzck65hsjlti

OPTIMIZATION OF RESOURCE‐CONSTRAINED PROJECT SCHEDULES BY SIMULATED ANNEALING AND VARIABLE NEIGHBORHOOD SEARCH

Leonidas Sakalauskas, Gražvydas Felinskas
2006 Technological and Economic Development of Economy  
procedure applied.  ...  Schedule optimization procedures, based on schedule coding by priority list of jobs, are created and investigated.  ...  It is usually difficult to perform a full binary recombination in real computer time, therefore, in order to schedule and optimize jobs, we may apply heuristic methods based on priority rules [4] , evolution  ... 
doi:10.3846/13928619.2006.9637759 fatcat:5u7walgomna7je6wp4ks6eiqcy

Experimental Evaluation of Global and Partitioned Semi-Fixed-Priority Scheduling Algorithms on Multicore Systems

Hiroyuki Chishiro, Nobuyuki Yamasaki
2012 2012 IEEE 15th International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing  
In addition, global semi-fixed-priority scheduling has lower overhead than partitioned semi-fixed-priority scheduling.  ...  Experimental results show that semi-fixed-priority scheduling has comparable overhead to fixed-priority scheduling.  ...  In addition, we evaluate the practicality of semi-fixed-priority scheduling on multicore systems.  ... 
doi:10.1109/isorc.2012.25 dblp:conf/isorc/ChishiroY12 fatcat:oicah4mxvjclvcfsw7c5kfuimu

Minimal energy fixed-priority scheduling for variable voltage processors

Gang Quan, Xiaobo Sharon Hu
2003 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
In this paper, we present an approach to finding the least-energy voltage schedule for executing real-time jobs on such a processor according to a fixed priority, preemptive policy.  ...  To fully exploit the benefit of variable voltage processors, voltage schedules must be designed in the context of work load requirement.  ...  However, none of the above approaches can be simply applied to address the optimal voltage scheduling problem for systems employing a fixed-priority preemptive scheme.  ... 
doi:10.1109/tcad.2003.814948 fatcat:usm3k3yu25ejphyxvtkfzr64bq

Power conscious fixed priority scheduling for hard real-time systems

Youngsoo Shin, Kiyoung Choi
1999 Proceedings of the 36th ACM/IEEE conference on Design automation conference - DAC '99  
This paper presents a powerefficient version of a widely used fixed priority scheduling method.  ...  The method yields a power reduction by exploiting slack times, both those inherent in the system schedule and those arising from variations of execution times.  ...  In particular, we focus our attention on fixed priority scheduling and propose its power-efficient version, which we call Low Power Fixed Priority Scheduling (LPFPS).  ... 
doi:10.1145/309847.309901 dblp:conf/dac/ShinC99 fatcat:x7cx4wrmxnd6tgwu6d66pf263m

Off-line (Optimal) multiprocessor scheduling of dependent periodic tasks

Julie Baro, Frédéric Boniol, Mikel Cordovilla, Eric Noulard, Claire Pagetti
2012 Proceedings of the 27th Annual ACM Symposium on Applied Computing - SAC '12  
We propose two orthogonal approaches: (1) an off-line computation of a valid fixed priority assignment (2) a computation of an off-line schedule.  ...  Even if the problems are NP-complete, we obtain rather reasonable performances as illustrated in the benchmarks.  ...  However, it may fail in practice because of the state space size. OPTIMAL FIXED PRIORITY ASSIGN-MENT In multiprocessor case, no simple algorithm is known for assigning the priorities.  ... 
doi:10.1145/2245276.2232071 dblp:conf/sac/BaroBCNP12 fatcat:kv7jhlbz3jbgfhhfaojjfpopam

Resource Kernels: A Resource-Centric Approach to Real-Time and Multimedia Systems [chapter]

Raj Rajkumar, Kanaka Juvva, Anastasio Molano, Shuichi Oikawa
2002 Readings in Multimedia Computing and Networking  
can assume in practice that system resources are made available to them as they need them.  ...  These systems are typically built using timeline based approaches, production/consumption rates [9] or priority-based schemes, where the resource demands are mapped to specific time slots or priority levels  ...  The deadline-monotonic priority assignment algorithm is an optimal fixed priority algorithm when D i ≤ T i [17] .  ... 
doi:10.1016/b978-155860651-7/50127-3 fatcat:5vbfa3i4tnb45eqr4jv3ktq7zm

Resource kernels: a resource-centric approach to real-time and multimedia systems

Ragunathan Rajkumar, Kanaka Juvva, Anastasio Molano, Shuichi Oikawa, Kevin Jeffay, Dilip D. Kandlur, Timothy Roscoe
1997 Multimedia Computing and Networking 1998  
can assume in practice that system resources are made available to them as they need them.  ...  These systems are typically built using timeline based approaches, production/consumption rates [9] or priority-based schemes, where the resource demands are mapped to specific time slots or priority levels  ...  The deadline-monotonic priority assignment algorithm is an optimal fixed priority algorithm when D i ≤ T i [17] .  ... 
doi:10.1117/12.298417 fatcat:j4ystzqwpndebllhaql3kqlctu

Energy-aware Fixed-Priority Multi-core Scheduling for Real-time Systems [article]

Yao Guo, Junyang Lu
2015 arXiv   pre-print
While fixed-priority scheduling with task-splitting in real-time systems are widely applied, current approaches have not taken into consideration energy-aware aspects such as dynamic voltage/frequency  ...  In this paper, we propose two strategies to apply dynamic voltage scaling (DVS) to fixed-priority scheduling algorithms with task-splitting for periodic real-time tasks on multi-core processors.  ...  The main contribution of this paper is that we explored the possibility of applying DVS to semi-partitioned fixed-priority multi-core scheduling algorithms.  ... 
arXiv:1512.07351v1 fatcat:nsnmlmqvg5am5h27bjibrebwte

Genealogy of hard real-time preemptive scheduling algorithms for identical multiprocessors

Dirk Müller, Matthias Werner
2011 Open Computer Science  
AbstractWith the advent of multi-core computer systems, real-time (RT) scheduling on multiprocessors (MPs) is gaining more and more practical relevance.  ...  Basic algorithms developed in the 1970s or earlier are strongly influential on state-of-the-art preemptive hard real-time scheduling algorithms.  ...  This optimal threshold choice is given in the fpEDF (fixed-priority EDF) algorithm [12] .  ... 
doi:10.2478/s13537-011-0023-z fatcat:zbzshcwvivd2pe7xm23o54ux2q
« Previous Showing results 1 — 15 out of 120,493 results