Annual Conference: Communicating Process Architectures
Communicating Process Architectures 2018,
the 40th. WoTUG conference on concurrent and parallel systems, takes place from
Sunday August 19th. to Wednesday August 22nd. 2018 and is hosted by
Professor Dr. Rainer Spallek,
Chair of
VLSI Design, Diagnostics and Architecture
at the Faculty of Computer Science,
Technische Universität Dresden, Germany.
The conference is organised by Dr. Spallek in collboration with Oliver Knodel and Uwe Mielke
and in partnership with WoTUG.
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.
Diffusion limited aggregation: An example of real-time parallelisation
By D. R. Morse, A. M. Welch, Peter H. Welch
The simulation of the growth of Diffusion-Limited Aggregates (DLA) is representative of a class of 'shared' data-structure computations that does not yield to traditional parallelisation methods (such as 'farming', 'geometric decomposition' and 'data-flow'). The difficulty is that the shared data-structure is large and evolving, the required access to it from each processor is random and very high, and the computation per access is very low. These conditions also make these problems most unsuitable for shared-memory parallel computers.This paper presents a parallelisation technique that does give linear speed-up for this problem (at least, for up to 32 transputers). The cost-effectiveness of the solution compares favourably with those published that use vector-processing machines.The success of the parallelisation depends on real-time issues associated with keeping each worker transputer sufficiently up-to-date with all its colleagues. Some 'quasi-relativistic' effects need to be taken into account as well!The speed-ups achieved through this parallelisation are used to investigate the effect of various parameters (such as stride length and background drift) on the kind of DLA growth that is obtained. These studies would not be practical without the savings in time that have been realised from a parallel implementation of the DLA simulation.Finally, we characterise the features of those applications for which this parallelisation method is relevant.
Complete record...
|
