Welch, P.H. and Barnes, F.R.M. (2001) Mobile Data Types for Communicating Processes. In: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications 2001, Jun 25-28, 2001, Las Vegas, Nv.
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
Aliasing problems are a major source for error in traditional imperative languages (such as C) and modern object-oriented languages (such as Java, C++ and C#). Add in concurrency and the problems compound exponentially. Improperly synchronized access to shared (i.e. aliased) resources leads to problems of race hazard, deadlock, livelock and starvation. This paper describes the binding into occam (a concurrent processing language based on CSP) of a secure, dynamic and efficient way of sharing data between parallel processes with minimal synchronization overheads. The key new facilities provided are: a movement semantics for assignment and communication, strict zero-aliasing, apparently dynamic memory allocation and automatic zero-or-very-small-unit-time garbage collection. With occam becoming available on a variety of microprocessors for GUI building, internet services and small-memory-footprint embedded products, these capabilities are timely. Lessons are drawn for concurrency back in OO languages - and especially for the JCSP (''CSP for Java'') package library.
|Item Type:||Conference or workshop item (Paper)|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing|
|Depositing User:||Mark Wheadon|
|Date Deposited:||24 Nov 2008 17:59|
|Last Modified:||04 Jul 2009 17:23|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/13605 (The current URI for this page, for reference purposes)|
- Depositors only (login required):