ACM Transactions on Programming Languages and Systems (TOPLAS)
High level programming for distributed computing
Communications of the ACM
Communicating sequential processes
Communications of the ACM
Distributed processes: a concurrent programming concept
Communications of the ACM
Communications of the ACM
Monitors: an operating system structuring concept
Communications of the ACM
Synchronization in actor systems
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Operating system principles
Principles of proving concurrent programs in Gypsy
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An overview of the new routing algorithm for the ARPANET
SIGCOMM '79 Proceedings of the sixth symposium on Data communications
Proceedings of the ACM SIGPLAN SIGOA symposium on Text manipulation
On the duality of operating system structures
ACM SIGOPS Operating Systems Review
Preliminary Ada reference manual
ACM SIGPLAN Notices - Preliminary Ada reference manual
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Integrated Service Deployment for Active Networks
IWAN '02 Proceedings of the IFIP-TC6 4th International Working Conference on Active Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Active networks
Toward in vivo nanoscale communication networks: utilizing an active network architecture
Frontiers of Computer Science in China
Messages with implicit destinations as mobile agents
Proceedings of the 2nd edition on Programming systems, languages and applications based on actors, agents, and decentralized control abstractions
Using HPX and LibGeoDecomp for scaling HPC applications on heterogeneous supercomputers
ScalA '13 Proceedings of the Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems
| Hi-index | 0.00 |
Network algorithms are usually stated from the viewpoint of the network nodes, but they can often be stated more clearly from the viewpoint of an active message, a process that intentionally moves from node to node. This paper gives some examples of this notion, and then discusses a means of implementing it. This implementation applied in both directions also demonstrates the logical equivalence of the two viewpoints.