Real-time applications in wireless networks are emerging in multimedia product and design.
However, conventional real-time message scheduling algorithms generally do not take …

Most existing real-time fault-tolerant scheduling algorithms for heterogeneous distributed
systems can achieve high reliability for non-preemptive and aperiodic tasks. However, the …

Parallel applications with energy and low-latency constraints are emerging in various
networked embedded systems like digital signal processing, vehicle tracking, and …

The rapid technological advances have made the use of domestic assistive environments
vital in the daily life of elderly and disabled people. A major challenge in an assistive …

In this research, a scenario is assumed where periodic real-time jobs are being run on a
heterogeneous cluster of computers, and new aperiodic parallel real-time jobs, modelled by …

Discrete particle swarm optimization is one of the most recently developed population-based
meta-heuristic optimization algorithm in swarm intelligence that can be used in any discrete …

Task Scheduling is a complex combinatorial optimization problem and known to be an NP
hard. It is an important challenging issue in multiprocessor computing systems. Discrete …

In this work we propose a two-phase scheduling technique (TOPS) for distributed real-time
systems. Our TOPS scheduling approach has two distinct phases. The first phase is in …

Evolving from heterogeneous database systems one of the main problems in peer data
management systems (PDMS) is distributed query processing. With the absence of global …

In this paper, we propose a dynamic and reliability-driven real-time fault-tolerant scheduling
algorithm on heterogeneous distributed systems (DYFARS). Primary-backup copy scheme is …