Parallel functional programming

Article View: comp.arch

Article #20640

#20640

From: Son of Knuth
Date: Tue, 04 Apr 1989 20:57

14 lines
1138 bytes

A functional program can be thought of as a tree, each node associated
with an operation.  A node is executed by first spawning all children
nodes, waiting for each child to reply with an answer, and then executing
the original parent node.  For parallel execution, you simply spawn
children in parallel.

I am looking for studies on the effects of the tree shape (e.g. branching
factor, branching factor distribution, node service time) on the resulting
performance.  
---
Subash Shankar             Honeywell Systems & Research Center
voice: (612) 782 7558      US Snail: 3660 Technology Dr., Minneapolis, MN 55418
shankar@src.honeywell.com  srcsip!shankar

Technical Details

Message-ID: <19971@srcsip.UUCP>

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!csd4.milw.wisc.edu!srcsip!bedrock!shankar

References: <19970@srcsip.UUCP>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!csd4.milw.wisc.edu!srcsip!bedrock!shankar
From: shankar@bedrock.SRC.Honeywell.COM (Son of Knuth)
Newsgroups: comp.arch
Subject: Parallel functional programming
Message-ID: <19971@srcsip.UUCP>
Date: 4 Apr 89 20:57:11 GMT
References: <19970@srcsip.UUCP>
Sender: news@src.honeywell.COM
Reply-To: shankar@bedrock.UUCP (Son of Knuth)
Organization: Honeywell Systems & Research Center, Camden, MN
Lines: 14

Reply to Parent Message