Parallel programming with data driven model

  • Authors:
  • V. D. Tran;L. Hluchý;G. T. Nguyen

  • Affiliations:
  • Institute of Informatics, Slovak Academy of Sciences;Institute of Informatics, Slovak Academy of Sciences;Institute of Informatics, Slovak Academy of Sciences

  • Venue:
  • EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present a new powerful method for parallel program representation called Data Driven Graph (DDG). DDG takes all advantages of classical Directed Acyclic Graph (DAG) 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.