Evaluating CSP as a programming model to build distributed systems

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  • Kenneth Skovhede
  • Brian Vinter

In this paper we investigate the use of the CSP programming model for implementing distributed systems in an educational setting. For a practical example we choose a well-studied classic distributed system: a distributed hash table. We describe our implementation and compare it to a number of existing open-source implementations. We discuss a number of parameters for the example implementation, such as amount of code, potential for errors, and similar parameters.

Original languageEnglish
Title of host publicationCommunicating Process Architectures 2017 and 2018, WoTUG-39 and WoTUG-40 - Proceedings of CPA 2017 (WoTUG-39) and Proceedings of CPA 2018 (WoTUG-40)
EditorsJan Baekgaard Pedersen, Kevin Chalmers, Jan F. Broenink, Brian Vinter, Kevin Vella, Peter H. Welch, Marc L. Smith, Kenneth Skovhede
Number of pages11
PublisherIMIA and IOS Press
Publication date2019
Pages451-461
ISBN (Electronic)9781614999485
DOIs
Publication statusPublished - 2019
Event39th WoTUG Conference on Communicating Process Architectures, CPA 2017 and 40th WoTUG Conference on Communicating Process Architectures, CPA 2018 - Dresden, Germany
Duration: 19 Aug 2018 → 22 Aug 2018

Conference

Conference39th WoTUG Conference on Communicating Process Architectures, CPA 2017 and 40th WoTUG Conference on Communicating Process Architectures, CPA 2018
LandGermany
ByDresden
Periode19/08/2018 → 22/08/2018
SeriesConcurrent Systems Engineering Series
Volume70
ISSN1383-7575

    Research areas

  • Concurrency, CSP, DHT, Distributed hash table, Education, Kademlia, Teaching

ID: 241090996