{"id":149853,"date":"1989-06-01T00:00:00","date_gmt":"1989-06-01T00:00:00","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/msr-research-item\/high-performance-parallel-graph-reduction\/"},"modified":"2018-10-16T21:40:37","modified_gmt":"2018-10-17T04:40:37","slug":"high-performance-parallel-graph-reduction","status":"publish","type":"msr-research-item","link":"https:\/\/www.microsoft.com\/en-us\/research\/publication\/high-performance-parallel-graph-reduction\/","title":{"rendered":"High-performance parallel graph reduction"},"content":{"rendered":"

Parallel graph reduction is an attractive implementation for functional programming languages because of its simplicity and inherently distributed nature. This paper outlines some of the issues raised by parallel compiled graph reduction, and presents the approach we have adopted for our parallel machine, GRIP.<\/p>\n

\n

We concentrate on two main areas:<\/p>\n

\n