Skip to main content
Kent Academic Repository

Process Oriented Design for Java: Concurrency for All

Welch, Peter H. (2002) Process Oriented Design for Java: Concurrency for All. In: Sloot, Peter M. A. and Tan, C.J Kenneth and Dongarra, Jack J. and Hoekstra, Alfons G., eds. Computational Science — ICCS 2002 International Conference. Lecture Notes in Computer Science, 2 . Springer, Berlin, Germany, p. 687. ISBN 978-3-540-43593-8. E-ISBN 978-3-540-46080-0. (doi:10.1007/3-540-46080-2_72) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:13795)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided.
Official URL:
http://dx.doi.org/10.1007/3-540-46080-2_72

Abstract

Concurrency is thought to be an advanced topic - much harder than serial computing which, therefore, needs to be mastered first. This paper contends that this tradition is wrong, which has radical implications for the way we educate people in Computer Science - and on how we apply what we have learnt. A process-oriented design pattern for concurrency is presented with a specific binding for Java. It is based on the algebra of .Communicating Sequential Processes. (CSP) as captured by the JCSP library of Java classes. No mathematical sophistication is needed to master it. The user gets the benefit of the sophistication underlying CSP simply by using it. Those benefits include the simplification wins we always thought concurrency should generate. Although the Java binding is new, fifteen years of working with students at Kent have shown that the ideas within process-oriented design can be quickly absorbed and applied. Getting the ideas across as soon as possible pays dividends - the later it's left, the more difficult it becomes to wean people off serial ways of thought that often fit applications so badly. Concurrency for all (and for everyday use) in the design and implementation of most kinds of computer system is both achievable and necessary

Item Type: Book section
DOI/Identification number: 10.1007/3-540-46080-2_72
Additional information: Keynote Tutorial
Uncontrolled keywords: Concurrency, Scaleability, Java, JCSP, CSP
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 18:00 UTC
Last Modified: 05 Nov 2024 09:47 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/13795 (The current URI for this page, for reference purposes)

University of Kent Author Information

Welch, Peter H..

Creator's ORCID:
CReDIT Contributor Roles:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.