Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is activated at least once. This is based on the assumption that there are many independent point-to-point flows in the network. In sensor networks however often data are transferred from the sensor nodes to a few central data coll...

This paper describes a novel compile-time list-based task scheduling algorithm for distributed-memory systems, called Fast Load Balancing (FLB). Compared to other typical list scheduling heuristics, FLB drastically reduces scheduling time complexity to O(V (log (W ) + log (P )) + E), where V and E are the number of tasks and edges in the task graph, respectively, W is the task graph width and P...

this paper proposes a new method of gain scheduling control design for a nonlinear system which is described as linear parameter varying form. a performance measure based on linear matrix inequality is introduced. to consider stability and performance measures in design process, the h∞ loop-shaping method is used to design the local controllers, which can be described as state feedback observer...

In this paper, we focus on scheduling the 2-steps graph with UET tasks, i.e. tasks with the same length, in a heterogeneous environment where processors are uniform and have different speeds. Given a 2-steps graph of size n and p processors, we determine the lower bound of the execution time of any scheduling by maximizing the activity of each processor. Then, we present an efficiency schedule ...

This paper proposes a new duplication-based scheduling algorithm, called the Critical Predecessor Duplication scheduling algorithm, to exploit the potential of parallel processing in distributed heterogeneous computing systems. In such systems, designing efficient scheduling algorithm may lead to a significant variation in the generated schedule. The proposed scheduling algorithm could improve ...

This paper addresses the problem of efficient collective scheduling of file transfers requested by a batch of tasks. Our work targets a heterogeneous collection of storage and compute clusters. The goal is to minimize the overall time to transfer files to their respective destination nodes. Two scheduling schemes are proposed and experimentally evaluated against an existing approach, the Insert...

This paper presents a graph-coloring-based algorithm for the exam scheduling application, with the objective of achieving fairness, accuracy, and optimal exam time period. Through the work, we consider few assumptions and constraints, closely related to the general exam scheduling problem, and mainly driven from accumulated experience at various universities. The performance of the algorithm is...

We study the problem of scheduling packet transmissions with aim minimizing energy consumption and data transmission delay users in a wireless network which spatial reuse spectrum is employed. approach this using theory Whittle index for cost restless bandits, has been used to effectively solve problems variety applications. design two based policies — first by treating graph representing as cl...

Software pipelining is becoming widely used as a loop execution model for microprocessors supporting a high instruction level parallelism. In this paper we describe a heuristic method for software pipelining, named Graph Traverse Software Pipelining (GTSP), that divides the scheduling problem in two phases: scheduling on a graph and code generation. The first phase encapsulates the NP-complete ...