Task scheduling in heterogeneous multiprocessor systems is an extremely hard NP
complete problem. Hence, the heuristic approaches must be used to discover good …

In this chapter, we consider scheduling with communication delays. This model assumes
that a parallel application is a set of sequential communicating processes (or threads) which …

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 …

Grid architecture integrates geographically distributed nodes to manage and provide
resources to execute scientific applications. For data locality, applications with different …

This thesis investigates a scheduling algorithm for a heterarchical, distributed manufacturing
system. Scheduling in a heterarchical, distributed system is a challenge as the algorithm …

In this paper, we propose and evaluate a fault-tolerant real-time scheduling algorithm that
can tolerate one processor's permanent fault in a heterogeneous distributed system …

An efficient allocation of tasks to the processors is a crucial problem in heterogeneous
computing systems. Finding an optimal schedule for such an environment is an NP …

Scheduling tasks with precedence constraints on heterogeneous distributed computing
systems Page 1 University of Tennessee, Knoxville TRACE: Tennessee Research and …

Reducing power consumption of wireless networks has become a major goal in designing
modern multimedia wireless systems. In an effort to reduce power consumption, this paper …

Before an application modelled as a directed acyclic graph (DAG) is executed on a
heterogeneous system, a DAG mapping policy is often enacted. After mapping, the tasks (in …