A system for interprocess communication in a resource sharing computer network
Communications of the ACM
The nucleus of a multiprogramming system
Communications of the ACM
Metric (Extended Abstract): A kernel instrumentation system for distributed environments
SOSP '77 Proceedings of the sixth ACM symposium on Operating systems principles
Polyvalues: A tool for implementing atomic updates to distributed data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
A distributed host-based worm detection system
Proceedings of the 2006 SIGCOMM workshop on Large-scale attack defense
TRANSACT: A Transactional Framework for Programming Wireless Sensor/Actor Networks
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Synchronization protocols for reliable communication in fully distributed agent systems
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Competitive Contract Net Protocol
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Secure internet voting with code sheets
VOTE-ID'07 Proceedings of the 1st international conference on E-voting and identity
Randomization can be a healer: consensus with dynamic omission failures
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Capauth: a capability-based handover scheme
INFOCOM'10 Proceedings of the 29th conference on Information communications
Shared mental models: a conceptual analysis
COIN@AAMAS'10 Proceedings of the 6th international conference on Coordination, organizations, institutions, and norms in agent systems
Sovereign information sharing among malicious partners
SDM'06 Proceedings of the Third VLDB international conference on Secure Data Management
| Hi-index | 0.00 |
A number of properties and features of interprocess communication systems are presented, with emphasis on those necessary or desirable in a network environment. The interactions between these features are examined, and the consequences of their inclusion in a system are explored. Of special interest are the time-out feature which forces all system table entries to “die of old age” after they have remained unused for some period of time, and the insertion property which states that it is always possible to design a process which may be invisibly inserted into the communication path between any two processes. Though not tied to any particular system, the discussion concentrates on distributed systems of sequential processes (no interrupts) with no system buffering.