Solving the Santa Claus Problem over a distributed system
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
A working solution to the Santa Claus Problem is demonstrated that operates over a distributed system. It is designed and modelled using the client/server model to maintain a deadlock and livelock free architecture. The system was developed using the JCSP library for Java and demonstrated over a network of twenty desktop PCs. Each Santa, Reindeer and Elf process is broken down into numerous sub-processes, and are each designed according to the client/server model. A novel approach to the Elves is presented using a chain-based architecture to allow non-determined sub-groups to communicate and consult with Santa in sets of three.
Original language | English |
---|---|
Title of host publication | Communicating Process Architectures 2017 and 2018, WoTUG-39 and WoTUG-40 - Proceedings of CPA 2017 (WoTUG-39) and Proceedings of CPA 2018 (WoTUG-40) |
Editors | Jan Baekgaard Pedersen, Kevin Chalmers, Jan F. Broenink, Brian Vinter, Kevin Vella, Peter H. Welch, Marc L. Smith, Kenneth Skovhede |
Number of pages | 15 |
Publisher | IMIA and IOS Press |
Publication date | 2019 |
Pages | 475-489 |
ISBN (Electronic) | 9781614999485 |
DOIs | |
Publication status | Published - 2019 |
Event | 39th 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
Conference | 39th WoTUG Conference on Communicating Process Architectures, CPA 2017 and 40th WoTUG Conference on Communicating Process Architectures, CPA 2018 |
---|---|
Land | Germany |
By | Dresden |
Periode | 19/08/2018 → 22/08/2018 |
Series | Concurrent Systems Engineering Series |
---|---|
Volume | 70 |
ISSN | 1383-7575 |
- Client/server model, CSP, JCSP, Santa Claus Problem
Research areas
ID: 241091053