A graph-theoretic design process and software tool is presented for selecting a multiprocessing scheduling solution for a class of computational problems. The problems of interest are those that can be described using a dataflow graph and are intended to be executed repetitively on a set of identical parallel processors. Typical applications include signal processing and control law problems. Graph analysis techniques are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool is shown to facilitate the application of the design process to a given problem
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
Embedded multimedia systems often run multiple time-constrained applications simultaneously. These s...
Dataflow is a natural way of modelling streaming applications, such as multimedia, networking and ot...
Dataflow computers provide a platform for the solution of a large class of computational problems, w...
A new model is presented to describe dataflow algorithms implemented in a multiprocessing system. Ca...
The development of a new graph theoretic model for describing the relation between a decomposed algo...
This paper describes and analyzes a paradigm for scheduling com-putations on a network of multiproce...
The need for more processing power has spurred the development of new processor architectures. A pro...
The Processing Graph Method (PGM) --- a dataflow model widely used in the design and analysis of emb...
Four scheduling strategies for dataflow graphs onto parallel processors are classified: (1) fully dy...
The programming complexity of increasingly parallel processors calls for new tools to assist program...
The major problem addressed by this research is the development of one or more scheduling heuristics...
In this paper, we survey algorithms that allocate a parallel program represented by an edge-weighted...
[[abstract]]The data dependence graph (DDG) is a useful tool for the parallelism detection which is ...
International audienceThe synchronous dataflow model of computation is widely used to design embedde...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
Embedded multimedia systems often run multiple time-constrained applications simultaneously. These s...
Dataflow is a natural way of modelling streaming applications, such as multimedia, networking and ot...
Dataflow computers provide a platform for the solution of a large class of computational problems, w...
A new model is presented to describe dataflow algorithms implemented in a multiprocessing system. Ca...
The development of a new graph theoretic model for describing the relation between a decomposed algo...
This paper describes and analyzes a paradigm for scheduling com-putations on a network of multiproce...
The need for more processing power has spurred the development of new processor architectures. A pro...
The Processing Graph Method (PGM) --- a dataflow model widely used in the design and analysis of emb...
Four scheduling strategies for dataflow graphs onto parallel processors are classified: (1) fully dy...
The programming complexity of increasingly parallel processors calls for new tools to assist program...
The major problem addressed by this research is the development of one or more scheduling heuristics...
In this paper, we survey algorithms that allocate a parallel program represented by an edge-weighted...
[[abstract]]The data dependence graph (DDG) is a useful tool for the parallelism detection which is ...
International audienceThe synchronous dataflow model of computation is widely used to design embedde...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
Embedded multimedia systems often run multiple time-constrained applications simultaneously. These s...
Dataflow is a natural way of modelling streaming applications, such as multimedia, networking and ot...