Output details

Alting barriers: synchronisation with choice in Java using JCSP

<08> This paper presents an algorithm for the fast resolution of (CSP external) choice between multiway synchronisation barriers (events) and describes its efficient binding into an extension (at the same time, simplification) of the JCSP concurrency library for Java. Previously, in line with all previous libraries and languages offering CSP primitives, external choice events were restricted to channel inputs and timeouts – prior algorithms for the resolution of general choice requiring expensive two-phase commits. This work opens almost all CSP-specified systems to direct implementation in Java/JCSP and lays the foundation for similar extensions in occam-pi and CSP libraries for other languages.