Supporting Parallelism in Server-based Multiprocessor Systems

06/14/2011
by   Luís Nogueira, et al.
0

Developing an efficient server-based real-time scheduling solution that supports dynamic task-level parallelism is now relevant to even the desktop and embedded domains and no longer only to the high performance computing market niche. This paper proposes a novel approach that combines the constant bandwidth server abstraction with a work-stealing load balancing scheme which, while ensuring isolation among tasks, enables a task to be executed on more than one processor at a given time instant.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/20/2021

Load-Balancing for Improving User Responsiveness on Multicore Embedded Systems

Most commercial embedded devices have been deployed with a single proces...
research
06/09/2021

LB4OMP: A Dynamic Load Balancing Library for Multithreaded Applications

Exascale computing systems will exhibit high degrees of hierarchical par...
research
10/17/2018

Load balancing with heterogeneous schedulers

Load balancing is a common approach in web server farms or inventory rou...
research
04/29/2019

IRONHIDE: A Secure Multicore Architecture that Leverages Hardware Isolation Against Microarchitecture State Attacks

Modern microprocessors enable aggressive hardware virtualization that ex...
research
01/07/2015

A Case Study: Task Scheduling Methodologies for High Speed Computing Systems

High Speed computing meets ever increasing real-time computational deman...
research
02/08/2018

Adaptive online scheduling of tasks with anytime property on heterogeneous resources

An acceptable response time of a server is an important aspect in many c...
research
01/18/2023

Task-based preemptive scheduling on FPGAs leveraging partial reconfiguration

FPGAs are an attractive type of accelerator for all-purpose HPC computin...

Please sign up or login with your details

Forgot password? Click here to reset