1. DSpace at MEDIU
  2. Harvested articles مقالات مستوردة من مؤسسات وجامعات عالمية
  3. MIT Items
Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6953
Full metadata record
DC FieldValueLanguage
dc.creatorBlelloch, Guy-
dc.date2004-10-20T20:10:23Z-
dc.date2004-10-20T20:10:23Z-
dc.date1986-11-01-
dc.date.accessioned2013-10-09T02:47:56Z-
dc.date.available2013-10-09T02:47:56Z-
dc.date.issued2013-10-09-
dc.identifierAITR-918-
dc.identifierhttp://hdl.handle.net/1721.1/6953-
dc.identifier.urihttp://koha.mediu.edu.my:8181/xmlui/handle/1721-
dc.descriptionComputational models are arising is which programs are constructed by specifying large networks of very simple computational devices. Although such models can potentially make use of a massive amount of concurrency, their usefulness as a programming model for the design of complex systems will ultimately be decided by the ease in which such networks can be programmed (constructed). This thesis outlines a language for specifying computational networks. The language (AFL-1) consists of a set of primitives, ad a mechanism to group these elements into higher level structures. An implementation of this language runs on the Thinking Machines Corporation, Connection machine. Two significant examples were programmed in the language, an expert system (CIS), and a planning system (AFPLAN). These systems are explained and analyzed in terms of how they compare with similar systems written in conventional languages.-
dc.format14850755 bytes-
dc.format5628932 bytes-
dc.formatapplication/postscript-
dc.formatapplication/pdf-
dc.languageen_US-
dc.relationAITR-918-
dc.titleAFL-1: A Programming Language for Massively Concurrent Computers-
Appears in Collections:MIT Items

Files in This Item:
There are no files associated with this item.
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.