Concurrent Systems Need Both Sequences And Serializers
This report describes research done at the Artificial Intelligence Laboratory of the Massachusetts Institute of Technology. Support for the laboratory's artificial intelligence research is provided in part by the Office of Naval Research of the Department of Defense under contract N00014-75-C-0...
Main Author: | |
---|---|
Format: | Working Paper |
Language: | en_US |
Published: |
MIT Artificial Intelligence Laboratory
2008
|
Online Access: | http://hdl.handle.net/1721.1/41146 |
_version_ | 1826207423133646848 |
---|---|
author | Hewitt, Carl |
author_facet | Hewitt, Carl |
author_sort | Hewitt, Carl |
collection | MIT |
description | This report describes research done at the Artificial Intelligence Laboratory of the Massachusetts Institute of Technology. Support for the laboratory's artificial intelligence research is provided in part by the Office of Naval Research of the Department of Defense under contract N00014-75-C-0522. |
first_indexed | 2024-09-23T13:49:25Z |
format | Working Paper |
id | mit-1721.1/41146 |
institution | Massachusetts Institute of Technology |
language | en_US |
last_indexed | 2024-09-23T13:49:25Z |
publishDate | 2008 |
publisher | MIT Artificial Intelligence Laboratory |
record_format | dspace |
spelling | mit-1721.1/411462019-04-11T01:54:43Z Concurrent Systems Need Both Sequences And Serializers Hewitt, Carl This report describes research done at the Artificial Intelligence Laboratory of the Massachusetts Institute of Technology. Support for the laboratory's artificial intelligence research is provided in part by the Office of Naval Research of the Department of Defense under contract N00014-75-C-0522. Contemporary concurrent programming languages fall roughly into two classes. Languages in the first class support the notion of a sequence of values and some kind of pipelining operation over the sequence of values. Languages in the second class support the notion of transactions and some way to serialize transactions. In terms of the actor model of computation this distinction corresponds to the difference between serialized and unserialized actors. In this paper the utility of modeling both serialized and unserialized actors in a coherent formalism is demonstrated. MIT Artificial Intelligence Laboratory Department of Defense Office of Naval Research 2008-04-10T16:18:47Z 2008-04-10T16:18:47Z 1979-02 Working Paper http://hdl.handle.net/1721.1/41146 en_US MIT Artificial Intelligence Laboratory Working Papers, WP-179 application/pdf MIT Artificial Intelligence Laboratory |
spellingShingle | Hewitt, Carl Concurrent Systems Need Both Sequences And Serializers |
title | Concurrent Systems Need Both Sequences And Serializers |
title_full | Concurrent Systems Need Both Sequences And Serializers |
title_fullStr | Concurrent Systems Need Both Sequences And Serializers |
title_full_unstemmed | Concurrent Systems Need Both Sequences And Serializers |
title_short | Concurrent Systems Need Both Sequences And Serializers |
title_sort | concurrent systems need both sequences and serializers |
url | http://hdl.handle.net/1721.1/41146 |
work_keys_str_mv | AT hewittcarl concurrentsystemsneedbothsequencesandserializers |