Task Reprocessing on Real-Time Multicore Systems

Kumar, P. Pavan; Satyanarayana, Ch.; Rao, A. Ananda; Raju, P. Radhika

doi:10.1145/2980258.2980460

Cited by 1 publication

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• A key improvement over CA-EDF is defined as ENCAP-EDF is discussed in detail [5], [6]. In this paper, how each eligible job is reweighted and reprocessed based on ENCAP-EDF is discussed.…”

Section: Brief Contributionsmentioning

confidence: 99%

“…An experimental study on symmetric multiprocessing (SMP) units with various real-time scheduling algorithms [5], [6] presented in this work. Partitioned EDF (PEDF) works well for Hard Real-Time (HRD) systems with lower overheads (runtime).…”

Section: Experimental Workmentioning

confidence: 99%

“…In this section, we propose a procedure Task Repo, works based on modified heuristic guidelines set, referred as ENCAP (ENhancing the shared CAche Performance) for reprocessing an eligible neglected task-set due to discouragement for real-time multi-core environment [5], [6]. The bounded tardiness is ensured by EDF-based scheduling algorithms with 50-60 %.…”

Section: Task Reprocessingmentioning

confidence: 99%

“…We describe the task reprocessing guidelines with an analysis in our preceding works [5], [6]. Next the proposed modified profiler is experimentally assessed with our real-time task reprocessing priorities based on ENCAP-EDF real-time multiprocessor scheduling.…”

Section: Experimental Evaluationmentioning

confidence: 99%

See 3 more Smart Citations

Design and Implementation of Task Reprocessing on Medium-large Multi-core Architecture

Paruchuri¹,

Satyanarayana²,

A³

et al. 2017

Appl. Theory Comput. Technol.

View full text Add to dashboard Cite

EDF-Based real-time scheduling approach is one of the efficient way of scheduling the recurrent real-time tasks in both soft real-time and hard real-time systems. EDF algorithms entail heavy overhead due to lower scheduling and huge migration. In this paper, an exploratory procedure has been presented for reprocessing of neglected task sets and also examine, whether an improved heuristic set attributed as Enhanced Shared CAche Performance (ENCAP) can improve the shared cache performance which processes the task set based on Earliest-Deadline-First (EDF). An Object-Oriented real-time code reusable scheduling components which is designed from the scratch referred as LITMUS RT has been used to test the efficiency and average-case accomplishments where per task utilizations are shortened and overall utilization are not restricted. We also discuss the implementation and experimental evaluation of Task-Repo procedure for co-scheduling task sets, under the utilization of 50-60% (per-task) on small to medium-large multicore LINUX SYSTEM.

show abstract

Section: Brief Contributionsmentioning

confidence: 99%

Section: Experimental Workmentioning

confidence: 99%

Section: Task Reprocessingmentioning

confidence: 99%

Section: Experimental Evaluationmentioning

confidence: 99%

See 2 more Smart Citations