QoS constraint based workflow scheduling described by Directed Acyclic Graph (DAG) has been proved to be a NP-hard problem in Cloud Computing Services, especially for cost minimization under deadline constraint. Due to Deadline Bottom Level (DBL) hasn’t considered the concurrence during the real executing process that cause much more shatter time to solve such problem, this paper proposes a nov...

This article presents the integration of on-line mission planning and flight scheduling for an unmanned aerial vehicle in military observation missions. Planning selects and orders the best subset of observations to be carried out and schedules the observations while accommodating time windows. The vehicle is subjected to speed, fuel supply and flight constraints in a uncertain and dynamic envi...

In this paper, we present a novel intra-task Dynamic Voltage Scheduling (DVS) algorithm based on the knowledge of frequently executed paths in the control flow graph for real-time embedded systems. The basic idea is to construct a common path composing all the frequently executed paths (hot-paths) and perform DVS scheduling based on this common path, rather than the most probable path. We compa...

This paper proposes a static scheduling of an application designed using the IEC 61499 standard. In this standard, a function block (FB) is an event triggered component and an application is a FBs network. According to specifications, we propose temporal constraints on the application behavior. To verify these constraints, we propose to transform the application blocks into a particular tasks s...

We study the performance of task graph scheduling for both regular and irregular parallel computation. We present a scheduling tool named PYRROS, which takes as an input a task graph and a compile time estimation of computation and communication weights. It then produces a schedule and a parallel code based on this schedule. We analyze the eeect of compile time errors to run time scheduling per...

The scheduling of a set of tasks, with precedence constraints and known execution times, into a set of identical processors is considered. Optimal scheduling of these tasks implies utilizing a minimum number of processors to satisfy a deadline, or finishing in minimal time using a fixed number of processors. This process can be seen as a transformation of the original graph into another graph, ...

This paper considers the thread scheduling problem. The thread scheduling problem abstracts the problem of minimizing memory latency, using a directed data dependency graph generated form a compiler, to improve run time eÆciency. Two thread scheduling problems are formulated and shown to be strongly NP-complete. New methods and algorithms for analyzing a data dependency graph in order to comput...

Graph scheduling has been shown eeective for solving irregular problems represented as directed acyclic graphs(DAGs) on distributed memory systems. Many scientiic applications can also be modeled as iterative task graphs(ITGs). In this paper, we model the SOR computation for solving sparse matrix systems in terms of ITGs and address the optimization issues for scheduling ITGs when communication...

In parallel and distributed systems, validation of scheduling heuristics is usually done by simulation on randomly generated synthetic workloads, typically represented by task graphs. Since there is no single generation method that models all possible workloads for scheduling problems, researchers often re-implement the classical generation algorithms or even implement ad hoc ones. A bad choice...

This paper introduces and formalizes a new variant of Timed Automata, called Time Labeled Scheduling Automata. A Time Labeled Scheduling Automaton is a single clock implementation model expressing globally the time constraints that a system has to meet. An algorithm is presented to show how a Time Labeled Scheduling Automaton can be synthesized from a minimal reachability graph derived from a h...