System-Wide Time versus Density Tradeoff in Real-Time Multicore Fluid Scheduling

Recent parallel programming frameworks such as OpenCL and OpenMP allow us to enjoy the parallelization freedom for real-time tasks. The parallelization freedom creates the time versus density tradeoff problem in fluid scheduling, i.e., more parallelization reduces thread execution times but increase...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computers 2018-07, Vol.67 (7), p.1007-1022
Main Authors: Kim, Kang-Wook, Cho, Youngeun, Eo, Jeongyoon, Lee, Chang-Gun, Han, Junghee
Format: Article
Language:English
Subjects:
Density
Instruction sets
Message systems
Multicore fluid scheduling
Optimal scheduling
Optimization
Parallel programming
Processor scheduling
Real time
Real-time systems
Scheduling
Task scheduling
time versus density tradeoff
Tradeoffs
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Recent parallel programming frameworks such as OpenCL and OpenMP allow us to enjoy the parallelization freedom for real-time tasks. The parallelization freedom creates the time versus density tradeoff problem in fluid scheduling, i.e., more parallelization reduces thread execution times but increases the density. By system-widely exercising this tradeoff, we propose optimal parameter tuning of real-time tasks aiming at maximizing the schedulability of multicore fluid scheduling. Our experimental study by both simulation and actual implementation shows that the proposed approach well balances the time and the density, and results in up to 80 percent improvement of the schedulability.
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.2018.2793919