Communicating Process Architectures
Communicating Process Architectures 2012, the
34th WoTUG conference on concurrent and parallel programming, will take place
at the
University of Abertay Dundee, in Dundee,
Scotland, from Sunday August 26th to Wednesday August 29th 2012.
For more information on CPA 2012, please see the
Call for Papers,
or the CPA 2012 pages.
About WoTUG
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:
-
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, ...);
and to stimulate discussion and ideas on the roles concurrency will play in the future:
-
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.
Of course, neither of the above sets of bullets are exclusive.
WoTUG publications
A database of papers and presentations from WoTUG conferences is here.
The Abstract below has been randomly selected from this database.
New ALT for Application Timers and Synchronisation Point Scheduling
By Øyvind Teig, Per Johan Vannebo
During the design of a small channel-based concurrency runtime system
(ChanSched, written in ANSI C), we saw that application timers (which
we call egg and repeat timers) could be part of its supported ALT
construct, even if their states live through several ALTs. There are
no side effects into the ALT semantics, which enable waiting for
channels, channel timeout and, now, the new application timers.
Application timers are no longer busy polled for timeout by the
process. We show how the classical occam language may benefit from a
spin-off of this same idea. Secondly, we wanted application
programmers to be freed from their earlier practice of explicitly
coding communication states at channel synchronisation points, which
was needed by a layered in-house scheduler. This led us to develop an
alternative to the non-ANSI C "computed goto" (found in gcc). Instead,
we use a switch/case with goto line-number-tags in a synch-point-table
for scheduling. We call this table, one for each process, a proctor
table. The programmer does not need to manage this table, which is
generated with a script, and hidden within an #include file.
Complete record...
|
