February 2004
Intermediate to advanced
336 pages
7h 18m
English
Content preview from Concurrent and Distributed Computing in JavaBecome an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
List of Figures
1.3 A process with four threads
2.1 Interface for accessing the critical section
2.2 A program to test mutual exclusion
2.3 An attempt that violates mutual exclusion
2.4 An attempt that can deadlock
2.5 An attempt with strict alternation
2.6 Peterson’s algorithm for mutual exclusion
2.7 Lamport’s bakery algorithm
2.8 TestAndSet hardware instruction
2.9 Mutual exclusion using TestAndSet
2.10 Semantics of swap operation
3.3 A shared buffer implemented with a circular array
3.4 Bounded buffer using semaphores
3.5 Producer-consumer algorithm using semaphores
3.6 Reader-writer algorithm using semaphores
3.7 The dining philosopher problem
3.10 Dining philosopher using semaphores
3.11 A pictorial view of a Java monitor
3.13 Dining philosopher using monitors
4.1 Concurrent histories illustrating sequential consistency
4.2 Sequential consistency does not satisfy locality
4.3 Summary of consistency conditions
5.1 Safe and unsafe read-write registers
5.2 Concurrent histories illustrating regularity
5.3 Atomic and nonatomic registers
5.4 Construction of a regular boolean register
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.