Filters








382 Hits in 3.7 sec

Characteristics of EDF schedulability on uniform multiprocessors

S. Funk, S. Baruah
15th Euromicro Conference on Real-Time Systems, 2003. Proceedings.  
In designing an EDF-schedulability test for uniform multiprocessors, therefore, our approach is as follows: for a given uniform multiprocessor platform, we attempt to efficiently identify all those uniform  ...  The focus of this paper is the design of efficient tests for determining whether the Earliest Deadline First Scheduling Algorithm (EDF) can successfully schedule a given real-time task system to meet all  ...  a uniform multiprocessor π ∈ Ψ(a, b), then I is guaranteed to be EDF-schedulable on π.  ... 
doi:10.1109/emrts.2003.1212746 dblp:conf/ecrts/FunkB03 fatcat:xb42jhuznvg47efgringwfjaau

Page 1185 of IEEE Transactions on Computers Vol. 52, Issue 9 [page]

2003 IEEE Transactions on Computers  
EDF. 1.2 This Research In this paper, we explore the issue of online scheduling of hard-real-time systems on uniform multiprocessors.  ...  The earliest- deadline-first (EDF) scheduling of hard-real-time systems upon uniform multiprocessor machines is considered.  ... 

Robustness results concerning EDF scheduling upon uniform multiprocessors

S. Baruah, S. Funk, J. Goossens
2003 IEEE transactions on computers  
The earliestdeadline-first (EDF) scheduling of hard-real-time systems upon uniform multiprocessor machines is considered.  ...  It is shown that EDF scheduling upon uniform multiprocessors is robust with respect to both job execution requirements and processor computing capacity.  ...  Online Scheduling on Multiprocessors Online scheduling algorithms make scheduling decisions at each time-instant based upon the characteristics of the jobs that have arrived thus far, with no knowledge  ... 
doi:10.1109/tc.2003.1228513 fatcat:hbfvgtaanzbrjik54225ugdm3q

Restricting EDF migration on uniform heterogeneous multiprocessors

Shelby Funk, Sanjoy K. Baruah
2005 Techniques et sciences informatiques  
A utilization-based test for restricted migration on uniform multiprocessors is presented where each processor schedules jobs using the earliest deadline first (EDF) scheduling algorithm. RÉSUMÉ.  ...  Restricted migration of periodic and sporadic tasks on uniform heterogeneous multiprocessors is considered.  ...  Restricting migration In this section, we will determine a schedulability test for restricted migration EDF scheduling on uniform heterogeneous multiprocessors, denoted r-EDF.  ... 
doi:10.3166/tsi.24.917-938 fatcat:usouain4mrcrxdqgpnnotnxysq

A Fuzzy-Based Multi-criteria Scheduler for Uniform Multiprocessor Real-Time Systems

Vahid Salmani, Roya Ensafi, Narges Khatib-Astaneh, Mahmoud Naghibzadeh
2007 10th International Conference on Information Technology (ICIT 2007)  
In this paper a new algorithm based on fuzzy logic for scheduling soft real-time tasks on uniform multiprocessors is presented.  ...  It has been proved that there is no optimal online scheduler for uniform parallel machines. Despite its nonoptimality, EDF is an appropriate algorithm to use in such environments.  ...  In [7] Baruah et al. came to the conclusion that despite its non-optimality, EDF is an appropriate algorithm to use for online scheduling on uniform multiprocessors.  ... 
doi:10.1109/icoit.2007.4418292 fatcat:b5fbynaoefa5hantggfqg6k2cy

A Fuzzy-Based Multi-criteria Scheduler for Uniform Multiprocessor Real-Time Systems

Vahid Salmani, Roya Ensafi, Narges Khatib-Astaneh, Mahmoud Naghibzadeh
2007 10th International Conference on Information Technology (ICIT 2007)  
In this paper a new algorithm based on fuzzy logic for scheduling soft real-time tasks on uniform multiprocessors is presented.  ...  It has been proved that there is no optimal online scheduler for uniform parallel machines. Despite its nonoptimality, EDF is an appropriate algorithm to use in such environments.  ...  In [7] Baruah et al. came to the conclusion that despite its non-optimality, EDF is an appropriate algorithm to use for online scheduling on uniform multiprocessors.  ... 
doi:10.1109/icit.2007.56 dblp:conf/cit/SalmaniEKN07 fatcat:ylweumbiq5c3rkbbkirzausyxm

An Algorithm to Reduce the Time Complexity of Earliest Deadline First Scheduling Algorithm in Real-Time System

Jagbeer Singh, Bichitrananda Patra, Satyendra Prasad
2011 International Journal of Advanced Computer Science and Applications  
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.  ...  The Aim of this work is to provide a sensitivity analysis for task deadline context of multiprocessor system by using a new approach of EFDF (Earliest Feasible Deadline First) algorithm.  ...  Also a note to all professors here in GIET for the wisdom and knowledge that they given us, all of which came together in the making of this paper.  ... 
doi:10.14569/ijacsa.2011.020207 fatcat:wqj3cd74hjcgnf2elocwqdeuxi

M-CASH: A real-time resource reclaiming algorithm for multiprocessor platforms

Rodolfo Pellizzoni, Marco Caccamo
2008 Real-time systems  
improving the response times of aperiodic and soft tasks in the presence of overruns.  ...  In this paper, we introduce algorithm M-CASH, a new efficient reclaiming scheme for multiprocessor platforms.  ...  The main intuition is that server jobs £ u P have the same characteristics of M-CBS server jobs, and are therefore schedulable on the uniform platform.  ... 
doi:10.1007/s11241-008-9051-8 fatcat:4zsjczpsajgvnkcgpr6eyeijuy

Tardiness Reduction Technique for Multiprocessor Scheduling based on New Assignment Strategy
English

Ms. Neha Jain, Mrs. Varsha Zokakar
2015 International Journal of Computer Trends and Technology  
In this paper, an EDF-Fm based algorithm has been simulated for the multiprocessor scheduling. The tardiness in the processes is the key parameter has been considered for the effective scheduling.  ...  In the real-time system, scheduling is an important factor which decides a schedule for a set of tasks.  ...  Anderson have proposed a method for "tardiness bounds under global EDF scheduling on a Multiprocessor".  ... 
doi:10.14445/22312803/ijctt-v25p107 fatcat:gxzl7anwv5g4rgee4co6w5gnqe

Feasibility Intervals for Fixed-Priority Real-Time Scheduling on Uniform Multiprocessors

Liliana Cucu, Joel Goossens
2006 2006 IEEE Conference on Emerging Technologies and Factory Automation  
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  ...  A better understanding of hard real-time scheduling on identical multiprocessors was provided through [6, 7, 8, 9, 10] . Recent results concern uniform multiprocessors [7, 11, 12, 13, 14] .  ... 
doi:10.1109/etfa.2006.355388 dblp:conf/etfa/CucuG06 fatcat:rvdhzntr35hafjl4erjdggjtuq

Performance evaluation of RUNT algorithm

Hiroyuki Chishiro, Masayoshi Takasu, Rikuhei Ueda, Nobuyuki Yamasaki
2016 ACM SIGBED Review  
This paper evaluates the performance of Reduction to Uniprocessor Transformation (RUNT) with Voltage and Frequency Scaling, called Static RUNT (S-RUNT) and Dynamic RUNT (D-RUNT), respectively.  ...  In addition, the idle task assignment policy saves more energy consumption in D-RUNT and D-RUNT outperforms S-RUNT if the actual case execution time of each task is shorter than its worst case execution  ...  RUNT supports RT-SVFS/RT-DVFS techniques on uniform/independent VFS multiprocessor systems, called Static Uniform RUNT (SU-RUNT), Static Independent RUNT (SI-RUNT), Dynamic Uniform RUNT (DU-RUNT), and  ... 
doi:10.1145/2907972.2907974 fatcat:n3jxtojeqncjxc3dnlepoqfi7q

Deadline Scheduling with Processor Affinity and Feasibility Check on Uniform Parallel Machines

Vahid Salmani, Mahmoud Naghibzadeh, Mohsen Kahani
2007 7th IEEE International Conference on Computer and Information Technology (CIT 2007)  
In this paper a new deadlinebased algorithm for scheduling real-time tasks on uniform parallel machines is presented. The performance of this algorithm is then compared with that of EDF algorithm.  ...  It has been proved that there is no optimal online scheduler for uniform parallel machines. Despite its non-optimality, EDF is an appropriate algorithm to use in such environments.  ...  In [3] Baruah et al. came to the conclusion that despite its non-optimality, EDF is an appropriate algorithm to use for online scheduling on uniform multiprocessors.  ... 
doi:10.1109/cit.2007.121 dblp:conf/IEEEcit/SalmaniNK07 fatcat:yvrerwfo4zamvex3nznxkwt2py

Thermal-aware global real-time scheduling and analysis on multicore systems

Nathan Fisher, Jian-Jia Chen, Shengquan Wang, Lothar Thiele
2011 Journal of systems architecture  
By deriving an ideally preferred speed for each core, we propose global scheduling algorithms which can exploit the flexibility of multicore platforms at low temperature.  ...  We perform simulations to evaluate the performance of the proposed approach.  ...  Then, in Section 3.2, we will summarize the schedulability conditions of global scheduling in uniform multiprocessor systems, following the derivation of preferred speeds based on the necessary schedulability  ... 
doi:10.1016/j.sysarc.2010.09.010 fatcat:wkdwqztrsvhdhh4h3famzykm5a

Thermal-Aware Global Real-Time Scheduling on Multicore Systems

Nathan Fisher, Jian-Jia Chen, Shengquan Wang, Lothar Thiele
2009 2009 15th IEEE Real-Time and Embedded Technology and Applications Symposium  
, such as the global earliest-deadline-first (EDF) scheduling policy and the global deadline-monotonic (DM) scheduling policy.  ...  scheduling of periodic real-time tasks or a set of job instances without periodicity.  ...  for global scheduling upon uniform multiprocessor platforms, in which we will develop our approach based on their results.  ... 
doi:10.1109/rtas.2009.34 dblp:conf/rtas/FisherCWT09 fatcat:osek4tcxgbczzbxykjl5g4suyi

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.  ...  [16] proposed a partitioned EDF scheduling approach on the unrelated multiprocessor platforms.  ... 
doi:10.5120/ijca2015907656 fatcat:na7u3dgqsjhphl253ecd22jkau
« Previous Showing results 1 — 15 out of 382 results