AIRS: Supporting Interactive Real-Time Applications on Multicore Platforms

Kato, Shigeo; Rajkumar, Ragunathan; Ishikawa, Yutaka

doi:10.1109/ecrts.2010.33

Cited by 21 publications

(10 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Given the lower number of context switches, we believe that EDF-WM is a better candidate than EDF-SS for an implementation-oriented study. EDF-WMR, which is a variant of EDF-WM that supports reservations, has been implemented within the AIRS framework [21], but detailed scheduling overheads or schedulability results were not reported. A proof-of-concept implementation of an algorithm called EKG-sporadic [3], which is also a precursor of NPS-F, has been discussed in a technical report [6].…”

Section: Related Workmentioning

confidence: 99%

“…Without these extensions, any task set exceeding the capacity of one processor would be unschedulable by the commonly-used next-fit, best-fit, and first-fit heuristics (which try to fully utilize one processor before considering others). In contrast, the worst-fit heuristic (used in [9,13,14,21]) partially hides this problem since it tends to distribute unallocated capacity evenly among processors. Considering overheads in the assignment phase of NPS-F exposes an additional issue that was not considered by the designers of that algorithm.…”

Section: Bin-packingmentioning

confidence: 99%

See 1 more Smart Citation

Is Semi-Partitioned Scheduling Practical?

Bastoni

Brandenburg

Anderson

2011

2011 23rd Euromicro Conference on Real-Time Systems

View full text Add to dashboard Cite

Semi-partitioned schedulers are-in theory-a particularly promising category of multiprocessor real-time scheduling algorithms. Unfortunately, issues pertaining to their implementation have not been investigated in detail, so their practical viability remains unclear. In this paper, the practical merit of three EDF-based semi-partitioned algorithms is assessed via an experimental comparison based on real-time schedulability under consideration of real, measured overheads. The presented results indicate that semi-partitioning is indeed a sound and practical idea. However, several problematic design choices are identified as well. These shortcomings and other implementation concerns are discussed in detail.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Bin-packingmentioning

confidence: 99%

Is Semi-Partitioned Scheduling Practical?

Bastoni

Brandenburg

Anderson

2011

2011 23rd Euromicro Conference on Real-Time Systems

View full text Add to dashboard Cite

show abstract

“…Targeting interactive real-time systems, the problem providing high quality of service for such systems is studied in the context of the AIRS framework [11]. AIRS utilizes a novel multiprocessor scheduling policy as well as a new reservation scheme.…”

Section: Related Workmentioning

confidence: 99%

Multi-level adaptive hierarchical scheduling framework for composing real-time systems

Khalilzad

Behnam

Nolte

2013

2013 IEEE 19th International Conference on Embedded and Real-Time Computing Systems and Applications

View full text Add to dashboard Cite

Processor partitioning and hierarchical scheduling have been widely used for composing hard real-time systems on a shared hardware platform while preserving the timing requirements of the systems. Due to the safety critical nature of hard real-time systems, a conservative analysis is often used for deriving a sufficient partition size. Applying the exact same analysis for deriving the partition sizes for soft real-time systems result in unnecessary processors overallocation and consequently waste of the CPU resource.In this paper, to address the problem of composing soft and hard real-time systems on a resource constrained shared hardware, we present a multi-level adaptive hierarchical scheduling framework. In our framework, we adapt the processor partition sizes of soft real-time systems according to their need at each time point by on-line monitoring their processor demand. Furthermore, we implement our adaptive framework in the Linux kernel and show the performance of our framework using a case study.

show abstract

“…Figure 1:(a) shows the normalized geometric mean completion time of the evaluated applications. These applications comprise of multiple secure and ordinary (insecure) processes that frequently interact with each other to assure application progress [14], [15]. The completion time of various enclavebased mechanisms is normalized to an insecure baseline that does not implement the enclave-based security primitives.…”

Section: Introductionmentioning

confidence: 99%

IRONHIDE: A Secure Multicore that Efficiently Mitigates Microarchitecture State Attacks for Interactive Applications

Omar

Khan

2020

2020 IEEE International Symposium on High Performance Computer Architecture (HPCA)

View full text Add to dashboard Cite

Microprocessors enable aggressive hardware virtualization by means of which multiple processes temporally execute on the system. These security-critical and ordinary processes interact with each other to assure application progress. However, temporal sharing of hardware resources exposes the processor to various microarchitecture state attacks. State-of-the-art secure processors, such as MI6 adopt Intel's SGX enclave execution model. MI6 architects strong isolation by statically isolating shared memory state, and purging the microarchitecture state of private core, cache, and TLB resources on every enclave entry and exit. The purging overhead significantly impacts performance as the interactivity across the secure and insecure processes increases. This paper proposes IRONHIDE that implements strong isolation in the context of multicores to form spatially isolated secure and insecure clusters of cores. For an interactive application comprising of secure and insecure processes, IRONHIDE pins the secure process(es) to the secure cluster, where they execute and interact with the insecure process(es) without incurring the microarchitecture state purging overheads on every interaction event. IRONHIDE improves performance by 2.1× over the MI6 baseline for a set of user and OS interactive applications. Moreover, IRONHIDE improves performance by 20% over an SGX-like baseline, while also ensuring strong isolation guarantees against microarchitecture state attacks.

show abstract

AIRS: Supporting Interactive Real-Time Applications on Multicore Platforms

Cited by 21 publications

References 18 publications

Is Semi-Partitioned Scheduling Practical?

Is Semi-Partitioned Scheduling Practical?

Multi-level adaptive hierarchical scheduling framework for composing real-time systems

IRONHIDE: A Secure Multicore that Efficiently Mitigates Microarchitecture State Attacks for Interactive Applications

Contact Info

Product

Resources

About