Solving the Santa Claus Problem Over a Distributed System

Marchant, David; Kerridge, Jon

Abstract

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 subgroups to communicate and consult with Santa in sets of three.

Citation

Marchant, D., & Kerridge, J. (2018). Solving the Santa Claus Problem Over a Distributed System. In K. Chalmers, J. Bækgaard Pedersen, F. Barnes, J. Broenink, R. Ivimey-Cook, A. Sampson, …B. Vinter (Eds.), Communicating Process Architectures 2018

• Conference Name: Communicating Process Architectures
• Conference Location: Dresden
• Start Date: Aug 19, 2018
• End Date: Aug 22, 2018
• Acceptance Date: Aug 1, 2018
• Online Publication Date: Sep 25, 2018
• Publication Date: Sep 25, 2018
• Deposit Date: Sep 25, 2018
• Publicly Available Date: Sep 25, 2018
• Publisher: IOS Press
• Series Title: Communicating Process Architectures
• Book Title: Communicating Process Architectures 2018
• Keywords: Santa Claus Problem; CSP; JCSP; Client/Server model
• Public URL: http://researchrepository.napier.ac.uk/Output/1305147
• Publisher URL: https://www.iospress.nl/