5,462 Hits in 2.8 sec

Portioned static-priority scheduling on multiprocessors

Shinpei Kato, Nobuyuki Yamasaki
2008 Proceedings, International Parallel and Distributed Processing Symposium (IPDPS)  
They rather perform far poorly depending on properties of task sets. Therefore, alternative scheduling techniques specific for multiprocessor platforms have been discussed recently.  ...  Introduction Embedded real-time applications in recent years have relied on a power of multiprocessor platforms.  ...  In recent years, Andersson et al. proved that static-priority scheduling is also able to achieve a utilization bound of 50% on multiprocessors, though no higher bounds cannot be obtained [3] .  ... 
doi:10.1109/ipdps.2008.4536299 dblp:conf/ipps/KatoY08 fatcat:vythwsrfgjbrjbjpw2bqxgloim

Load regulating algorithm for static-priority task scheduling on multiprocessors

Risat Mahmud Pathan, Jan Jonsson
2010 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)  
To allow mixed-criticality tasks to be hosted on the same multiprocessor platform, a new algorithm for fixed-priority scheduling is proposed.  ...  This thesis deals with global multiprocessor scheduling for real-time systems, that is, the fixed-priority scheduling of sporadic tasks, where each task is allowed to run on any processor.  ...  Ha and Liu's work also implies that global static-priority scheduling of sporadic tasks on multiprocessors is predictable [And08a] . Lemma 5.6.  ... 
doi:10.1109/ipdps.2010.5470458 dblp:conf/ipps/PathanJ10 fatcat:3e3atgozcjecdhhwxoubs6xtui

Competitive Analysis of Static-Priority Partitioned Scheduling on Uniform Multiprocessors

Bjorn Andersson, Eduardo Tovar
2007 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007)  
No such guarantees are previously known for partitioned static-priority scheduling on uniform multiprocessors..  ...  No such guarantees are previously known for partitioned static-priority scheduling on uniform multiprocessors.  ...  This work was partially funded by the Portuguese Science and Technology Foundation (Fundação para Ciência e Tecnologia -FCT) and the ARTIST2 Network of Excellence on Embedded Systems Design.  ... 
doi:10.1109/rtcsa.2007.31 dblp:conf/rtcsa/AnderssonT07 fatcat:26bw2hn26vek7pr4ymeminf7jq

The Partitioned, Static-Priority Scheduling of Sporadic Real-Time Tasks with Constrained Deadlines on Multiprocessor Platforms [chapter]

Nathan Fisher, Sanjoy Baruah
2006 Lecture Notes in Computer Science  
We consider the partitioned scheduling of sporadic, hard-realtime tasks on a multiprocessor platform with static-priority scheduling policies.  ...  Most previous work on the static-priority scheduling of sporadic tasks upon multiprocessors has assumed implicit deadlines (i.e. a task's relative deadline is equal to its period).  ...  Conclusions and Future Work Prior theoretical research [12, 24] on the static-priority scheduling of sporadic task systems upon partitioned multiprocessors has assumed that a task's deadline is equal  ... 
doi:10.1007/11795490_23 fatcat:d5e23aj5pfbupo5dapd5wyunqa

Static-priority scheduling on multiprocessors

B. Andersson, S. Baruah, J. Jonsson
Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420)  
It is also shown that no static-priority multiprocessor scheduling algorithm (partitioned or global) can guarantee schedulability for a periodic task set with a utilization higher than one half the capacity  ...  The preemptive scheduling of systems of periodic tasks on a platform comprised of several identical processors is considered.  ...  prove very useful to us in our study of static-priority multiprocessor scheduling.  ... 
doi:10.1109/real.2001.990610 dblp:conf/rtss/AnderssonBJ01 fatcat:zjrwfyjqvfbt3aaqribnuxyg6i

Static-priority periodic scheduling on multiprocessors

S. Ramamurthy, M. Moir
Proceedings 21st IEEE Real-Time Systems Symposium  
We present a new sufficient condition for the schedulability of preemptable, periodic, hard-real-time task sets using the very simple static-priority weight-monotonic scheduling scheme.  ...  Our condition improves on the previous one in two important ways. First, it can determine that task sets with high utilization and many tasks are schedulable, while the previous condition cannot.  ...  The focus of this paper is on a static-priority scheme for scheduling periodic, preemptible and migratable hard realtime tasks in multiprocessors.  ... 
doi:10.1109/real.2000.895997 dblp:conf/rtss/RarnarnurthyM00 fatcat:jsyutw6lxndkrjrvnczhxtr7x4

The utilization bounds of partitioned and pfair static-priority scheduling on multiprocessors are 50%

B. Andersson, J. Jonsson
15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.  
This paper studies preemptive static-priority scheduling on multiprocessors.  ...  It is known that no static-priority multiprocessor scheduling algorithm can achieve a utilization bound greater than 50%.  ...  The design space of preemptive static-priority multiprocessor scheduling algorithms can be categorized by partitioned vs global scheduling and static-priority pfair vs traditional static-priority scheduling  ... 
doi:10.1109/emrts.2003.1212725 dblp:conf/ecrts/AnderssonJ03 fatcat:qrustinqw5cahph5pzfgrsiwrm

Page 968 of IEEE Transactions on Computers Vol. 52, Issue 7 [page]

2003 IEEE Transactions on Computers  
To our knowledge, there has been no prior work done on static-priority scheduling IEEE TRANSACTIONS ON COMPUTERS, VOL. 52, NO. 7, JULY 2003 upon uniform multiprocessors The partioned approach to static  ...  to static-priority scheduling on identical multiprocessors are incomparable in the sense that 1) there are task systems that are feasible on m identical processors under the partitioned approach but for  ... 

A schedulability analysis for weakly hard real-time tasks in partitioning scheduling on multiprocessor systems

Habibah Ismail, Dayang N. A. Jawawi
2014 2014 8th. Malaysian Software Engineering Conference (MySEC)  
) combining with the exact analysis, called hyperperiod analysis and deadline models; weakly hard constraints and µpattern are present to provide weakly hard real-time guarantees under static priority  ...  As a systems demand complex and significantly increased functionality, multiprocessor scheduling has been given attention and taken into consideration.  ...  Static priority scheduling is considered in order to handle overloads. In static schemes, processes are assign to a fixed priority.  ... 
doi:10.1109/mysec.2014.6985998 fatcat:7mkzisq7ibfdfbqqrpa2vsbiee

Rate-monotonic scheduling on uniform multiprocessors

S.K. Baruah, J. Goossens
2003 IEEE transactions on computers  
The scheduling of systems of periodic tasks on uniform multiprocessor platforms using the rate-monotonic scheduling algorithm is considered here.  ...  earlier results concerning rate-monotonic scheduling upon identical multiprocessor platforms.  ...  That is, we have studied the behaviour of Algorithm RM -one such previouslydefined [10, 2] static-priority global scheduling algorithm -upon uniform multiprocessor platforms.  ... 
doi:10.1109/tc.2003.1214344 fatcat:bbpwddjscrepfpt7urfhzpvira

Investigation of implementing a synchronization protocol under multiprocessors hierarchical scheduling

Farhang Nemati, Moris Behnam, Thomas Nolte, Reinder J. Bril
2009 2009 IEEE Conference on Emerging Technologies & Factory Automation  
In the multi-core and multiprocessor domain, there has been considerable work done on scheduling techniques assuming that real-time tasks are independent.  ...  In this paper we investigate the possibilities of extending multiprocessor hierarchical scheduling to support an existing synchronization protocol (FMLP) in multiprocessor systems.  ...  Cluster-based scheduling can be physical or virtual. In physical cluster-based scheduling each of cluster's processors are statically mapped to one of processors of the multiprocessor [9] .  ... 
doi:10.1109/etfa.2009.5347221 dblp:conf/etfa/NematiBNB09 fatcat:zgnp6kc4ovegho3m5afr63rqra

A Survey on Scheduling Approaches for Hard Real-Time Systems

Mehrin Rouhifar, Reza Ravanmehr
2015 International Journal of Computer Applications  
Finally, the analysis and evaluation of the mentioned methods are shown based on the schedulability of task sets and efficiency.  ...  This paper composed of two parts; first part surveyed the basic hard RTS scheduling algorithms that guarantee the on-time completion of the tasks.  ...  Static Algorithms Some of the most important static-priority scheduling algorithms are described as follows:  RM (Rate Monotonic) RM is a preemptive and static priority scheduling algorithm on uniprocessor  ... 
doi:10.5120/ijca2015907656 fatcat:na7u3dgqsjhphl253ecd22jkau

Response-time analysis of arbitrarily activated tasks in multiprocessor systems with shared resources

M. Negrean, S. Schliecker, R. Ernst
2009 2009 Design, Automation & Test in Europe Conference & Exhibition  
Furthermore, we derive an improved bound on the blocking time in this setup for the case where the shared resources are protected according to the Multiprocessor Priority Ceiling Protocol (MPCP).  ...  As multiprocessor systems are increasingly used in real-time environments, scheduling and synchronization analysis of these platforms receive growing attention.  ...  Multiprocessor response time analysis In this section, we provide the schedulability condition for tasks under the partitioned multiprocessor static priority preemptive scheduling with shared resources  ... 
doi:10.1109/date.2009.5090720 dblp:conf/date/NegreanSE09 fatcat:mpdsospdfvdqjlvkaaaapuao3m


Habibah Ismail, Dayang N. A. Jawawi
2015 Jurnal Teknologi  
priority scheduling.  ...  In this paper, a weakly hard scheduling approach has been proposed and schedulability analysis of proposed approach consists of the partitioned multiprocessor scheduling techniques with solutions for the  ...  Fisher et al. presented a polynomial-time partitioning approach for general sporadic task systems on an identical multiprocessor platform when static-priority scheduling policies are used on each processor  ... 
doi:10.11113/jt.v77.6204 fatcat:2enfmudg7rewnje3ttsqhjip6a

Sustainability in static-priority restricted-migration scheduling

Frédéric Fauberteau, Serge Midonnet
2012 Proceedings of the 2012 ACM Research in Applied Computation Symposium on - RACS '12  
In this paper, we focus on the static-priority scheduling of periodic hard real-time tasks upon identical multiprocessor platforms.  ...  We present a static-priority restricted-migration scheduling algorithm and we prove it does not suffer from these anomalies.  ...  A static-priority schedulability test is in general lowerpriority-agnostic.  ... 
doi:10.1145/2401603.2401692 dblp:conf/racs/FauberteauM12 fatcat:trk3oqslvffrfmscst3mxj4qey
« Previous Showing results 1 — 15 out of 5,462 results