Normal view MARC view ISBD view

Concurrent and distributed computing in Java / Vijay K. Garg.

By: Garg, Vijay K. (Vijay Kumar), 1963-.
Contributor(s): John Wiley & Sons [publisher.] | IEEE Xplore (Online service) [distributor.].
Material type: materialTypeLabelBookPublisher: [Piscataway, New Jersey?] : IEEE Press, c2004Distributor: [Piscataqay, New Jersey] : IEEE Xplore, [2005]Description: 1 PDF (xx, 309 pages) : illustrations.Content type: text Media type: electronic Carrier type: online resourceISBN: 9780471721277.Subject(s): Parallel processing (Electronic computers) | Electronic data processing -- Distributed processing | Java (Computer program language) | Algorithm design and analysis | Arrays | Bibliographies | Biological system modeling | Birds | Books | Cameras | Checkpointing | Clocks | Color | Communication networks | Communication systems | Complexity theory | Computational modeling | Computer crashes | Computer networks | Concurrency control | Concurrent computing | Data structures | Delay | Distributed algorithms | Distributed databases | Fault tolerance | Fault tolerant systems | Floods | Green products | Hardware | Hip | History | IP networks | Image color analysis | Image edge detection | Indexes | Instruction sets | Internet | Java | Law | Lead | Message systems | Monitoring | Nominations and elections | Optimization | Out of order | Programming | Protocols | Real time systems | Receivers | Registers | Resource management | Schedules | Sections | Semantics | Servers | Silicon | Sleep | Sockets | Synchronization | System recovery | Testing | Topology | Upper boundGenre/Form: Electronic books.Additional physical formats: Print version:: No titleDDC classification: 005.2/75 Online resources: Abstract with links to resource Also available in print.
Contents:
Mutual exclusion problem -- Synchronization primitives -- Consistency conditions -- Wait-free synchronization -- Distributed programming -- Models and clocks -- Resource allocation -- Global snapshot -- Global properties -- Detecting termination and deadlocks -- Message ordering -- Leader election -- Synchronizers -- Agreement -- Transactions -- Recovery -- Self-stabilization.
Summary: Concurrent and Distributed Computing in Java addresses fundamental concepts in concurrent computing with Java examples. The book consists of two parts. The first part deals with techniques for programming in shared-memory based systems. The book covers concepts in Java such as threads, synchronized methods, waits, and notify to expose students to basic concepts for multi-threaded programming. It also includes algorithms for mutual exclusion, consensus, atomic objects, and wait-free data structures. The second part of the book deals with programming in a message-passing system. This part covers resource allocation problems, logical clocks, global property detection, leader election, message ordering, agreement algorithms, checkpointing, and message logging. Primarily a textbook for upper-level undergraduates and graduate students, this thorough treatment will also be of interest to professional programmers.
    average rating: 0.0 (0 votes)
No physical items for this record

Includes bibliographical references (p. 297-304) and index.

Mutual exclusion problem -- Synchronization primitives -- Consistency conditions -- Wait-free synchronization -- Distributed programming -- Models and clocks -- Resource allocation -- Global snapshot -- Global properties -- Detecting termination and deadlocks -- Message ordering -- Leader election -- Synchronizers -- Agreement -- Transactions -- Recovery -- Self-stabilization.

Restricted to subscribers or individual electronic text purchasers.

Concurrent and Distributed Computing in Java addresses fundamental concepts in concurrent computing with Java examples. The book consists of two parts. The first part deals with techniques for programming in shared-memory based systems. The book covers concepts in Java such as threads, synchronized methods, waits, and notify to expose students to basic concepts for multi-threaded programming. It also includes algorithms for mutual exclusion, consensus, atomic objects, and wait-free data structures. The second part of the book deals with programming in a message-passing system. This part covers resource allocation problems, logical clocks, global property detection, leader election, message ordering, agreement algorithms, checkpointing, and message logging. Primarily a textbook for upper-level undergraduates and graduate students, this thorough treatment will also be of interest to professional programmers.

Also available in print.

Mode of access: World Wide Web

Description based on PDF viewed 12/21/2015.

There are no comments for this item.

Log in to your account to post a comment.