Parallel programming with data driven model

Author

Tran, V.D. ; Hluchý, L. ; Nguyen, G.T.

Author_Institution

Inst. of Inf., Slovak Acad. of Sci., Slovakia

fYear

2000

fDate

6/22/1905 12:00:00 AM

Firstpage

205

Lastpage

211

Abstract

In this paper, bye present a new powerful method for parallel program representation called Data Driven Graph (DDG). DDG takes all advantages of classical Directed Acyclic graph (DAC) and adds much more. Simple definition, flexibility and ability to represent loops and dynamically created tasks. With DDG, scheduling becomes an efficient tool for increasing performance of parallel systems. DDG is not only a parallel program model, it also initiates a new parallel programming style, allows programmer to write a parallel program with minimal difficulty. We also present our parallel program development tool with support for DDG and scheduling

Keywords

directed graphs; parallel programming; data driven graph; data driven model; dynamically created tasks; loops; parallel program development tool; parallel program model; parallel programming; parallel programming style; scheduling; Application software; Databases; Delay; Hardware; Iterative algorithms; Parallel programming; Postal services; Processor scheduling; Programming profession; Real time systems;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Processing, 2000. Proceedings. 8th Euromicro Workshop on

Conference_Location

Rhodos

Print_ISBN

0-7695-0500-7

Type

conf

DOI

10.1109/EMPDP.2000.823413

Filename

823413