Energy-Efficient Scheduling in Nonpreemptive Systems With Real-Time Constraints

Li, Jianjun; Shu, LihChyun; Chen, Jian-Jia; Li, Guohui

doi:10.1109/tsmca.2012.2199305

Cited by 31 publications

(9 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to quantify the gains of GEDP relative to FPP on context switching, we defined four analysis indicators. R c is the context switch reduction rate of a task in one experiment, shown as Equation 6; R v is the average context switch reduction rate of a task in multiple experiments, shown as Equation (7); R t is the total context switch reduction rate for all tasks in one experiment, shown as Equation (8); R vt is the average context switch reduction rate for all tasks in multiple experiments, shown as Equation (9).…”

Section: Times Linpack_benchmentioning

confidence: 99%

“…With the ongoing focus on the energy consumption of real-time embedded systems, how to minimize the energy consumption under the premise of guaranteeing system schedulability has been gaining increased attention in recent years [7,8]. At present, the energy optimized technology for embedded systems is at different levels, including the circuit level, system level, storage level, and compile level [9].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Group-Based Energy-Efficient Dual Priority Scheduling for Real-Time Embedded Systems

Liu

2020

Information

View full text Add to dashboard Cite

As the limitation of energy consumption of real-time embedded systems becomes more and more strict, it has been difficult to ignore the time overhead and energy consumption of context switches for fixed-priority tasks with preemption scheduling (FPP) in multitasking environments. In addition, the scheduling for different types of tasks may disrupt each other and affect system reliability. A group-based energy-efficient dual priority scheduling (GEDP) is proposed in this paper. The GEDP isolates different types of tasks to avoid the disruption. Furthermore, it also reduces context switches effectively, thus decreasing system energy consumption. As many studies ignored the context switches’ overhead in the worst-case response time (WCRT) model, and it will affect the accuracy of WCRT, thereby affecting the system schedulability. Consequently, the WCRT model is improved based on considering context switches’ overhead. The GEDP is designed and implemented in Linux, and the time overhead and energy consumption of context switches is compared in different situations with GEDP and FPP. The experimental results show that GEDP can reduce context switches by about 1% and decrease energy consumption by about 0.6% for given tasks.

show abstract

Section: Times Linpack_benchmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Group-Based Energy-Efficient Dual Priority Scheduling for Real-Time Embedded Systems

Liu

2020

Information

View full text Add to dashboard Cite

show abstract

“…These above articles considered uniprocessor in their proposed scheduling algorithms. In few other studies such as [16,11,19,20], they presented a CPU scheduling on multi-core and multi-processor. In [11], the focus was on the energy-efficient scheduling of periodic RT tasks on multi-core processors, which cores are partitioned into multiple blocks.…”

Section: Related Workmentioning

confidence: 99%

“…Finally the CPU finishing time of the tasks calculate according to Eq. (19). To calculate of current task, in case of waiting time, the t is considered in the Eq.…”

Section: Cpu and Hdd Schedulingmentioning

confidence: 99%

A Task Scheduling Model for Multi-CPU and Multi-Hard Disk Drive in Soft Real-time Systems

Mohseni¹,

Kiani²,

Rahmani³

2019

IJITCS

View full text Add to dashboard Cite

In recent years, by increasing CPU and I/O devices demands, running multiple tasks simultaneously becomes a crucial issue. This paper presents a new task scheduling algorithm for multi-CPU and multi-Hard Disk Drive (HDD) in soft Real-Time (RT) systems, which reduces the number of missed tasks. The aim of this paper is to execute more parallel tasks by considering an efficient trade-off between energy consumption and total execution time. For study purposes, we analyzed the proposed scheduling algorithm, named HCS (Hard disk drive and CPU Scheduling) in terms of the task set utilization, the total execution time, the average waiting time and the number of missed tasks from their deadlines. The results show that HCS algorithm improves the above mentioned criteria compared to the HCS_UE (Hard disk drive and CPU Scheduling _Unchanged Execution time) algorithm.

show abstract

“…We note that other schedules could be employed for the relatively simple scheduling of only two interleaved tasks, e.g., an elementary static cyclic schedule [84], [85]. Additionally, scheduling techniques that consider energy-efficiency, e.g., [86]- [89] may be considered. The detailed examination of different scheduling approaches for the proposed R-FFT node is beyond the scope of this study and is and interesting direction for future research.…”

Section: Interleaving Timing Of Fft Computationsmentioning

confidence: 99%

R-FFT: Function Split at IFFT/FFT in Unified LTE CRAN and Cable Access Network

Thyagaturu

Alharbi

Reisslein

2018

IEEE Trans. on Broadcast.

View full text Add to dashboard Cite

The Remote-PHY (R-PHY) modular cable network for Data over Cable Service Interface Specification (DOCSIS) service conducts the physical layer processing for the transmissions over the broadcast cable in a remote node. In contrast, the cloud radio access network (CRAN) for Long-Term Evolution (LTE) cellular wireless services conducts all baseband physical layer processing in a central baseband unit and the remaining physical layer processing steps towards radio frequency (RF) transmission in remote nodes. Both DOCSIS and LTE are based on Orthogonal Frequency Division Multiplexing (OFDM) physical layer processing. We propose to unify cable and wireless cellular access networks by utilizing the hybrid fiber-coax (HFC) cable network infrastructure as fiber fronthaul network for cellular wireless services. For efficient operation of such a unified access network, we propose a novel Remote-FFT (R-FFT) node that conducts the physical layer processing from the Fast-Fourier Transform (FFT) module towards the RF transmission, whereby DOCSIS and LTE share a common FFT module. The frequency domain in-phase and quadrature (I/Q) symbols for both DOCSIS and LTE are transmitted over the fiber between remote node and cable headend, where the remaining physical layer processing is conducted. We further propose to cache repetitive quadrature amplitude modulation (QAM) symbols in the R-FFT node to reduce the fronthaul bitrate requirements and enable statistical multiplexing. We evaluate the fronthaul bitrate reductions achieved by R-FFT node caching, the fronthaul transmission bitrates arising from the unified DOCSIS and LTE service, and illustrate the delay implications of moving part of the cable R-PHY remote node physical layer processing to the headend. Overall, our evaluations indicate that the proposed R-FFT node can effectively support unified DOCSIS and LTE services over the HFC cable plant while substantially reducing the fronthaul bitrate requirements of the existing CRAN structures.

show abstract

Energy-Efficient Scheduling in Nonpreemptive Systems With Real-Time Constraints

Cited by 31 publications

References 34 publications

A Group-Based Energy-Efficient Dual Priority Scheduling for Real-Time Embedded Systems

A Group-Based Energy-Efficient Dual Priority Scheduling for Real-Time Embedded Systems

A Task Scheduling Model for Multi-CPU and Multi-Hard Disk Drive in Soft Real-time Systems

R-FFT: Function Split at IFFT/FFT in Unified LTE CRAN and Cable Access Network

Contact Info

Product

Resources

About