High Performance Python, 3rd Edition

Chapter 7. Asynchronous I/O

A Note for Early Release Readers

With Early Release ebooks, you get books in their earliest form—the author’s raw and unedited content as they write—so you can take advantage of these technologies long before the official release of these titles.

This will be the 8th chapter of the final book. Please note that the GitHub repo will be made active later on.

If you have comments about how we might improve the content and/or examples in this book, or if you notice missing material within this chapter, please reach out to the editor at [e-mail].

Questions You’ll Be Able to Answer After This Chapter

• What is concurrency, and how is it helpful?

• What is the difference between concurrency and parallelism?

• Which tasks can be done concurrently, and which can’t?

• What are the various paradigms for concurrency?

• When is the right time to take advantage of concurrency?

• How can concurrency speed up my programs?

So far we have focused on speeding up code by increasing the number of compute cycles that a program can complete in a given time. However, in the days of big data, getting the relevant data to your code can be the bottleneck, as opposed to the actual code itself. When this is the case, your program is called I/O bound; in other words, the speed is bounded by the efficiency of the input/output.

I/O can be quite burdensome to the flow of a program. Every time your code reads from a file or writes to a network socket, it must pause to ...