A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Filters
Rate-monotonic scheduling on uniform multiprocessors
2003
IEEE transactions on computers
Preserved Fulltext
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. ...
In [2] , the rate-monotonic scheduling of periodic real-time task systems upon identical multiprocessor platforms was studied. ...
doi:10.1109/tc.2003.1214344
fatcat:bbpwddjscrepfpt7urfhzpvira
Page 966 of IEEE Transactions on Computers Vol. 52, Issue 7
[page]
2003
IEEE Transactions on Computers
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The rate-monotonic scheduling of systems of periodic tasks on uniform multiprocessor platforms is considered here. ...
Yelick The Case for Intelligent RAM IRAM FEM Apr. 1997
IEEE TRANSACTIONS ON COMPUTERS, VOL. 52, NO.7, JULY 2003
Rate-Monotonic Scheduling on Uniform Multiprocessors
Sanjoy K. ...
Predictability of Fixed-Job Priority Schedulers on Heterogeneous Multiprocessor Real-Time Systems
[article]
2009
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
A convenient consequence is the fact that any FJP schedulers are predictable on uniform multiprocessors. ...
Our main contribution is to show that any FJP schedulers are predictable on unrelated platforms. ...
Popular FJP schedulers include: the Rate Monotonic (RM), the Deadline Monotonic (DM) and the Earliest Deadline First (EDF) [5] . ...
arXiv:0908.3519v1
fatcat:qwgz6oeg2jcrvpcnwmzcwpnn6q
Deadline Monotonic Scheduling on Uniform Multiprocessors
[chapter]
2008
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
The scheduling of sporadic task systems upon uniform multiprocessor platforms using global Deadline Monotonic algorithm is studied. A sufficient schedulability test is presented and proved correct. ...
Deadline Monotonic scheduling. ...
tasks that are scheduled on identical multiprocessors. ...
doi:10.1007/978-3-540-92221-6_8
fatcat:5fgm33324nhjdpdpsos7f7k5si
Parameterized Schedulability Analysis on Uniform Multiprocessors
2010
2010 39th International Conference on Parallel Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper addresses global rate-monotonic scheduling of implicit-deadline periodic real-time tasks on uniform multiprocessor platforms. ...
Finally, we show that our proposed simple rate-monotonic schedulability conditions for uniform and unit-capacity multiprocessors have higher worst-case system utilization than all other state-of-the-art ...
Conclusion In this paper we have proposed schedulability conditions for global rate-monotonic scheduling of implicit-deadline tasks on multiprocessors. ...
doi:10.1109/icpp.2010.40
dblp:conf/icpp/PathanJ10
fatcat:4xnqsrdguzapxetcowltnmiuqi
Competitive Analysis of Static-Priority Partitioned Scheduling on Uniform Multiprocessors
2007
13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
On each processor, tasks are scheduled with rate-monotonic. ...
On each processor, tasks are scheduled according to rate-monotonic. ...
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
Genealogy of hard real-time preemptive scheduling algorithms for identical multiprocessors
2011
Open Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
AbstractWith the advent of multi-core computer systems, real-time (RT) scheduling on multiprocessors (MPs) is gaining more and more practical relevance. ...
The important question for a set of RT scheduling algorithms serving as a basis for more sophisticated ones will be dealt with. ...
Acknowledgments The authors would like to thank Ted Baker for useful comments on a preliminary version of this article. ...
doi:10.2478/s13537-011-0023-z
fatcat:zbzshcwvivd2pe7xm23o54ux2q
Harmonic-Fit Partitioned Scheduling for Fixed-Priority Real-Time Tasks on the Multiprocessor Platform
2011
2011 IFIP 9th International Conference on Embedded and Ubiquitous Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a novel multiprocessor partitioned scheduling algorithm for fixed-priority sporadic real-time tasks based on the Rate Monotonic Scheduling (RMS) policy. ...
One common approach for partitioned multiprocessor scheduling problem is to transform this problem into a traditional bin-packing problem, with the utilization of a task being the "size" of the object ...
To this end, we study the problem of scheduling real-time tasks on multiprocessor architecture based on the Rate Monotonic Scheduling (RMS) policy. ...
doi:10.1109/euc.2011.41
dblp:conf/euc/FanQ11
fatcat:ubxxm22b4jg2flc4t6toayhmmi
An Algorithm to Reduce the Time Complexity of Earliest Deadline First Scheduling Algorithm in Real-Time System
2011
International Journal of Advanced Computer Science and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
To this paper we have study to Reduce the time Complexity of Earliest Deadline First (EDF), a global scheduling scheme for Earliest Deadline First in Real Time System tasks on a Multiprocessors system. ...
Therefore, a job will continue its execution on the same processor if possible (processor affinity). ...
EDF is an appropriate algorithm to use for online scheduling on uniform multiprocessors. ...
doi:10.14569/ijacsa.2011.020207
fatcat:wqj3cd74hjcgnf2elocwqdeuxi
Page 341 of IEEE Transactions on Computers Vol. 52, Issue 3
[page]
2003
IEEE Transactions on Computers
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
»pen- | the asses raint than
LAUZA ET AL.: AN IMPROVED RATE-MONOTONIC ADMISSION CONTROL AND ITS APPLICATIONS 341 BAe: I , T i, T; Yr ‘Te I ~<a «= ie tie @ ive | Processor |: r= 1.20 Processor 2: r= 1.16 ...
RMGT isa multiprocessor scheduling technique developed by Burchard et al. in [2]. ...
Optimal task allocation in hypercube multiprocessor ensembles
1993
Computers and Mathematics with Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Criteria are established to determine the optimal policy for allocating a set of uniform tasks onto a multiprocessor hypercube ensemble. ...
Comparing the schedule lengths S, and S* for the uniform and non-uniform allocations, the inequality S, < S holds whenever ...
We develop an analytical model for the optimal allo cation of uniform task systems on a hypercube-interconnected multiprocessor with the goal of minimizing the maximum schedule length (including execution ...
doi:10.1016/0898-1221(93)90055-z
fatcat:5plq32nl4rcg5kh2x7zuthknny
An Evolutionary Approach for the Hierarchical Scheduling of Safety- and Security-Critical Multicore Architectures
2020
Computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Most, if not all, embedded processor manufacturers have already moved towards system-on-a-chip multicore architectures. ...
The simulation results show the genetic algorithm had 1.8–2.5 times less error (a 56–71% difference), outperforming its counterparts in uniformity in utilization. ...
From their seminal work on schedulability analysis, Liu and Layland [12] set the groundwork that spawned rate monotonic analysis (RMA) and rate monotonic scheduling (RMS) for hard real-time priority ...
doi:10.3390/computers9030071
fatcat:5dlwuef3cnh2rfya4xq7ihp6qa
Feasibility Intervals for Fixed-Priority Real-Time Scheduling on Uniform Multiprocessors
2006
2006 IEEE Conference on Emerging Technologies and Factory Automation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
In this paper we study the global scheduling of periodic task systems upon uniform multiprocessor platforms. ...
We first show two very general properties which are wellknown for uniprocessor platforms and which remain for multiprocessor one: (i) under few and not so restrictive assumptions, we show that any feasible ...
Dhall and Liu [3] showed that the Rate Monotonic (RM) and Earliest Deadline First (EDF) do not provide a feasible schedule for arbitrary low processor utilization. ...
doi:10.1109/etfa.2006.355388
dblp:conf/etfa/CucuG06
fatcat:rvdhzntr35hafjl4erjdggjtuq
Dynamic voltage and frequency scaling for optimal real-time scheduling on multiprocessors
2008
2008 International Symposium on Industrial Embedded Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
previous work are presented for multiprocessor systems. ...
Optimal real-time scheduling is effective to not only schedulability improvement but also energy efficiency for the systems. ...
Pillai and Shin [10] show a RT-SVFS technique based on the optimal real-time scheduling algorithm EDF [2] . Our uniform RT-SVFS on multiprocessors is analogous to EDFbased RT-SVFS. ...
doi:10.1109/sies.2008.4577677
dblp:conf/sies/FunaokaTKY08
fatcat:62byhsq5effx3mgxygzom7kab4
An Analysis of Fixed-Priority Schedulability on a Multiprocessor
2006
Real-time systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
A task set may have processor utilization arbitrarily close to 1 and still not be schedulable on m processors using rate monotonic or earliest-deadline-first scheduling. ...
individual task is at most m/(3m − 2) can be scheduled successfully on m processors using rate monotonic scheduling if the total utilization is at most m 2 /(3m − 1). ...
These improve on previously known multiprocessor RM schedulability conditions by relaxing the assumptions of rate monotonic priorities and deadline being equal to period. ...
doi:10.1007/s11241-005-4686-1
fatcat:td7bl3vqefacppnciynigzxcim
« Previous
Showing results 1 — 15 out of 1,034 results