Mapping multiple independent synchronous dataflow graphs onto heterogeneous multiprocessors

Author

Pino, José L. ; Parks, Thomas M. ; Lee, Edward A.

Author_Institution

Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA

Volume

2

fYear

1994

fDate

31 Oct-2 Nov 1994

Firstpage

1063

Abstract

We detail a method to facilitate development of real-time applications on heterogeneous multiprocessors. We introduce a new model of computation that allows for nondeterminate communication between independent dataflow graphs. The graphs may communicate in a manner that does not introduce data dependencies between them. We examine the implications of this model, introduce the necessary communication actors, and discuss scheduling techniques for multiple independent graphs. We also illustrate this model with some examples of real-time systems that have been constructed in Ptolemy

Keywords

data flow graphs; parallel programming; processor scheduling; resource allocation; signal processing; Ptolemy; communication actors; heterogeneous multiprocessors; independent dataflow graphs; multiple independent synchronous dataflow graphs; nondeterminate communication; real-time systems; scheduling techniques; Computational modeling; Data flow computing; Digital signal processing; Dynamic scheduling; Parallel processing; Processor scheduling; Real time systems; Runtime; Signal processing algorithms; Workstations;

fLanguage

English

Publisher

ieee

Conference_Titel

Signals, Systems and Computers, 1994. 1994 Conference Record of the Twenty-Eighth Asilomar Conference on

Conference_Location

Pacific Grove, CA

ISSN

1058-6393

Print_ISBN

0-8186-6405-3

Type

conf

DOI

10.1109/ACSSC.1994.471622

Filename

471622