Reducing Graph Copying Costs Time to Wrap it Up


Graph copying is used in parallel implementations of functional languages on architectures with distributed memory. This paper will explore the costs of graph copying in detail. It will make clear that these costs can form a bottleneck for a class of serious parallel programs. This not only comprises practical divide and conquer style programs of which… (More)


6 Figures and Tables

Slides referencing similar topics