T HE LAST TWO decades have witnessed unprecedented growth in telecommunications, particularly in the area of wireless communications. This development in telecommunications opens doors to many sophisticated complex systems, e.g., social networks, smart grids, vehicular networks, and sensor networks, which previously were not feasible. Graph theory is among the most widely used tools for modelin...

In this paper, we survey algorithms that allocate a parallel program represented by an edge-weighted directed acyclic graph (DAG), also called a task graph or macro-dataflow graph, to a set of homogeneous processors, with the objective of minimizing the completion time. We analyze 21 such algorithms and classify them into four groups. The first group includes algorithms that schedule the DAG to...

Organizations today face increasing pressure to reduce time to market, i.e. to improve the design and the operations of business processes in terms of lead time and meeting due dates. Formal analysis using a mathematical graphbased approach can help to achieve this kind of improvement. We will apply business graphs to scheduling workflows in terms of timebased optimization. We will concentrate ...

The common problem of multiprocessor scheduling can be defined as allocating a task graph in a multiprocessor system so that schedule length can be improved. Task scheduling in multiprocessor system is a NP-complete problem. A number of heuristic methods have been cultivated that achieve partial solutions in less than the minimum computing time. Genetic algorithms have obtained much awareness a...

Title of dissertation: MULTI-SCALE SCHEDULING TECHNIQUES FOR SIGNAL PROCESSING SYSTEMS Zheng Zhou, Doctor of Philosophy, 2013 Dissertation directed by: Shuvra S. Bhattacharyya (Chair/Advisor) Professor Department of Electrical and Computer Engineering, and Institute for Advanced Computer Studies Gang Qu (Co-Advisor) Associate Professor Department of Electrical and Computer Engineering A variety...

This paper describes a scheduling technique for parallel database systems to obtain high performance, both in terms of response time and throughput. The technique enables both intra-and inter-transaction paralMism while controlling concurrency between transactions correctly. Scheduling is performed dynamically at transaction execution time, taking into account dynamic aspects of the execution a...

a recently published paper [t. došlić, this journal 3 (2012) 25-34] considers the zagrebindices of benzenoid systems, and points out their low discriminativity. we show thatanalogous results hold for a variety of vertex-degree-based molecular structure descriptorsthat are being studied in contemporary mathematical chemistry. we also show that theseresults are straightforwardly obtained by using...

We consider the resource-constrained scheduling of loops with interiteration dependencies. A loop is modeled as a data flow graph (DFG), where edges are labeled with the number of iterations between dependencies. We design a novel and flexible technique, called rotation scheduling, for scheduling cyclic DFG’s using loop pipelining. The rotation technique repeatedly transforms a schedule to a mo...

The paper proposes an energy-aware dynamic clustering-based scheduling algorithm that aims at reducing communication energy consumption through clustering dependent tasks. A job can be described by a direct acyclic graph (DAG) of parallel tasks. Because the execution time is hard to estimate accurately, the current static scheduling strategies may cause energy increase due to task waiting. The ...