Download Concurrent Programming in ML by John H. Reppy PDF

By John H. Reppy

ISBN-10: 0511574967

ISBN-13: 9780511574962

ISBN-10: 0521480892

ISBN-13: 9780521480895

ISBN-10: 0521714729

ISBN-13: 9780521714723

Concurrent Programming ML (CML), integrated as a part of the SML of latest Jersey (SML/NJ) distribution, combines the simplest positive aspects of concurrent programming and sensible programming. This sensible, "how-to" booklet makes a speciality of using concurrency to enforce evidently concurrent purposes. as well as an academic advent to programming in CML, the publication offers 3 prolonged examples utilizing CML for functional platforms programming: a parallel software program construct method, an easy concurrent window supervisor, and an implementation of disbursed tuple areas. This e-book additionally illustrates complicated SML programming concepts, and contains a bankruptcy at the implementation of concurrency utilizing beneficial properties supplied by way of the SML/NJ process. it is going to be of curiosity to programmers, scholars, researchers operating in laptop language improvement.

Show description

Read or Download Concurrent Programming in ML PDF

Similar software design & engineering books

Apple Training Series: Mac OS X Support Essentials (2nd Edition)

Bought for sophistication i'm taking. this article is a part of examination prep for Apple qualified aid examination. excellent source.

The Knowledge Medium: Designing Effective Computer-Based Learning Environments

This well timed new booklet examines the proposal of machine as medium and what such an concept may perhaps suggest for schooling. the information Medium: Designing powerful Computer-Based academic studying Environments means that the knowledge of pcs as a medium could be a key to re-envisioning academic expertise.

Component-Based Software Quality: Methods and Techniques

Component-based software program improvement, CBSD, is not any longer only one extra new paradigm in software program engineering, yet is successfully utilized in improvement and perform. up to now, despite the fact that, lots of the efforts from the software program engineering group have focused on the useful features of CBSD, leaving apart the therapy of the standard matters and extra-functional houses of software program parts and component-based platforms.

Architecting the Telecommunication Evolution: Toward Converged Network Services

Service-oriented structure (SOA) makes use of companies because the baseline for constructing new architectures and purposes, as networks are outfitted in particular to fulfill carrier requisites. such a lot companies are at the moment dealt with over diversified networks, yet more recent prone will quickly require cross-network aid.

Extra info for Concurrent Programming in ML

Sample text

There are a number of different names for this mechanism. Because it involves blocking both the sender and receiver, it is sometimes called rendezvous (or extended rendezvous). Others describe the communications as transactions. In this book, we use the term Remote Procedure Call (RPC), because the request/reply protocol is similar to the procedure call/return linkage. This analogy can be made stronger; the server process is actually playing the rˆole of a monitor, with the entries corresponding to the monitor’s procedures.

It is good practice to avoid situations where two or more threads share access to a reference or array. Usually, this is not a significant restriction. Shared-state is most likely to be an issue when incorporating existing sequential 1 The term “communicating sequential processes” is often used to describe this style of programming. 40 3 An Introduction to Concurrent ML code into a CML application, but even this situation is usually not a problem, since the preferred ML programming style is mostly functional.

To simplify the presentation, we use a buffer size of one. 1 Semaphores One of the most basic synchronization mechanisms is the semaphore, which is a special integer variable with two operations: P and V. Given a semaphore s, the execution of P(s) by a process p forces it to delay until s > 0, at which point p executes s := s − 1 and proceeds; the test and update of s are performed together as an atomic operation. Execution of V(s) results in the atomic execution of s := s + 1. A semaphore s can be used to implement mutual exclusion for a critical region by initializing s to 1, and by bracketing the critical region with P(s) .

Download PDF sample

Concurrent Programming in ML by John H. Reppy

by George

Rated 4.97 of 5 – based on 23 votes