Solving the Santa Claus Problem over a distributed system
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
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.
Originalsprog | Engelsk |
---|---|
Titel | Communicating Process Architectures 2017 and 2018, WoTUG-39 and WoTUG-40 - Proceedings of CPA 2017 (WoTUG-39) and Proceedings of CPA 2018 (WoTUG-40) |
Redaktører | Jan Baekgaard Pedersen, Kevin Chalmers, Jan F. Broenink, Brian Vinter, Kevin Vella, Peter H. Welch, Marc L. Smith, Kenneth Skovhede |
Antal sider | 15 |
Forlag | IMIA and IOS Press |
Publikationsdato | 2019 |
Sider | 475-489 |
ISBN (Elektronisk) | 9781614999485 |
DOI | |
Status | Udgivet - 2019 |
Begivenhed | 39th WoTUG Conference on Communicating Process Architectures, CPA 2017 and 40th WoTUG Conference on Communicating Process Architectures, CPA 2018 - Dresden, Tyskland Varighed: 19 aug. 2018 → 22 aug. 2018 |
Konference
Konference | 39th WoTUG Conference on Communicating Process Architectures, CPA 2017 and 40th WoTUG Conference on Communicating Process Architectures, CPA 2018 |
---|---|
Land | Tyskland |
By | Dresden |
Periode | 19/08/2018 → 22/08/2018 |
Navn | Concurrent Systems Engineering Series |
---|---|
Vol/bind | 70 |
ISSN | 1383-7575 |
ID: 241091053