Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/7037
Full metadata record
DC FieldValueLanguage
dc.creatorChien, Andrew Andai-
dc.date2004-10-20T20:23:12Z-
dc.date2004-10-20T20:23:12Z-
dc.date1990-07-01-
dc.date.accessioned2013-10-09T02:48:04Z-
dc.date.available2013-10-09T02:48:04Z-
dc.date.issued2013-10-09-
dc.identifierAITR-1248-
dc.identifierhttp://hdl.handle.net/1721.1/7037-
dc.identifier.urihttp://koha.mediu.edu.my:8181/xmlui/handle/1721-
dc.descriptionFine-grained parallel machines have the potential for very high speed computation. To program massively-concurrent MIMD machines, programmers need tools for managing complexity. These tools should not restrict program concurrency. Concurrent Aggregates (CA) provides multiple-access data abstraction tools, Aggregates, which can be used to implement abstractions with virtually unlimited potential for concurrency. Such tools allow programmers to modularize programs without reducing concurrency. I describe the design, motivation, implementation and evaluation of Concurrent Aggregates. CA has been used to construct a number of application programs. Multi-access data abstractions are found to be useful in constructing highly concurrent programs.-
dc.format30264577 bytes-
dc.format10936330 bytes-
dc.formatapplication/postscript-
dc.formatapplication/pdf-
dc.languageen_US-
dc.relationAITR-1248-
dc.titleConcurrent Aggregates (CA): An Object-Oriented Language for Fine-Grained Message-Passing Machines-
Appears in Collections:MIT Items

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


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