Affiliation:
1. Massachusetts Institute of Technology, Cambridge, Massachusetts
Abstract
This paper investigates some problems associated with an argument evaluation order that we call “future” order, which is different from both call-by-name and call-by-value, In call-by-future, each formal parameter of a function is bound to a separate process (called a “future”) dedicated to the evaluation of the corresponding argument. This mechanism allows the fully parallel evaluation of arguments to a function, and has been shown to augment the expressive power of a language.
We discuss an approach to a problem that arises in this context: futures which were thought to be relevant when they were created become irrelevant through being ignored in the body of the expression where they were bound. The problem of irrelevant processes also appears in multiprocessing problem-solving systems which start several processors working on the same problem but with different methods, and return with the solution which finishes first. This
parallel method
strategy has the drawback that the processes which are investigating the losing methods must be identified, stopped, and re-assigned to more useful tasks.
Publisher
Association for Computing Machinery (ACM)
Reference19 articles.
1. List processing in real time on a serial computer
2. Minimal and optimal computations of recursive programs
3. A nonrecursive list compacting algorithm
4. Dijkstra E. W. Lamport L. Martin A. J. Scholten C. S. Steffens E. F. M. "On-the-fly Garbage Collection: An Exercise in Cooperation". Dijkstra note EWD496 June 1975. Dijkstra E. W. Lamport L. Martin A. J. Scholten C. S. Steffens E. F. M. "On-the-fly Garbage Collection: An Exercise in Cooperation". Dijkstra note EWD496 June 1975.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献