Concurrent and Distributed Computing in Java (Hardcover)
Vijay K. Garg
貴賓價: $2,059Killer Game Programming in Java (Paperback)
貴賓價: $969Distributed Computing: Fundamentals, Simulations, and Advanced Topics
貴賓價: $1,029Algorithmic Information Theory
貴賓價: $827Topological Structure and Analysis of Interconnection Networks
售價: $399Smart Environments : Technology, Protocols and Applications
貴賓價: $2,242Introduction to the Team Software Process (Hardcover)
貴賓價: $1,275Concurrent and Real-Time Programming in Java (Paperback)
貴賓價: $1,197Seven Concurrency Models in Seven Weeks: When Threads Unravel (Paperback)
貴賓價: $1,197Seven More Languages in Seven Weeks: Languages That Are Shaping the Future (Paperback)
貴賓價: $1,572Distributed Algorithms: An Intuitive Approach (Hardcover)
貴賓價: $1,140Computer Organization and Design: The Hardware/Software Interface, 3/e(IE) (美國版ISBN:1558606041)
貴賓價: $1,805Python Web Programming
Combining the two key types of Java programming, Concurrent and Distributed Computing in Java offers both professionals and students a comprehensive guide to fundamental concepts necessary for mastering Java programming.
The text is presented in two parts. The first deals with techniques for programming in shared-memory based systems and covers concepts in Java such as:
- Synchronized methods
- Waits and notify
- Multi-threaded programming
- Algorithms for mutual exclusion, consensus, atomic objects, and wait-free data structures
The second half of the text deals with programming in a message-passing system, and covers:
- Resource allocation problems
- Logical clocks
- Global property detection
- Leader election
- Message ordering
- Agreement algorithms
- Message logging
Avoiding excessive mathematical notation while explaining important concepts with both rigor and clarity, this up-to-date text will prove a valuable resource for interested professionals and students alike.
Table of Contents
List of Figures.
2. Mutual Exclusion Problem.
3. Synchronization Primitives.
4. Consistency Conditions.
5. Wait-Free Synchronization.
6. Distributed Programming.
7. Models and Clocks.
8. Resource Allocation.
9. Global Snapshot.
10. Global Properties.
11. Detecting Termination and Deadlocks.
12. Message Ordering.
13. Leader Election.
Appendix: Various Utility Classes.