Notes on the complexity of systolic programs
β Scribed by Stephen Taylor; Lisa Hellerstein; Shmuel Safra; Ehud Shapiro
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 894 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper we show, by providing a counterexample, that a heuristic used in [3] is wrong. We also propose an alternative solution, which in addition to being correct, also seems to offer better possibilities for parallelization.
We consider several problems related to maintaining and analyzing dataflow dependencies in AND-parallel execution of logic programs. Several problems related to optimal selection of literals for parallel execution are established to be intractable (NP-complete). Most importantly, we establish intrac