You're reading from Advanced Python Programming - Second Edition

Product type Book

Published in Mar 2022

Publisher Packt

ISBN-13 9781801814010

Pages 606 pages

Edition 2nd Edition

Languages

Concepts

Object Oriented Programming

Author (1):

Quan Nguyen

Table of Contents (32) Chapters

Preface

1. Section 1: Python-Native and Specialized Optimization

2. Chapter 1: Benchmarking and Profiling

3. Chapter 2: Pure Python Optimizations

4. Chapter 3: Fast Array Operations with NumPy, Pandas, and Xarray

5. Chapter 4: C Performance with Cython

6. Chapter 5: Exploring Compilers

7. Chapter 6: Automatic Differentiation and Accelerated Linear Algebra for Machine Learning

8. Section 2: Concurrency and Parallelism

9. Chapter 7: Implementing Concurrency

10. Chapter 8: Parallel Processing

11. Chapter 9: Concurrent Web Requests

12. Chapter 10: Concurrent Image Processing

13. Chapter 11: Building Communication Channels with asyncio

14. Chapter 12: Deadlocks

15. Chapter 13: Starvation

16. Chapter 14: Race Conditions

17. Chapter 15: The Global Interpreter Lock

18. Section 3: Design Patterns in Python

19. Chapter 16: The Factory Pattern

20. Chapter 17: The Builder Pattern

21. Chapter 18: Other Creational Patterns

22. Chapter 19: The Adapter Pattern

23. Chapter 20: The Decorator Pattern

24. Chapter 21: The Bridge Pattern

25. Chapter 22: The Façade Pattern

26. Chapter 23: Other Structural Patterns

27. Chapter 24: The Chain of Responsibility Pattern

28. Chapter 25: The Command Pattern

29. Chapter 26: The Observer Pattern

30. Assessments

31. Other Books You May Enjoy

The concept of deadlocks

In concurrent programming, a deadlock refers to a specific situation in which no progress can be made, and the program becomes locked in its current state. In most cases, this phenomenon is caused by a lack of, or mishandled, coordination between different lock objects (for thread synchronization purposes). In this section, we will discuss a thought experiment, commonly known as the dining philosophers problem, to illustrate the concept of a deadlock and its causes; from there, you will learn how to simulate the problem in a Python concurrent program.

The dining philosophers problem

The dining philosophers problem was first introduced by Edgar Dijkstra, a leading pioneer in concurrent programming, in 1965. This problem was first demonstrated using different technical terms (resource contention in computer systems) and was later rephrased by Tony Hoare, a British computer scientist and the inventor of the quicksort sorting algorithm. The problem statement...