From determinacy to systaltic arrays
Journal Article
·
· IEEE Trans. Comput.; (United States)
In this paper the authors extend a model for parallel computation. They show that the extended model is deterministic, in the sense that under different scheduling regimes each process in the computation consumes the same input and generates the same output. Moreover, if the computation halts, the final state is independent of scheduling. The model is applied to the generation of precedence graphs, from which lower time bounds may be deduced, and to the synchronization of systolic arrays by local rather than global control.
- Research Organization:
- Dept. of Computer Science, Univ. of Maryland, College Park, MD 20742
- OSTI ID:
- 5756758
- Journal Information:
- IEEE Trans. Comput.; (United States), Vol. C-36:11
- Country of Publication:
- United States
- Language:
- English
Similar Records
Mapping algorithms to VLSI array processors
A comprehensive methodology for algorithm characterization, regularization and mapping into optimal VLSI arrays
VLSI design and synthesis for a class of two-dimensional problems
Thesis/Dissertation
·
Thu Jan 01 00:00:00 EST 1987
·
OSTI ID:5756758
A comprehensive methodology for algorithm characterization, regularization and mapping into optimal VLSI arrays
Miscellaneous
·
Sun Jan 01 00:00:00 EST 1989
·
OSTI ID:5756758
VLSI design and synthesis for a class of two-dimensional problems
Miscellaneous
·
Sun Jan 01 00:00:00 EST 1989
·
OSTI ID:5756758