Producer-Consumer Pipelining for Structured-Data in a Fine-Grain Non-Strict Dataflow Language on Commodity Machines

Authors:
Kentaro Inenaga;Shigeru Kusakabe;Makoto Amamiya
Affiliations:
-;-;-
Venue:
IWIA '99 Proceedings of the 1999 International Workshop on Innovative Architecture
Year:
1999

Citing 5
Cited 0

I-structures: data structures for parallel computing

ACM Transactions on Programming Languages and Systems (TOPLAS)
Retire Fortran?: a debate rekindled

Communications of the ACM
Separation constraint partitioning: a new algorithm for partitioning non-strict programs into sequential threads

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Hybrid Approach for Non-strict Dataflow Program on Commodity Machine

ISHPC '97 Proceedings of the International Symposium on High Performance Computing
A Dataflow-Based Massively Parallel Programming Language and Its Implementation

PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fine-grain non-strict data structures such as I-structures provide high-level abstraction to easily write programs with potentially high parallelism due to the eager evaluation of non-strict functions and non-strict structured-data. Non-strict data structures require frequent dynamic scheduling at a fine-grain level, which offsets the gain of latency hiding and asynchronous accesses to structured-data using non-strict data structures. These cause heavy overhead on commodity machines. In order to solve these problems for fine-grain non-strict structured-data, we employ a method to analyze dependencies between the structured-data and to schedule their producers and consumers. The performance evaluation results indicate that the scheduling technique is effective to improve the performance of fine-grain non-strict programs on commodity machines.