Partitioning parallel programs for macro-data flow
Technical Report
·
OSTI ID:6595508
Partitioning techniques are necessary to execute functional programs at a coarse granularity. Fine-granularity execution is inefficient on general-purpose multiprocessors. There is a trade-off between parallelism and the overhead of exploiting parallelism. A compile-time partitioning approach to achieve this trade-off is presented.
- Research Organization:
- Stanford Univ., CA (USA). Computer Systems Lab.
- OSTI ID:
- 6595508
- Report Number(s):
- AD-A-177774/7/XAB
- Country of Publication:
- United States
- Language:
- English
Similar Records
Compile-time partitioning and scheduling of parallel programs
Partitioning and scheduling parallel programs for execution on multiprocessors
Compile-time partitioning and scheduling of parallel programs. Extended summary
Technical Report
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:6472061
Partitioning and scheduling parallel programs for execution on multiprocessors
Thesis/Dissertation
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:7043298
Compile-time partitioning and scheduling of parallel programs. Extended summary
Technical Report
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:7249733