List of Figures

Chapter 1. First steps

Figure 1.1. Concurrency in the Erlang virtual machine

Figure 1.2. Server-side system

Chapter 2. Building blocks

Figure 2.1. Recursive structure of the list [1, 2, 3, 4]

Figure 2.2. Modifying a tuple creates a shallow copy of it.

Figure 2.3. Rebinding a tuple makes the old data garbage-collectible.

Figure 2.4. Modifying a list

Figure 2.5. Pushing a new element to the top of the list

Chapter 5. Concurrency primitives

Figure 5.1. BEAM as a single OS process, using a few threads to schedule a large number of processes

Figure 5.2. Inter-process communication via messages

Figure 5.3. Synchronous send and receive implemented on top of the asynchronous messages

Figure 5.4. m:n threading: a small number of schedulers running a large number of BEAM processes

Chapter 6. Generic server processes

Figure 6.1. Life cycle of a gen_server-powered process

Chapter 7. Building a concurrent system

Figure 7.1. Cooperation of processes

Figure 7.2. Process dependencies

Figure 7.3. Handling requests concurrently

Figure 7.4. Pooling database operations

Chapter 8. Fault-tolerance basics

Figure 8.1. Isolating errors in the to-do system

Figure 8.2. Example of links with multiple processes

Figure 8.3. Processes in the to-do system

Figure 8.4. Relationships between supervisor and worker processes

Figure 8.5. Linking all processes in the to-do system

Chapter 9. Isolating error effects

Figure 9.1. Process links in the to-do system

Figure 9.2. Separated supervision of the database and the cache