Formalizing functional parallelism
Abstract: "The problem of detecting functional parallelism (also referred as DAG parallelism) was studied in [CHH89]. In this paper we formalize the concept of functional parallelism through the notion of precedence in terms of paths in graphs incorporating control and data dependences. Precede...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Urbana, Ill.
1991
|
| Schriftenreihe: | Center for Supercomputing Research and Development <Urbana, Ill,>: CSRD report
1141 |
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | Abstract: "The problem of detecting functional parallelism (also referred as DAG parallelism) was studied in [CHH89]. In this paper we formalize the concept of functional parallelism through the notion of precedence in terms of paths in graphs incorporating control and data dependences. Precedences were also defined in [CS88] in a different context, however, the definition was dependent on the ideas of parallel execution and time. We show that the problem of determining precedences statically is NP-complete. Determining precedence relationship is useful in finding the essential data dependences for synchronization purposes. We show that there exists a unique minimum set of essential data dependences, finding this minimum set is NP-hard and NP-easy." |
|---|---|
| Beschreibung: | 31 Bl. |