224 Hits in 8.1 sec

KTS: a real-time mapping algorithm for NoC-based many-cores

Audrey Queudet, Nadine Abdallah, Maryline Chetto
2017 Journal of Supercomputing  
This paper addresses the mapping problem of hard real-time task sets on NoC-based many-core processors. Our main contribution is a novel static mapping scheme called K-level task splitting (KTS).  ...  We evaluate the efficiency of KTS, demonstrating that it is a good compromise between existing semi-partitioned schemes (with possible migrations) and fully partitioned approaches.  ...  In [6] , Burns et al. introduced an EDF-based task splitting scheme called EDF Split (DD).  ... 
doi:10.1007/s11227-017-1962-5 fatcat:xal5duyl7rao7ch4tqonccpvi4

Guest editorial—RTNS 2010

Sanjoy Baruah, Yves Sorel
2011 Real-time systems  
The paper entitled "Partitioned EDF Scheduling for Multiprocessors using a C = D Task Splitting Scheme" is written by Alan Burns, Robert Davis, Pengyu Wang and Fengxiang Zhang.  ...  It introduces an EDF-based task-splitting scheme for scheduling multiprocessor systems.  ...  The paper entitled "Globally Scheduled Real-Time Multiprocessor Systems with GPUs" by Glenn Elliot and James Anderson presents two analysis methods for integrating GPUs into soft real-time multiprocessor  ... 
doi:10.1007/s11241-011-9143-8 fatcat:6zu7dadiyzeczez323pmkliviu

Scheduling Arbitrary-Deadline Sporadic Task Systems on Multiprocessors

Björn Andersson, Konstantinos Bletsas, Sanjoy Baruah
2008 2008 Real-Time Systems Symposium  
This algorithm can be used for two distinct purposes: for actually scheduling specific sporadic task systems, and for feasibility analysis.  ...  A new algorithm is proposed for scheduling preemptible arbitrary-deadline sporadic task systems upon multiprocessor platforms, with interprocessor migration permitted.  ...  It is known [9] that: dbf(τ, L) = τj ∈τ max(0, L − D j T j + 1) · C j (9) It has been shown [9] that for EDF scheduling on a single processor, all deadlines for tasks in τ are met if and only if ∀L  ... 
doi:10.1109/rtss.2008.44 dblp:conf/rtss/AnderssonBB08 fatcat:bw4ugrmlmbgtzp6ocmqk4kpk2q

Tardiness Reduction Technique for Multiprocessor Scheduling based on New Assignment Strategy

Ms. Neha Jain, Mrs. Varsha Zokakar
2015 International Journal of Computer Trends and Technology  
In the real-time system, scheduling is an important factor which decides a schedule for a set of tasks.  ...  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.  ...  Some of these algorithms are used for scheduling tasks on multiprocessor system either under the partitioning scheme or under the global scheduling scheme.  ... 
doi:10.14445/22312803/ijctt-v25p107 fatcat:gxzl7anwv5g4rgee4co6w5gnqe

Real-Time Scheduling with Task Splitting on Multiprocessors

Shinpei Kato, Nobuyuki Yamasaki
2007 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007)  
The algorithm is based on an unorthodox method called portioned scheduling that assigns each task to a particular processor like partitioned scheduling but can split a task into two processors if there  ...  This paper presents a real-time scheduling algorithm with high schedulability and few preemptions for multiprocessor systems.  ...  To distinguish from the conventional partitioned scheduling scheme, we define a scheduling scheme that partitions the tasks but can split some of them into two portions if necessary to improve scheduling  ... 
doi:10.1109/rtcsa.2007.61 dblp:conf/rtcsa/KatoY07 fatcat:gnak6cy2o5gnphylvgt3c2mlny

Temporal Consistency Maintenance Upon Partitioned Multiprocessor Platforms

Jianjun Li, Jian-Jia Chen, Ming Xiong, Guohui Li, Wei Wei
2016 IEEE transactions on computers  
Firstly, we only consider the feasibility aspect of the problem by proposing two polynomial time partitioning schemes, Temporal Consistency Partitioning under EDF (TCP EDF ) and Temporal Consistency Partitioning  ...  In this paper, we study the workload-aware temporal consistency maintenance problem upon multiprocessor platforms. We consider the problem of how to partition a set of update transactions to m !  ...  ACKNOWLEDGMENTS A preliminary version of this paper appeared in [25]  ... 
doi:10.1109/tc.2015.2448088 fatcat:hdy6kbtf2zbgvcadfnjnfyncda

Supporting execution on multiprocessor platforms

A. Burns, A. J. Wellings
2010 ACM SIGAda Ada Letters  
A number of different mapping and scheduling approaches are advocated in the scheduling literature. The primitives in the language should allow these schemes to be directly supported.  ...  If Ada is going to be an effective language for multiprocessor systems then it needs to address the mapping issue that will allow the programmer to express their requirements for task to processor affinity  ...  The scheme uses EDF scheduling on each CPU with task-partitioning for most tasks.  ... 
doi:10.1145/1806546.1806548 fatcat:ak375amuyfflfblsv5hr2bstg4

EDF-Adaptive: A New Semipartitioned Scheduling Algorithm for Multiprocessor Real-Time

Shujuan Huang, Tiansen Li, Zhihao Ma, Feng Xiao, Wenjuan Zhang, Gengxin Sun
2021 Journal of Sensors  
Most of the multiprocessor real-time scheduling algorithms follow the partitioned approach, the global approach, or the semipartitioned approach which is a hybrid of the first two by allowing a small subset  ...  To address these issues, in this paper, we classify the systems into different types according to the utilization of their tasks and propose a new semipartitioned scheduling algorithm, earliest deadline  ...  Acknowledgments The authors would like to thank Professor Feng Tian for critically reviewing the manuscript.  ... 
doi:10.1155/2021/6377024 fatcat:6g325ofrofenlerngqsba7kwiu

Schedulability Analysis for Rate Monotonic Algorithm-Shortest Job First Using UML-RT

S. Ewins Pon Pushpa, Manamalli Devasikamani
2014 Modelling and Simulation in Engineering  
This paper presents a unified modeling approach for a newly proposed rate monotonic scheduling algorithm-shortest job first (RMA-SJF) for partitioned, semipartitioned and global scheduling strategies in  ...  multiprocessor architecture using UML-RT for different system loads.  ...  first) and D EDF (deadline monotonic earliest deadline first) in schedulability for the same load.  ... 
doi:10.1155/2014/206364 fatcat:lskl3lr6hrhuvgxf7mjrntuz5q

Portioned EDF-based scheduling on multiprocessors

Shinpei Kato, Nobuyuki Yamasaki
2008 Proceedings of the 7th ACM international conference on Embedded software - EMSOFT '08  
This paper presents an EDF-based algorithm, called Earliest Deadline Deferrable Portion (EDDP), for efficient scheduling of recurrent real-time tasks on multiprocessor systems.  ...  In order to curb the cost of task migrations, EDDP makes at most M − 1 migratable tasks on M processors. The scheduling analysis derives the condition for a given task set to be schedulable.  ...  For the scheduling of recurrent real-time tasks on multiprocessors, there have been two approaches: global scheduling and partitioned scheduling.  ... 
doi:10.1145/1450058.1450078 dblp:conf/emsoft/KatoY08 fatcat:w7cup3l2cvd5nnxutxjygbqwxa

A Lookup-Table Driven Approach to Partitioned Scheduling

Bipasa Chattopadhyay, Sanjoy Baruah
2011 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium  
The partitioned preemptive EDF scheduling of implicitdeadline sporadic task systems on an identical multiprocessor platform is considered.  ...  By using these lookup tables, task partitioning can be performed in time polynomial in the representation of the task system being partitioned.  ...  Some example maximal 4-processor configurations. 3 2 1 2 0 [D E D C] 3 4 2 0 0 [F F E A] 0 3 3 0 1 [F F F G] 4 1 1 1 1 [G D C B] 4 0 1 3 0 [D D D C] τ cannot consequently be feasible on m processors of  ... 
doi:10.1109/rtas.2011.32 dblp:conf/rtas/ChattopadhyayB11 fatcat:fly6mfxzdze7rfol35ehw2t5ri

Dynamic Priority Real-Time Scheduling on Power Asymmetric Multicore Processors

Basharat Mahmood, Naveed Ahmad, Majid Iqbal Khan, Adnan Akhunzada
2021 Symmetry  
We have proposed a dynamic-priority semi-partitioned algorithm named: Earliest-Deadline First with C=D Task Splitting (EDFwC=D-TS) for scheduling real-time applications on power asymmetric multicore processors  ...  EDFwC=D-TS outclasses its counterparts in terms of system utilization. The simulation results show that EDFwC=D-TS schedules up to 67% more tasks with heavy workloads.  ...  C=D Task Splitting (EDFwC=D-TS).  ... 
doi:10.3390/sym13081488 fatcat:iy3v6zwlsfh55jy5zgp3c5kcxm

Overhead-Aware Schedulability Evaluation of Semi-Partitioned Real-Time Schedulers

Pedro Souto, Paulo Baltarejo Sousa, Robert I. Davis, Konstantinos Bletsas, Eduardo Tovar
2015 2015 IEEE 21st International Conference on Embedded and Real-Time Computing Systems and Applications  
In this paper, we provide an overhead-aware schedulability analysis based on demand bound functions for two hard real-time semi-partitioned scheduling algorithms, EDF-WM and C=D.  ...  The analysis is used to guide the respective off-line task assignment and splitting procedures.  ...  C=D SCHEME Because we assume identical implementations, the schedulability analysis developed for EDF-WM is also applicable to C=D.  ... 
doi:10.1109/rtcsa.2015.13 dblp:conf/rtcsa/SoutoSDBT15 fatcat:a746s5swjbbe5nfx2roohvk4ue

Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling

Laurent George, Pierre Courbin, Yves Sorel
2011 Journal of systems architecture  
Let τ (C,T,D) be a task set scheduled using EDF on m processors according to an arbitrary portioned semi-partitioning with a fair local deadline assignment.  ...  In both cases, we propose feasibility conditions for the schedulability of sporadic tasks scheduled using Earliest Deadline First (EDF) semi-partitioned scheduling.  ...  Let τ (C,T,D) be a task set scheduled with the semi-partitioned EDF-RRJM scheduling on m processors.  ... 
doi:10.1016/j.sysarc.2011.02.008 fatcat:za3nyr7rsff4pdtgsbso5jqzpi

Multiprocessor Real-Time Scheduling with a Few Migrating Tasks

J. Augusto Santos Junior, George Lima, Konstantinos Bletsas, Shinpei Kato
2013 2013 IEEE 34th Real-Time Systems Symposium  
HIME has a utilisation bound of at least 74.9%, and can be configured to achieve 75%, the theoretical limit for semi-partitioned schemes with at most m/2 migrating tasks.  ...  We present HIME, a new EDF-based semipartitioned scheduling algorithm which allows at most one migrating task per processor.  ...  This work was partially supported by National Funds through FCT (Portuguese Foundation for Science and Technology) and by ERDF (European Regional Development  ... 
doi:10.1109/rtss.2013.25 dblp:conf/rtss/JuniorLBK13 fatcat:xzpxr3yxrbajxoms4qrhakmffu
« Previous Showing results 1 — 15 out of 224 results