This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dec. 1985 (vol. 34 no. 12)
pp. 1190-1193
F. Warren Burton, Department of Electrical Engineering and Computer Science, University of Colorado at Denver, Denver, CO 80202
Many problems can be solved more quickly on parallel machines if some work can be started before it is known to be necessary. If work which is known to be necessary (mandatory work) is given priority over other work (speculative work), then performing speculative work can only speed computation. A simple functional language feature to control speculative work is proposed.
Index Terms:
speculation computation,Backtracking,combinatorial searching,functional programming,parallelism,priorities
Citation:
F. Warren Burton, "Speculative computation, parallelism, and functional programming," IEEE Transactions on Computers, vol. 34, no. 12, pp. 1190-1193, Dec. 1985, doi:10.1109/TC.1985.6312218
Usage of this product signifies your acceptance of the Terms of Use.