Scheduling is an important issue in parallel processing. Most scheduling algorithms makes assigns tasks in a direct acyclic graph (DAG) to processors. Usually only the allocation and ordering of tasks are considered, and sometimes communication time is included in the determination of priorities of the tasks, however, communication messages are not explicitly scheduled. Moreover, communication ...

To meet the challenge of processing rapidly growing graph and network data created by modern applications, a number of distributed graph processing systems have emerged, such as Pregel and GraphLab. All these systems divide input graphs into partitions, and employ a “think like a vertex” programming model to support iterative graph computation. This vertex-centric model is easy to program and h...

In the context of synthesis, scheduling assigns operations to control steps. Operations are the atomic components used for describing behavior, for example, arithmetic and Boolean operations. They are ordered partially by data dependencies (data-flow graph) and by control constructs such as conditional branches and loops (control-flow graph). A control step usually corresponds to one state, one...

Optimal scheduling of tasks of a directed acyclic graph (DAG) onto a set of processors is a strong NP-hard problem. In this paper we present a scheduling scheme called TDS to schedule tasks of a DAG onto a heterogeneous system. This models a network of workstations, with processors of varying computing power. The primary objective of this scheme is to minimize schedule length and scheduling tim...

Operating Earth-observing satellites requires efficient planning methods that coordinate activities of multiple spacecraft. The satellite task-planning problem entails selecting actions best satisfy mission objectives for autonomous execution. Task scheduling is often performed by human operators assisted heuristic or rule-based tools. This approach does not efficiently scale to assets as heuri...

'Ibis paper prescnts a compact representation of all possible assembly plans of a given product using AND/OR graphs. Such a representation forms the basis for efficient planning algorithms which cnablc an increase in asscmbly system Ilexibility by allowing an intelligent robot to pick a course of action according to instantaneous conditions. Two applications are discussed: the selection of the ...

In order to improve system performance efficiently, a number of systems choose to equip multi-core and many-core processors (such as GPUs). Due to their discrete memory these heterogeneous architectures comprise a distributed system within a computer. A data-flow programming model is attractive in this setting for its ease of expressing concurrency. Programmers only need to define task dependen...

This work studies sleep scheduling in mobile-device centric sensor networks. The objective is to maximise the lifetime by exploiting redundancy in an over-deployed network. Redundancy is described by a redundancy graph; it turns out that typical realistic redundancy graphs are members of the family of local graphs. By using a divide-and-conquer technique based on modular grids, it is shown that...

One of the important issues in automatic code parallelization is the scheduling and mapping of nested loop iterations to different processors. The optimal scheduling problem is known to be NP-complete. Many heuristic static and dynamic loop scheduling techniques have been studied in the past. Here we propose a new static loop scheduling heuristic method called path-driven scheduling, under the ...