A Graph Model for Parallel Computations
This report presents a computational model called program graphs which makes possible a precise description of parallel computations of arbitrary complexity on non-structured data. In the model, the computation steps are represented by the nodes of a directed graph whose links represent elements...
Main Author: | Rodrigues, Jorge E. |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149383 |
Similar Items
-
Efficient Graph Algorithms for Sequential and Parallel Computers
by: Goldberg, Andrew V.
Published: (2023) -
Efficient graph algorithms for sequential and parallel computers
by: Goldberg, Andrew Vladislav
Published: (2005) -
Parallel algorithms for scheduling data-graph computations
by: Hasenplaugh, William Cleaburn
Published: (2016) -
Parallel graph algorithm
by: Nguyen, Duc Hieu.
Published: (2012) -
Communication-efficient Parallel Graph Algorithms
by: Leiserson, Charles E., et al.
Published: (2023)