Results 1  10
of
32,264
On Parallelization of Static Scheduling Algorithms
 IEEE Trans. Software Eng
, 1997
"... Most static scheduling algorithms that schedule parallel programs represented by directed acyclic graphs (DAGs) are sequential. This paper discusses the essential issues of parallelization of static scheduling and presents two efficient parallel scheduling algorithms. The proposed algorithms have be ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Most static scheduling algorithms that schedule parallel programs represented by directed acyclic graphs (DAGs) are sequential. This paper discusses the essential issues of parallelization of static scheduling and presents two efficient parallel scheduling algorithms. The proposed algorithms have
Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors
, 1999
"... Devices]: Modes of ComputationParallelism and concurrency General Terms: Algorithms, Design, Performance, Theory Additional Key Words and Phrases: Automatic parallelization, DAG, multiprocessors, parallel processing, software tools, static scheduling, task graphs This research was supported ..."
Abstract

Cited by 326 (5 self)
 Add to MetaCart
Devices]: Modes of ComputationParallelism and concurrency General Terms: Algorithms, Design, Performance, Theory Additional Key Words and Phrases: Automatic parallelization, DAG, multiprocessors, parallel processing, software tools, static scheduling, task graphs This research was supported
ITS: AN ILPBASED COMBINED INSTRUCTION/TASK STATIC SCHEDULING ALGORITHM
"... Our combined task and instruction static scheduling algorithm implemented in the COINS compiler uses an Integer Linear Programming model to find a schedule for a program on a symmetric multiprocessor systemonchip. We compare our work to state of the art approaches and on average we find a speedup ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Our combined task and instruction static scheduling algorithm implemented in the COINS compiler uses an Integer Linear Programming model to find a schedule for a program on a symmetric multiprocessor systemonchip. We compare our work to state of the art approaches and on average we find a speedup
A Fast Static Scheduling Algorithm for DAGs on an Unbounded Number of Processors
, 1991
"... Scheduling parallel tasks on an unbounded number of completely connected processors when communication overhead is taken into account is NPcomplete. Assuming that task duplication is not allowed, we propose a fast heuristic algorithm, called the dominant sequence clustering algorithm (DSC), for thi ..."
Abstract

Cited by 28 (3 self)
 Add to MetaCart
Scheduling parallel tasks on an unbounded number of completely connected processors when communication overhead is taken into account is NPcomplete. Assuming that task duplication is not allowed, we propose a fast heuristic algorithm, called the dominant sequence clustering algorithm (DSC
Distributed Storage Support in Private Clouds Based on Static Scheduling Algorithms
 In CLOUD COMPUTING 2011, The Second International Conference on Cloud Computing, GRIDs, and Virtualization
, 2011
"... Abstract—This paper is focused on an extension to an open source Infrastructure as a Service Cloud called Eucalytpus for supporting distributed storage according to a defined storage strategy. As a proof of concept, three algorithms known from the scheduling theory were implemented, namely MonteCarl ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract—This paper is focused on an extension to an open source Infrastructure as a Service Cloud called Eucalytpus for supporting distributed storage according to a defined storage strategy. As a proof of concept, three algorithms known from the scheduling theory were implemented, namely Monte
An Improved Quasistatic Scheduling Algorithm for Mixed DataControl Embedded Software
"... Abstract: An embedded system is defined as a set of concurrent processes that communicate through channels. Described in flow C, each process is a sequential program that may contain datadependent or synchronizationdependant control structures. A task is a set of sequential operations that the sys ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
that the system will perform to respond to the inputs from the environment. The embedded software coordinates these tasks generated for input events. A software synthesis approach includes two correlated parts: scheduling and code generation. Our scheduling algorithm can guarantee that all tasks can be executed
Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing
 IEEE TRANSACTIONS ON COMPUTERS
, 1987
"... Large grain data flow (LGDF) programming is natural and convenient for describing digital signal processing (DSP) systems, but its runtime overhead is costly in real time or costsensitive applications. In some situations, designers are not willing to squander computing resources for the sake of pro ..."
Abstract

Cited by 598 (37 self)
 Add to MetaCart
special case of Petri nets. This selfcontained paper develops the theory necessary to statically schedule SDF programs on single or multiple processors. A class of static (compile time) scheduling algorithms is proven valid, and specific algorithms are given for scheduling SDF systems onto single
A Static Scheduling Algorithm Using Dynamic Critical Path For Assigning Parallel Algorithms Onto Multiprocessors
"... algorithm for compiletime static scheduling of task graphs onto multiprocessors is proposed. The proposed algorithm, which is called Dynamic Critical Path (DCP) scheduling algorithm, is different from previously reported algorithms in a number of ways. First, it determines the critical path of the ..."
Abstract
 Add to MetaCart
algorithm for compiletime static scheduling of task graphs onto multiprocessors is proposed. The proposed algorithm, which is called Dynamic Critical Path (DCP) scheduling algorithm, is different from previously reported algorithms in a number of ways. First, it determines the critical path
Evaluation of Static Scheduling Algorithms Improved With Partial Strict Triggering of Program Graph Nodes
"... The problem of multiprocessor scheduling can be stated as finding a schedule for a general program graph to be executed on a multiprocessor system so that the schedule length can be minimised. This scheduling problem is known to be NPhard and heuristic algorithms have been proposed to obtain optima ..."
Abstract
 Add to MetaCart
The problem of multiprocessor scheduling can be stated as finding a schedule for a general program graph to be executed on a multiprocessor system so that the schedule length can be minimised. This scheduling problem is known to be NPhard and heuristic algorithms have been proposed to obtain
Scheduling Algorithms for Multiprogramming in a HardRealTime Environment
, 1973
"... The problem of multiprogram scheduling on a single processor is studied from the viewpoint... ..."
Abstract

Cited by 3756 (3 self)
 Add to MetaCart
The problem of multiprogram scheduling on a single processor is studied from the viewpoint...
Results 1  10
of
32,264