Annual Conference: Communicating Process Architectures
Communicating Process Architectures 2015,
the 37th. WoTUG conference on concurrent and parallel systems, takes place from
Sunday August 23rd. to Wednesday August 26th. 2015 and is hosted by the
School of Computing,
University of Kent.
Accommodation and evening Fringe sessions will be at
a few minutes walk from the School.
WoTUG provides a forum for the discussion and promotion of concurrency ideas,
tools and products in computer science.
It organises specialist workshops and annual conferences that address
key concurrency issues at all levels of software and hardware granularity.
WoTUG aims to progress the leading state of the art in:
and to stimulate discussion and ideas on the roles concurrency will play in the future:
theory (programming models, process algebra, semantics, ...);
practice (multicore processors and run-times, clusters, clouds, libraries, languages, verification, model checking, ...);
education (at school, undergraduate and postgraduate levels, ...);
applications (complex systems, modelling, supercomputing, embedded systems, robotics, games, e-commerce, ...);
Of course, neither of the above sets of bullets are exclusive.
for the next generation of scalable computer infrastructure (hard and soft) and application,
where scaling means the ability to ramp up functionality (stay in control as complexity increases)
as well as physical metrics (such as absolute performance and response times);
for system integrity (dependability, security, safety, liveness, ...);
for making things simple.
A database of papers and presentations from WoTUG conferences is here.
The Abstract below has been randomly selected from this database.
PICOMS: Prioritised Inferred Choice Over Multiway Synchronisation
The ability to make a choice over multiway synchronisations (COMS) has
always been an integral part of CSP. However, it is something that
has been conspicuous by its absence from many concurrent languages,
limiting their expressive power. Implementation of a 2-phase commit
protocol to resolve such choice can result in large overheads, caused
by synchronisation offers having to be withdrawn. The recent Oracle
(single-phase) algorithm resolves COMS efficiently, for shared memory
concurrency at least. However, the Oracle only deals with
arbitrary choice and does not obviously extend to
prioritised choice (where we assume the priorities of the
participating processes are not in conflict). PICOMS is a proposed
efficient method for resolving COMS that honours non-conflicting
priorities, with only a modest increase in complexity over the Oracle