<%@ page language="java" contentType="text/html" %>
<%-- Include common initialisation code --%>
<%@ include file="/arch/common.jsp" %>
<%-- The current tab --%>
<% String currentTab = "Research"; %>
<%-- Content of navigation pane --%>
<%@ include file="nav.jsp" %>
<% showCurrentLink=true; %>
<%-- Current navigation location --%>
<% String currentNav = "Reports and Theses"; %>
<%-- Include the code for the document header --%>
<%@ include file="/arch/header.jsp" %>
Research Report CS-RR-210
<%-- Include the code for the lines and navigation --%>
<%@ include file="/arch/middle.jsp" %>
M.S. Joy and T.H. Axford,
Parallel Combinator Reduction: Some Performance Bounds
(March 1, 1992).
Abstract
A parallel graph reduction machine simulator is described. This performs
combinator reduction and can simulate various different parallel
reduction strategies. A number of functional programs are examined,
and experimental results presented comparing the amount of parallelism
obtainable using explicit divide-and-conquer with the maximum amount of
parallelism available in the programs.
Download
cs-rr-210.ps.gz
<%-- Include the code for the document footer --%>
<%@ include file="/arch/footer.jsp" %>