This survey covers hard real-time scheduling algorithms and schedulability analysis
techniques for homogeneous multiprocessor systems. It reviews the key results in this field …

Multi-core processors offer a significant performance increase over single-core processors.
They have the potential to enable computation-intensive real-time applications with stringent …

Massively multi-core processors are rapidly gaining market share with major chip vendors
offering an ever increasing number of cores per processor. From a programming …

The rise of big data age in the Internet has led to the explosive growth of data size. However,
trust issue has become the biggest problem of big data, leading to the difficulty in data safe …

The scheduling of sporadic task systems upon multiprocessor platforms is considered, when
inter-processor migration is permitted. It is known that current schedulability tests for such …

As the complexity of software for Cyber-Physical Systems (CPS) rapidly increases, multi-
core processors and parallel programming models such as OpenMP become appealing to …

As multicore processors become ever more prevalent, it is important for real-time programs
to take advantage of intra-task parallelism in order to support computation-intensive …

A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks
among the processors of an identical multiprocessor platform with static-priority scheduling …

This paper presents a new algorithm for fixed-priority scheduling of sporadic task systems on
multiprocessors. The algorithm is categorized to such a scheduling class that qualifies a few …

Since worst case response times must be determined repeatedly during the interactive
design of real-time application systems, repeated exact computation of such response times …