| dc.date.accessioned | 2008-08-26T16:22:14Z | |
| dc.date.accessioned | 2018-11-26T22:25:41Z | |
| dc.date.available | 2008-08-26T16:22:14Z | |
| dc.date.available | 2018-11-26T22:25:41Z | |
| dc.date.issued | 1978-04 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/41998 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/41998 | |
| dc.description | This report describes research conducted at the Artificial Intelligence Laboratory of the Massachusetts Institute of Technology. Support for this research was provided in part by the Office of Naval Research of the Department of Defense under Contract N00014-75-C-0522. | en |
| dc.description.abstract | This paper advocates a programming methodology using message passing. Efficient programs are derived for fast exponentiation, merging ordered sequences, and path existence determination in a directed graph. The problems have been proposed by John Reynolds as interesting ones to investigate because they illustrate significant issues in programming. The methodology advocated here is directed toward the production of programs that are intended to execute efficiently in a computing environment with many processors. The absence of the GOTO construct does not seem to be constricting in any respect in the development of efficient programs using the programming methodology advocated here. | en |
| dc.language.iso | en_US | en |
| dc.publisher | MIT Artificial Intelligence Laboratory | en |
| dc.title | Using Message Passing Instead of the GOTO Construct | en |
| dc.type | Working Paper | en |
