The JR Programming Language, 2004
Concurrent Programming in an Extended Java

The Springer International Series in Engineering and Computer Science Series, Vol. 774

Authors:

Language: English

Approximative price 52.74 €

In Print (Delivery period: 15 days).

Add to cartAdd to cart
The JR Programming Language
Publication date:
365 p. · 15.5x23.5 cm · Paperback

52.74 €

Subject to availability at the publisher.

Add to cartAdd to cart
The JR programming language : concurrent programming in an extended Java (Int. series in engineering & computer science, Vol. 774)
Publication date:
365 p. · 15.5x23.5 cm · Hardback
JR is a language for concurrent programming. It is an imperative language that provides explicit mechanisms for concurrency, communication, and s- chronization. JR is an extension of the Java programming language with - ditional concurrency mechanisms based on those in the SR (Synchronizing Resources) programming language. It is suitable for writing programs for both shared- and distributed-memory applications and machines; it is, of course, also suitable for writing sequential programs. JR can be used in applications such as parallel computation, distributed systems, simulation, and many others. JR supports many ?features? useful for concurrent programming. However, our goals have always been keeping the language simple and easy to learn and use. We have achieved these goals by integrating common notions, both sequ- tial and concurrent, into a few powerful mechanisms. We have implemented these mechanisms as part of a complete language to determine their feasibility and cost, to gain hands-on experience, and to provide a tool that can be used for research and teaching. The introduction to Chapter 1 expands on how JR has realized our design goals.
Extensions for Concurrency.- Overview of Extensions.- OP-Methods, Operations, and Capabilities.- Concurrent Execution.- Synchronization Using Shared Variables.- Semaphores.- Asynchronous Message Passing.- Remote Procedure Call.- Rendezvous.- Virtual Machines.- The Dining Philosophers.- Exceptions.- Inheritance of Operations.- Inter-Operation Invocation Selection Mechanism.- Applications.- Parallel Matrix Multiplication.- Solving PDEs: Grid Computations.- The Traveling Salesman Problem.- A Distributed File System.- Discrete Event Simulation.- Interfacing JR and GUIs.- Preprocessors for Other Concurrency Notations.