Optimal RM scheduling for simply periodic tasks on uniform multiprocessors

Jung, Myoung-Jo; Seong, Yeong Rak; Lee, Cheol-Hoon

doi:10.1145/1644993.1645064

Cited by 7 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The RM scheduling algorithm is a method of fixed priority scheduling in which a fixed priority is given to each task, and when a task having a higher priority arrives, the currently executing task is preempted. The RM algorithm determines the priority based on the period of the task, and it is an algorithm that gives a high priority to a task with a short execution period [17][18][19].…”

Section: Rm Scheduling Algorithmmentioning

confidence: 99%

A Scheduling Algorithm with RTiK+ for MIL-STD-1553B Based on Windows for Real-Time Operation System

Kim¹,

Lee²,

Lee³

2021

Adv. sci. technol. eng. syst. j.

Self Cite

View full text Add to dashboard Cite

In devices using Windows operating system based on x86 system, the real-time performance is not guaranteed by Windows. It is because Windows is not a real-time operating system. Users who develop applications in such a Windows environment generally use commercial solutions such as the RTX or the INtime to provide real-time performance to the system. However, when using functions and API for simple real-time processing, an issue of high development cost occurs in terms of cost-effectiveness. In this paper, the RTiK+ was implemented in the type of a device driver by controlling the MSR_FSB_FREQ register to generate a timer interrupt independent of Windows in the Windows 8 and providing a real-time functionality to the user mode by re-setting the local APIC count register. And the operating frequency of the CPU is changed to minimize power consumption for battery life in a mobile device such as a Tablet PC. In particular, the weapon system uses highly reliable MIL-STD-1553B communication and performs BC and RT functions of MIL-STD-1553B to transmit and/or receive data in communication between component and component. It is significantly importance to guarantee integrity of data without loss data during communication. For this purpose, it isproposed to implant the Scheduling algorithm with the RTiK+ for MIL-STD-1553B communication for Windows 8 to support a real-time processing in the Windows operating system on the embedded system, and to use the periods of 2ms (max), 5ms and 10ms provided by the RTiK+ for real-time processing when performing the BC and RT functions of MIL-STD-1553B communication. In this paper, the method of the scheduling algorithm with RTiK+ for MIL-STD-1553B to provide real-time processing is proposed for the Windows based on x86 system.

show abstract

Section: Rm Scheduling Algorithmmentioning

confidence: 99%

A Scheduling Algorithm with RTiK+ for MIL-STD-1553B Based on Windows for Real-Time Operation System

Kim¹,

Lee²,

Lee³

2021

Adv. sci. technol. eng. syst. j.

Self Cite

View full text Add to dashboard Cite

show abstract

“…In the field of processor task scheduling, a set of k task periods Ψ={T 1 ,…,T k } is referred to as simply periodic if for each pair of task periods T i and T j such that T j >T i ,T j is an integer multiple of T i . This implies:

{normalT}_{normalj} = ((), {falsefalse}_{\prod}^{normal z = i} α_{normalz}) {normalT}_{normali} = {normalc}_{normal i, j} {normalT}_{normali} \forall normali, normalj : 1 \leq normali < normalj \leq normalk

where { α z } and { c i,j } are positive integers.…”

Section: System Modelmentioning

confidence: 99%

“…In the field of processor task scheduling, a set of k task periods ‰ D fT 1 , : : : , T k g is referred to as simply periodic if for each pair of task periods T i and T j such that T j >T i , T j is an integer multiple of T i [17,18]. This implies:…”

Section: Set Of Periods Supportedmentioning

confidence: 99%

“…For this reason, we concentrate on systems which offer a limited set of periods which are integer multiples of a fixed base period T. We first consider a simply periodic system in which each supported period is an integer multiple of each smaller supported period in the system (and ultimately of the base period T). Such a system is very efficient in terms of its use of resources because there is no opportunity for time domain collisions between distinct allocations provided they are offset appropriately from each other in terms of time.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Blocking analysis of persistent resource allocations for M2M applications in wireless systems

Brown

Afrin

Khan

2016

Trans. Emerging Tel. Tech.

View full text Add to dashboard Cite

Wide area wireless systems conventionally employ dynamic scheduling for stochastic or bursty applications and persistent resource allocations of a given period for deterministic applications such as voice. When considering persistent resource allocations for machine‐to‐machine (M2M) applications from different markets, a wide range of allocation periods may be required to fully support the diversity of applications. The set of periods supported by the wireless system is a compromise between efficient use of the available resources and supporting as many M2M applications as possible. We consider two schemes: a simply periodic system which offers a limited set of periods with very efficient use of resources, and a complex periodic system which offers a wider range of periods at the cost of lower efficiency. We derive formulae for the blocking probability of these two systems by considering different resource sharing policies of the Erlang Multirate Loss Model (EMLM) and the concepts of packing (when a new persistent allocation is admitted to the system) and repacking (when an existing persistent allocation leaves the system). The theoretical models are verified using a discrete event simulation with variable offered traffic loads. The concepts discussed in this paper are generic, but may find particular application in Long Term Evolution (LTE) and Worldwide Interoperability for Microwave Access (WiMAX) networks for the purposes of system configuration (particularly in terms of the set of periods supported for persistent allocations), resource dimensioning and system performance characterisation. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

“…There are also a number of other researches that study the relationship between system schedulability and task periods under RMS for single-core scheduling [22,74,89]. For multiple processor RMS scheduling, Jung [65] et al studied the problem of scheduling harmonic tasks on a uniform multiprocessor platform. Müller [93] adopted the schedulability test by Han et al [48] to minimize the number of processors, and Fan et al [38] proposed a scheduling technique that improves the system schedulability by taking advantage of the harmonic relation among tasks.…”

Section: Related Workmentioning

confidence: 99%

Real-Time Scheduling of Embedded Applications on Multi-Core Platforms

Fan¹

View full text Add to dashboard Cite

Optimal RM scheduling for simply periodic tasks on uniform multiprocessors

Cited by 7 publications

References 13 publications

A Scheduling Algorithm with RTiK+ for MIL-STD-1553B Based on Windows for Real-Time Operation System

A Scheduling Algorithm with RTiK+ for MIL-STD-1553B Based on Windows for Real-Time Operation System

Blocking analysis of persistent resource allocations for M2M applications in wireless systems

Real-Time Scheduling of Embedded Applications on Multi-Core Platforms

Contact Info

Product

Resources

About