AFL-1: A Programming Language for Massively Concurrent Computers
Computational 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 wil...
| Main Author: | |
|---|---|
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://hdl.handle.net/1721.1/6953 |
| _version_ | 1811080975254290432 |
|---|---|
| author | Blelloch, Guy |
| author_facet | Blelloch, Guy |
| author_sort | Blelloch, Guy |
| collection | MIT |
| description | Computational 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. |
| first_indexed | 2024-09-23T11:39:49Z |
| id | mit-1721.1/6953 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T11:39:49Z |
| publishDate | 2004 |
| record_format | dspace |
| spelling | mit-1721.1/69532019-04-12T08:33:38Z AFL-1: A Programming Language for Massively Concurrent Computers Blelloch, Guy Computational 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. 2004-10-20T20:10:23Z 2004-10-20T20:10:23Z 1986-11-01 AITR-918 http://hdl.handle.net/1721.1/6953 en_US AITR-918 14850755 bytes 5628932 bytes application/postscript application/pdf application/postscript application/pdf |
| spellingShingle | Blelloch, Guy AFL-1: A Programming Language for Massively Concurrent Computers |
| title | AFL-1: A Programming Language for Massively Concurrent Computers |
| title_full | AFL-1: A Programming Language for Massively Concurrent Computers |
| title_fullStr | AFL-1: A Programming Language for Massively Concurrent Computers |
| title_full_unstemmed | AFL-1: A Programming Language for Massively Concurrent Computers |
| title_short | AFL-1: A Programming Language for Massively Concurrent Computers |
| title_sort | afl 1 a programming language for massively concurrent computers |
| url | http://hdl.handle.net/1721.1/6953 |
| work_keys_str_mv | AT blellochguy afl1aprogramminglanguageformassivelyconcurrentcomputers |