Low overhead parallel schedules for task graphs

Authors:
R. Anderson;P. Beame;W. Ruzzo
Affiliations:
Department of Computer Science and Engineering, University of Washington, Seattle, WA;Department of Computer Science and Engineering, University of Washington, Seattle, WA;Department of Computer Science and Engineering, University of Washington, Seattle, WA
Venue:
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Year:
1990

A communication-time tradeoff

SIAM Journal on Computing
Supernode partitioning

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Towards an architecture-independent analysis of parallel algorithms

SIAM Journal on Computing
The String-to-String Correction Problem

Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation

Dynamic node reconfiguration in a parallel-distributed environment

PPOPP '91 Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming
Complexity results and algorithms for {

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Asynchronous Analysis of Parallel Dynamic Programming Algorithms

IEEE Transactions on Parallel and Distributed Systems
1-Optimality of static BSP computations: scheduling independent chains as a case study

Theoretical Computer Science
An optimal schedule for Gaussian elimination on an MIMD architecture

Journal of Computational and Applied Mathematics

Hi-index	0.00