Communicating Process Architectures
Communicating Process Architectures 2014,
the 36th. WoTUG conference on concurrent and parallel systems, takes place from
Sunday August 24th to Wednesday August 27th 2014 and is hosted by the
Department of Computer Science, University of Oxford.
Accommodation and evening Fringe sessions will be at
St. Anne's College,
a few minutes walk from the Department.
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.
Application of occam to biological sequence comparisons
One of the major uses of computers by molecular biologists is the alignment of protein or DNA sequences. Since the structure and function of proteins and DNA cannot be predicted directly from sequence data alone, the most useful procedure is to compare unknown sequences against a database of known sequences. Those with a high degree of homology are likely to have similar properties. At present, the databases are growing exponentially with doubling in around 20 months. Consequently, comparisons are taking proportionately longer to complete. We have applied various sequential comparative algorithms within a farming harness constructed in occam from a pipeline of transputers. The design of the farming harness for optimum link communication is discussed. The advantage our method offers is scalability; an important consideration as the databases multiply in content. The ability to tailor the algorithm to work on various size networks of transputers also allows the user to weigh time considerations against the total cost of the system. Our present implementation can perform around 600 comparisons per second between a query sequence of 50 residues and a database using 64 worker processors.