Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM - Special section on computer architecture
The connection machine
An example of stepwise refinement of distributed programs: quiescence detection
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Actors: a model of concurrent computation in distributed systems
Actors: a model of concurrent computation in distributed systems
Computer
Visual programming by transaction network
Proceedings of the Twenty-First Annual Hawaii International Conference on Software Track
ACM Transactions on Database Systems (TODS)
Concurrent programming for the masses (invited address)
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Associons: A Program Notation with Tuples Instead of Variables
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communicating sequential processes
Communications of the ACM
Formal Specification of Geographic Data Processing Requirements
Proceedings of the Second International Conference on Data Engineering
A system for algorithm animation
SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques
Implementing a shared dataspace language on a message-based multiprocessor
IWSSD '89 Proceedings of the 5th international workshop on Software specification and design
Mixed Programming Metaphors in a Shared Dataspace Model of Concurrency
IEEE Transactions on Software Engineering
A UNITY-Style Programming Logic for Shared Dataspace Programs
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
SDL (Shared Dataspace Language) is a language for writing and visualizing programs consisting of thousands of processes executing on a highly-parallel multiprocessor. SDL is based on a model in which processes use powerful transactions to manipulate abstract views of a virtual, content-addressable data structure called the dataspace. The process society is dynamic and supports varying degrees of process anonymity. The transactions are executed over abstract views of the dataspace. This facilitates elegant conceptualization of dataspace transformations and compact program representation. Processes and transactions enable SDL to combine elements of both large and fine grained concurrency. The view is a novel abstraction mechanism whose significance is derived from the fact that it allows processes to interrogate the dataspace at a level of abstraction convenient for the task they are pursuing. The view also plays a role in the definition of continuously updated, programmer-defined visual abstractions which enable exploration of the program's functionality and performance.