Separation constraint partitioning: a new algorithm for partitioning non-strict programs into sequential threads

Authors:
Klaus E. Schauser;David E. Culler;Seth C. Goldstein
Affiliations:
Department of Computer Science, University of California, Santa Barbara, Santa Barbara, CA;Computer Science Division, University of California, Berkeley, Berkeley, CA;Computer Science Division, University of California, Berkeley, Berkeley, CA
Venue:
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Year:
1995

Citing 26
Cited 7

The Manchester prototype dataflow computer

Communications of the ACM - Special section on computer architecture
Strictness analysis—a practical approach

Proc. of a conference on Functional programming languages and computer architecture
Compile-time partitioning and scheduling of parallel programs

SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
The program dependence graph and its use in optimization

ACM Transactions on Programming Languages and Systems (TOPLAS)
A RISC architecture for symbolic computation

ASPLOS II Proceedings of the second international conference on Architectual support for programming languages and operating systems
GRIP—A high-performance architecture for parallel graph reduction

Proc. of a conference on Functional programming languages and computer architecture
An architecture of a dataflow single chip processor

ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
Executing a Program on the MIT Tagged-Token Dataflow Architecture

IEEE Transactions on Computers
P-TAC: a parallel intermediate language

FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Implementation of non-strict functional programming languages

Implementation of non-strict functional programming languages
Compiler-controlled multithreading for lenient parallel languages

Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
Generating efficient code for lazy functional languages

Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
T: a multithreaded massively parallel architecture

ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
Global analysis for partitioning non-strict programs into sequential threads

LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
TAM—a compiler controlled threaded abstract machine

Journal of Parallel and Distributed Computing - Special issue on dataflow and multithreaded architectures
Evaluation of mechanisms for fine-grained parallel programs in the J-machine and the CM-5

ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
Compiling lenient languages for parallel asynchronous execution

Compiling lenient languages for parallel asynchronous execution
Monsoon: an explicit token-store architecture

ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
A Multithreaded Implementation of Id using P-RISC Graphs

Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing
Path Semantics

Proceedings of the 3rd Workshop on Mathematical Foundations of Programming Language Semantics
The Initial Performance of a Bottom-Up Clustering Algorithm for Dataflow Graphs

PACT '93 Proceedings of the IFIP WG10.3. Working Conference on Architectures and Compilation Techniques for Fine and Medium Grain Parallelism
The Theory and Practice of Transforming Call-by-need into Call-by-value

Proceedings of the Fourth 'Colloque International sur la Programmation' on International Symposium on Programming
Performance measurements on HEP - a pipelined MIMD computer

ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture
A COMPILER FOR THE MIT TAGGED-TOKEN DATAFLOW ARCHITECTURE

A COMPILER FOR THE MIT TAGGED-TOKEN DATAFLOW ARCHITECTURE
The Implementation of a Threaded Abstract Machine

The Implementation of a Threaded Abstract Machine
Multiprocessor execution of functional programs

Multiprocessor execution of functional programs

How much non-strictness do lenient programs require?

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Space-efficient scheduling of parallelism with synchronization variables

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Thread partitioning and scheduling based on cost model

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Compiler support for efficient processing of XML datasets

ICS '03 Proceedings of the 17th annual international conference on Supercomputing
Producer-Consumer Pipelining for Structured-Data in a Fine-Grain Non-Strict Dataflow Language on Commodity Machines

IWIA '99 Proceedings of the 1999 International Workshop on Innovative Architecture
Optimistic evaluation: an adaptive evaluation strategy for non-strict programs

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Integrating multithreading into the spineless tagless G-machine

FP'95 Proceedings of the 1995 international conference on Functional Programming

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we present substantially improved thread partitioning algorithms for modern implicitly parallel languages. We present a new block partitioning algorithm, separation constraint partitioning, which is both more powerful and more flexible than previous algorithms. Our algorithm is guaranteed to derive maximal threads. We present a theoretical framework for proving the correctness of our partitioning approach, and we show how separation constraint partitioning makes interprocedural partitioning viable.We have implemented the partitioning algorithms in an Id90 compiler for workstations and parallel machines. Using this experimental platform, we quantify the effectiveness of different partitioning schemes on whole applications.