Brown, Neil C.C. (2010) Conjoined Events. In: Advances in Message Passing, 2010. . ACM (KAR id:33878)
|
PDF
Author's Accepted Manuscript
Language: English |
|
|
Download this file (PDF/211kB) |
Preview |
| Request a format suitable for use with assistive technology e.g. a screenreader | |
Abstract
Many existing synchronous message-passing systems support
choice: engaging in one event XOR another. This paper introduces the AND operator that allows a process to engage in multiple
events together (one AND one more AND another; all conjoined),
engaging in each event only if it can atomically engage in all the
conjoined events. We demonstrate using several examples that this
operator supports new, more ?exible models of programming. We
show that the AND operator allows the behaviour of processes to
be expressed in local rules rather than system-wide constructs. We
give an optimised implementation of the AND operator and explore
the performance effect on standard communications of supporting
this new operator.
| Item Type: | Conference or workshop item (Paper) |
|---|---|
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
| Depositing User: | Neil Brown |
| Date Deposited: | 09 May 2013 15:31 UTC |
| Last Modified: | 05 Nov 2024 10:17 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/33878 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Download Statistics
Download Statistics
