Asynchronous readers and asynchronous writers

Research output: Contribution to conferencePaperAcademicpeer-review

22 Downloads (Pure)

Abstract

Abstract. Reading and writing is modelled in CSP using actions containing the
symbols ? and !. These reading actions and writing actions are synchronous, and there is a one-to-one relationship between occurrences of pairs of these actions. In the CPA conference 2016, we introduced the half-synchronous alphabetised parallel operator X⇓Y , which disconnects the writing to and reading from a channel in time. We introduce in this paper an extension of X⇓Y , where the definition of X⇓Y is relaxed; the reading processes are divided into
sets which are set-wise asynchronous, but intra-set-wise synchronous, giving
full flexibility to the asynchronous writes and reads. Furthermore, we allow
multiple writers to the same channel and we study the impact on a Vertex
Removing Synchronised Product. The advantages we accomplish are that the
extension of X⇓Y gives more flexibility by indexing the reading actions and
allowing multiple write actions to the same channel. Furthermore, the extension of X⇓Y reduces the end-to-end processing time of the processor or coprocessor in a distributed computing system. We show the effects of these advantages in a case study describing a Controlled Emergency Stop for a processor-coprocessor combination.
Original languageEnglish
Pages79
Number of pages20
Publication statusPublished - 23 Aug 2017
EventCommunicating Process Architectures, CPA 2017: 39th WoTUG Conference on Concurrent and Parallel Programming - University of Malta, Sliema, Malta
Duration: 20 Aug 201723 Aug 2017
Conference number: 39
http://www.wotug.org/cpa2017/

Conference

ConferenceCommunicating Process Architectures, CPA 2017
Abbreviated titleCPA
CountryMalta
CitySliema
Period20/08/1723/08/17
Internet address

Fingerprint

Distributed computer systems
Processing
Coprocessor

Keywords

  • CSP; Half-Synchronous Alphabetised Parallel Operator; Asynchronous Write Actions; Asynchronous Read Actions; Asynchronous Write-Read Actions; Vertex Removing Synchronised Product

Cite this

Boode, A. H., & Broenink, J. F. (2017). Asynchronous readers and asynchronous writers. 79. Paper presented at Communicating Process Architectures, CPA 2017, Sliema, Malta.
Boode, Antoon Hendrik ; Broenink, Johannes F. / Asynchronous readers and asynchronous writers. Paper presented at Communicating Process Architectures, CPA 2017, Sliema, Malta.20 p.
@conference{24644894c2bc4c7b92ab9616c3edce87,
title = "Asynchronous readers and asynchronous writers",
abstract = "Abstract. Reading and writing is modelled in CSP using actions containing thesymbols ? and !. These reading actions and writing actions are synchronous, and there is a one-to-one relationship between occurrences of pairs of these actions. In the CPA conference 2016, we introduced the half-synchronous alphabetised parallel operator X⇓Y , which disconnects the writing to and reading from a channel in time. We introduce in this paper an extension of X⇓Y , where the definition of X⇓Y is relaxed; the reading processes are divided intosets which are set-wise asynchronous, but intra-set-wise synchronous, givingfull flexibility to the asynchronous writes and reads. Furthermore, we allowmultiple writers to the same channel and we study the impact on a VertexRemoving Synchronised Product. The advantages we accomplish are that theextension of X⇓Y gives more flexibility by indexing the reading actions andallowing multiple write actions to the same channel. Furthermore, the extension of X⇓Y reduces the end-to-end processing time of the processor or coprocessor in a distributed computing system. We show the effects of these advantages in a case study describing a Controlled Emergency Stop for a processor-coprocessor combination.",
keywords = "CSP; Half-Synchronous Alphabetised Parallel Operator; Asynchronous Write Actions; Asynchronous Read Actions; Asynchronous Write-Read Actions; Vertex Removing Synchronised Product",
author = "Boode, {Antoon Hendrik} and Broenink, {Johannes F.}",
year = "2017",
month = "8",
day = "23",
language = "English",
pages = "79",
note = "Communicating Process Architectures, CPA 2017 : 39th WoTUG Conference on Concurrent and Parallel Programming, CPA ; Conference date: 20-08-2017 Through 23-08-2017",
url = "http://www.wotug.org/cpa2017/",

}

Boode, AH & Broenink, JF 2017, 'Asynchronous readers and asynchronous writers' Paper presented at Communicating Process Architectures, CPA 2017, Sliema, Malta, 20/08/17 - 23/08/17, pp. 79.

Asynchronous readers and asynchronous writers. / Boode, Antoon Hendrik; Broenink, Johannes F.

2017. 79 Paper presented at Communicating Process Architectures, CPA 2017, Sliema, Malta.

Research output: Contribution to conferencePaperAcademicpeer-review

TY - CONF

T1 - Asynchronous readers and asynchronous writers

AU - Boode, Antoon Hendrik

AU - Broenink, Johannes F.

PY - 2017/8/23

Y1 - 2017/8/23

N2 - Abstract. Reading and writing is modelled in CSP using actions containing thesymbols ? and !. These reading actions and writing actions are synchronous, and there is a one-to-one relationship between occurrences of pairs of these actions. In the CPA conference 2016, we introduced the half-synchronous alphabetised parallel operator X⇓Y , which disconnects the writing to and reading from a channel in time. We introduce in this paper an extension of X⇓Y , where the definition of X⇓Y is relaxed; the reading processes are divided intosets which are set-wise asynchronous, but intra-set-wise synchronous, givingfull flexibility to the asynchronous writes and reads. Furthermore, we allowmultiple writers to the same channel and we study the impact on a VertexRemoving Synchronised Product. The advantages we accomplish are that theextension of X⇓Y gives more flexibility by indexing the reading actions andallowing multiple write actions to the same channel. Furthermore, the extension of X⇓Y reduces the end-to-end processing time of the processor or coprocessor in a distributed computing system. We show the effects of these advantages in a case study describing a Controlled Emergency Stop for a processor-coprocessor combination.

AB - Abstract. Reading and writing is modelled in CSP using actions containing thesymbols ? and !. These reading actions and writing actions are synchronous, and there is a one-to-one relationship between occurrences of pairs of these actions. In the CPA conference 2016, we introduced the half-synchronous alphabetised parallel operator X⇓Y , which disconnects the writing to and reading from a channel in time. We introduce in this paper an extension of X⇓Y , where the definition of X⇓Y is relaxed; the reading processes are divided intosets which are set-wise asynchronous, but intra-set-wise synchronous, givingfull flexibility to the asynchronous writes and reads. Furthermore, we allowmultiple writers to the same channel and we study the impact on a VertexRemoving Synchronised Product. The advantages we accomplish are that theextension of X⇓Y gives more flexibility by indexing the reading actions andallowing multiple write actions to the same channel. Furthermore, the extension of X⇓Y reduces the end-to-end processing time of the processor or coprocessor in a distributed computing system. We show the effects of these advantages in a case study describing a Controlled Emergency Stop for a processor-coprocessor combination.

KW - CSP; Half-Synchronous Alphabetised Parallel Operator; Asynchronous Write Actions; Asynchronous Read Actions; Asynchronous Write-Read Actions; Vertex Removing Synchronised Product

UR - http://www.wotug.org/cpa2017/preprints/02-preprint.pdf

M3 - Paper

SP - 79

ER -

Boode AH, Broenink JF. Asynchronous readers and asynchronous writers. 2017. Paper presented at Communicating Process Architectures, CPA 2017, Sliema, Malta.