CFP: Communicating Process Architectures 2003 in The Netherlands (deadline July 9)

CFP: Communicating Process Architectures 2003 in The Netherlands (deadline July 9)

Post by Gerald Hilderin » Fri, 06 Jun 2003 01:14:48



Communicating Process Architectures 2003

7th - 10th September 2003,University of Twente, Enschede, The Netherlands

http://www.ce.utwente.nl/cpa2003/

----------------------------------------------------------------------------

The paper submission deadline for the Communicating Architechtures 2003
Workshop has been postponed to 9 July.
Since several busy authors received some relaxation of the paper submission
deadline, I would like to give this little privilege to any prospective
author.

Further postponement, however, is not possible, in order not to frustrate
the reviewing and publishing process.
Still some slots for technical contributions are open, so again, we warmly
invite you to contribute to the Communicating Architechtures 2003 Workshop,
7-10 september 2003, University of Twente, Enschede, Netherlands:

http://www.ce.utwente.nl/cpa2003

A basic colour poster is available as pdf file (120 kB), for distribution on
local publication boards. We kindly ask you to print a few copies, and stick
them to some relevant publication boards.

An e-mail feedback to indicate that you plan to come and/or plan to submit a
paper is highly appreciated. We have reserverd only a limited amount of
rooms at the conference hotel, and the lecture hall is not that big.

On behalf of the local organisation committee

---------------------------------------------------------------------

COMMUNICATING PROCESS ARCHITECTURES addresses many of the key issues in
modern computer science and practice. In broad terms, the conference themes
will concern concurrency - at all levels of software and hardware
granularity. The goal of the conference is to stimulate discussion and ideas
as to the role concurrency will play in the future generation of scalable
computer infrastructure and applications - where scaling means the ability
to ramp up functionality (i.e. stay in control as complexity increases) as
well as physical metrics (such as performance).

Traditionally, CONCURRENCY has been taught and considered and experienced as
an advanced and difficult topic. The thesis underlying this conference is
that this tradition is wrong. The natural world operates through the
continuous interaction of massive numbers of autonomous agents at all levels
of granularity (astronomic, human, sub-atomic). If modern computer science
finds concurrency hard, then it is probably not doing it right! It is time
for concurrency to mature into a simple discipline that can be used everyday
to simplify the way in which we do computing, as well as enhance the
performance of what we build.

The WoTUG forum aims to continue the successful series of yearly
conferences, this one, the CPA 2003, being the fourth under the name of CPA,
and the 26th in the series of WoTUG conferences.

Specific themes include, but are not limited to:

- Theory - getting the underlying model right (CSP, pi-calculus, channels,
monitors, semaphores, BSP, barriers, buckets...);
- Concurrent design patterns and tools (built upon the above);
- Modelling concurrent software architectures (Real-time UML, dataflow
models, CSP)
- Safety and security issues (race-hazards, deadlock, livelock, process
starvation, ...);
- Language issues (Java(TM), CSP libraries for Java/C/C++, occam(TM),
Handel-C(TM), ...);
- System issues (lightweight multithreading kernels, lightweight external
communications, interrupts, ...)
- Processor issues (instruction sets for zero-cost multithreading, VLIW,
multiprocessor chips, software cache control, ...)
- Specialized hardware issues (link and router technologies, FPGAs, ...);
- Shared-memory -v- message-passing paradigms (unification?), SMP and
virtual SMP architectures;
- Supercomputing from commodity components (cluster computing, internet
grids, ...);
- Applications:
    - Scientific (including computation, graphics and GUIs),
    - Engineering (including embedded, real-time and control),
    - Mechatronic (including robots, machines and safety-critical),
    - Business (including mobile and e-commerce) and
    - Home (including entertainment);
    - Global architectural issues (vertical integration of all the above);
Etc.

 
 
 

1. CFP: Communicating Process Architectures 2003

Communicating Process Architectures 2003

7th - 10th September 2003,University of Twente, Enschede, The Netherlands

http://www.ce.utwente.nl/cpa2003/

----------------------------------------------------------------------------
------

COMMUNICATING PROCESS ARCHITECTURES addresses many of the key issues in
modern computer science and practice. In broad terms, the conference themes
will concern concurrency - at all levels of software and hardware
granularity. The goal of the conference is to stimulate discussion and ideas
as to the role concurrency will play in the future generation of scalable
computer infrastructure and applications - where scaling means the ability
to ramp up functionality (i.e. stay in control as complexity increases) as
well as physical metrics (such as performance).

Traditionally, CONCURRENCY has been taught and considered and experienced as
an advanced and difficult topic. The thesis underlying this conference is
that this tradition is wrong. The natural world operates through the
continuous interaction of massive numbers of autonomous agents at all levels
of granularity (astronomic, human, sub-atomic). If modern computer science
finds concurrency hard, then it is probably not doing it right! It is time
for concurrency to mature into a simple discipline that can be used everyday
to simplify the way in which we do computing, as well as enhance the
performance of what we build.

The WoTUG forum aims to continue the successful series of yearly
conferences, this one, the CPA 2003, being the fourth under the name of CPA,
and the 26th in the series of WoTUG conferences.

Specific themes include, but are not limited to:

- Theory - getting the underlying model right (CSP, pi-calculus, channels,
monitors, semaphores, BSP, barriers, buckets...);
- Concurrent design patterns and tools (built upon the above);
- Modelling concurrent software architectures (Real-time UML, dataflow
models, CSP)
- Safety and security issues (race-hazards, deadlock, livelock, process
starvation, ...);
- Language issues (Java(TM), CSP libraries for Java/C/C++, occam(TM),
Handel-C(TM), ...);
- System issues (lightweight multithreading kernels, lightweight external
communications, interrupts, ...)
- Processor issues (instruction sets for zero-cost multithreading, VLIW,
multiprocessor chips, software cache control, ...)
- Specialized hardware issues (link and router technologies, FPGAs, ...);
- Shared-memory -v- message-passing paradigms (unification?), SMP and
virtual SMP architectures;
- Supercomputing from commodity components (cluster computing, internet
grids, ...);
- Applications:
    - Scientific (including computation, graphics and GUIs),
    - Engineering (including embedded, real-time and control),
    - Mechatronic (including robots, machines and safety-critical),
    - Business (including mobile and e-commerce) and
    - Home (including entertainment);
    - Global architectural issues (vertical integration of all the above);
Etc.

2. Problem: Fragmented Memory

3. CFP: PACT 2003 - 1 Week Reminder (Deadline: April 4, 2003 - Abstracts)

4. NY-Lotus Notes Developers needed

5. LICS 2003 2nd CFP and deadline alteration

6. Windows 2000 IPHelper API DLL

7. Communicating Process Architectures - 2000 (WoTUG-23)

8. Web tools for IE6?

9. ARTIFICIAL INTELLIGENCE and COMMUNICATING PROCESS ARCHITECTURE

10. CFP: Tools for Program Development and Analysis in Computational Science (ICCS 2003) - EXTENDED DEADLINE

11. AMONET 2003 - Extended Deadline: Mar 31 2003

12. 10 DAY REMINDER: PACT 2003 Workshops [Deadline: June 16, 2003]

13. PACT 2003 [Early Registration Deadline Sept. 12, 2003, New Orleans 9/03]