Scaling global scheduling with message passing

Cerqueira, Felipe; Vanga, Manohar; Brandenburg, Björn B.

doi:10.1109/rtas.2014.6926008

Cited by 20 publications

(11 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although this master-slave architecture incurs some propagation delay, we found it is negligible (typically a few micro seconds) compared to the period length. Regarding IPI overhead, similar findings were reported in [11]. The PMC programming overhead is also negligible as it only requires a write to each core's local register.…”

Section: Implementation Details and Overhead Analysissupporting

confidence: 78%

Memory Bandwidth Management for Efficient Performance Isolation in Multi-Core Platforms

Yun

Yao

Pellizzoni

et al. 2016

IEEE Trans. Comput.

View full text Add to dashboard Cite

Memory bandwidth in modern multi-core platforms is highly variable for many reasons and it is a big challenge in designing realtime systems as applications are increasingly becoming more memory intensive. In this work, we proposed, designed, and implemented an efficient memory bandwidth reservation system, that we call MemGuard. MemGuard separates memory bandwidth in two parts: guaranteed and best effort. It provides bandwidth reservation for the guaranteed bandwidth for temporal isolation, with efficient reclaiming to maximally utilize the reserved bandwidth. It further improves performance by exploiting the best effort bandwidth after satisfying each core's reserved bandwidth. MemGuard is evaluated with SPEC2006 benchmarks on a real hardware platform, and the results demonstrate that it is able to provide memory performance isolation with minimal impact on overall throughput.

show abstract

Section: Implementation Details and Overhead Analysissupporting

confidence: 78%

Memory Bandwidth Management for Efficient Performance Isolation in Multi-Core Platforms

Yun

Yao

Pellizzoni

et al. 2016

IEEE Trans. Comput.

View full text Add to dashboard Cite

show abstract

“…Brandenburg et al [11] implemented a global scheduler in LITMUS RT using dedicated processor to handle release interrupt(GSN-EDF-DP) and they proved that the dedicated processor based scheduler performed better than the classic global scheduler on LITMUS RT . Recently, Cerqueira et al [12], implemented a highly scalable global scheduler using the concept of dedicated processor and message passing. SchedISA [8] is a Linux based multicore scheduler designed to schedule hard real-time and Linux tasks simultaneously.…”

Section: Discussionmentioning

confidence: 99%

Dynamic Partitioning Based Scheduling of Real-Time Tasks in Multicore Processors

Saranya

Hansdah

2015

2015 IEEE 18th International Symposium on Real-Time Distributed Computing

View full text Add to dashboard Cite

Existing real-time multicore schedulers use either global or partitioned scheduling technique to schedule real-time tasks. Partitioned scheduling is a static approach in which, a task is mapped to a per-processor ready queue prior to scheduling it and it cannot migrate. Partitioned scheduling makes ineffective use of the available processing power and incurs high overhead when real-time tasks are dynamic in nature. Global scheduling is a dynamic scheduling approach, where the processors share a single ready-queue to execute the highest priority tasks. Global scheduling allows task migration which results in high scheduling overhead. In this paper, we present a dynamic partitioning based scheduling of real-time tasks, called DP scheduling. In DP scheduling, jobs of tasks are assigned to cores when they are released and remain in the same core till they finish execution. The partitioning in DP scheduling is done based on the slack time and priority of jobs. If a job cannot be allocated to any core, then it is split, and executed on more than one core. DP scheduling technique attempts to retain good features of both global and partitioned scheduling without compromising on resource utilization, and at the same time, also tries to minimize the scheduling overhead. We have tested DP scheduling technique with EDF scheduling policy at each core, and we term this scheduling algorithm as DP-EDF. The performance of DP-EDF scheduling algorithm has been evaluated using simulation study and its implementation in LITMUS RT on a 64-bit intel processor with eight logical cores. Both simulation and experimental results show that DP-EDF scheduling algorithm has better performance in terms of resource utilization, and comparable or better performance in terms of scheduling overhead in comparison to contemporary scheduling algorithms.

show abstract

“…One will be to use a master-slave micro-kernel design specifically built for better scalability. This reduces locks and allows for a small footprint [4] [5]. Second, power-aware schedulers will be used (Earliest Deadline First (EDF) instead of Rate Monotonic (RM) [6]).…”

Section: B Operating System and Low-level Librariesmentioning

confidence: 99%

TULIPP: Towards ubiquitous low-power image processing platforms

Kalb

Kalms

Göhringer

et al. 2016

2016 International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation (SAMOS)

View full text Add to dashboard Cite

Abstract-Many industrial domains rely on vision-based applications which require to comply with severe performance and embedded requirements. TULIPP will develop a reference platform, which consists of a hardware system, a tool chain and a real-time operating system. This platform defines implementation rules and interfaces to tackle power consumption issues while delivering high, energy efficient and guaranteed computing performance for image processing applications. Using this reference platform will enable designers to develop a complete solution at a reduced cost to meet the typical embedded systems requirements: Size, Weight and Power. Moreover, for less constrained systems which performance requirements cannot be fulfilled by one instance of the platform, the reference platform will also be scalable so that the resulting boards can be chained for higher processing power. The instance of the reference platform developed during the project will be use-case driven and split between the implementation of: a reference hardware architecture -a scalable low-power board; a low-power operating system and image processing libraries; a productivityenhancing tool chain. It will lead to three proof-of-concept demonstrators across different application domains: real-time and low-power medical image processing product prototype of surgical X-ray system (mobile c-arm); embedded image processing systems within Unmanned Aerial Vehicles (UAVs); automotive real time embedded systems for driver assistance. TULIPP will set up an ecosystem and will closely work with standardization organizations to propose new standards derived from its reference platform to the industry.

show abstract

Scaling global scheduling with message passing

Cited by 20 publications

References 26 publications

Memory Bandwidth Management for Efficient Performance Isolation in Multi-Core Platforms

Memory Bandwidth Management for Efficient Performance Isolation in Multi-Core Platforms

Dynamic Partitioning Based Scheduling of Real-Time Tasks in Multicore Processors

TULIPP: Towards ubiquitous low-power image processing platforms

Contact Info

Product

Resources

About