book

Java Threads, 3rd Edition

by Scott Oaks, Henry Wong

September 2004

Intermediate to advanced

362 pages

11h 24m

English

O'Reilly Media, Inc.

Read now

Unlock full access

Java Threads, 3rd Edition
A Note Regarding Supplemental Files
Preface
Who Should Read This Book?Versions Used in This BookWhat’s New in This Edition?Organization of This BookConventions Used in This BookCode ExamplesHow to Contact UsSafari EnabledAcknowledgments
1. Introduction to Threads
1.1. Java Terms1.1.1. Java Versions, Tools, and Code1.2. About the Examples1.2.1. Compiling and Running the Examples1.3. Why Threads?1.3.1. Nonblocking I/O1.3.2. Alarms and Timers1.3.3. Independent Tasks1.3.4. Parallelizable Algorithms1.4. Summary
2. Thread Creation and Management
2.1. What Is a Thread?2.2. Creating a Thread2.2.1. The Example Architecture2.2.2. The Thread Class2.3. The Lifecycle of a Thread2.3.1. Creating a Thread2.3.2. Starting a Thread2.3.3. Terminating a Thread2.3.4. Pausing, Suspending, and Resuming Threads2.3.5. Thread Cleanup2.4. Two Approaches to Stopping a Thread2.4.1. Setting a Flag2.4.2. Interrupting a Thread2.5. The Runnable Interface2.6. Threads and Objects2.6.1. Determining the Current Thread2.7. Summary2.7.1. Example Classes
3. Data Synchronization
3.1. The Synchronized Keyword3.2. The Volatile Keyword3.3. More on Race Conditions3.4. Explicit Locking3.5. Lock Scope3.5.1. Synchronized Blocks3.6. Choosing a Locking Mechanism3.6.1. The Lock Interface3.7. Nested Locks3.8. Deadlock3.9. Lock Fairness3.10. Summary3.10.1. Example Classes
4. Thread Notification
4.1. Wait and Notify4.1.1. The Wait-and-Notify Mechanism and Synchronization4.1.2. wait( ), notify( ), and notifyAll( )4.1.3. Wait-and-Notify Mechanism with Synchronized Blocks4.2. Condition Variables4.3. Summary4.3.1. Example Classes
5. Minimal Synchronization Techniques
5.1. Can You Avoid Synchronization?5.1.1. The Effect of Registers5.1.2. The Effect of Reordering Statements5.1.3. Double-Checked Locking5.2. Atomic Variables5.2.1. Overview of the Atomic Classes5.2.2. Using the Atomic Classes5.2.2.1. Variable substitution5.2.2.2. Changing algorithms5.2.2.3. Retrying operations5.2.3. Notifications and Atomic Variables5.2.4. Summary of Atomic Variable Usage5.2.4.1. Data exchange5.2.4.2. Compare and set5.2.4.3. Advanced atomic data types5.2.4.4. Bulk data modification5.3. Thread Local Variables5.3.1. Inheritable Thread Local Variables5.4. Summary5.4.1. Example Classes
6. Advanced Synchronization Topics
6.1. Synchronization Terms6.2. Synchronization Classes Added in J2SE 5.06.2.1. Semaphore6.2.2. Barrier6.2.3. Countdown Latch6.2.4. Exchanger6.2.5. Reader/Writer Locks6.3. Preventing Deadlock6.3.1. Deadlock and Automatic Lock Releases6.3.2. Preventing Deadlock with Timeouts6.4. Deadlock Detection6.5. Lock Starvation6.5.1. Lock Starvation and Reader/Writer Locks6.6. Summary6.6.1. Example Classes
7. Threads and Swing
7.1. Swing Threading Restrictions7.2. Processing on the Event-Dispatching Thread7.3. Using invokeLater( ) and invokeAndWait( )7.4. Long-Running Event Callbacks7.5. Summary7.5.1. Example Classes

8. Threads and Collection Classes
8.1. Overview of Collection Classes8.1.1. Collection Interfaces8.1.2. Threadsafe Collection Classes8.1.3. Thread-Unsafe Collection Classes8.1.4. Thread-Notification Collection Classes8.2. Synchronization and Collection Classes8.2.1. Simple Synchronization8.2.2. Complex Synchronization8.2.3. Iterators and Enumerations8.2.4. Thread-Aware Classes8.3. The Producer/Consumer Pattern8.4. Using the Collection Classes8.5. Summary8.5.1. Example Classes
9. Thread Scheduling
9.1. An Overview of Thread Scheduling9.1.1. Priority-Based Scheduling9.1.2. The Scheduling Process9.1.3. Priority Exceptions9.1.3.1. Priority inversion9.1.3.2. Complex priorities9.2. Scheduling with Thread Priorities9.2.1. Other Thread-Scheduling Methods9.3. Popular Threading Implementations9.3.1. Green Threads9.3.2. Windows Native Threads9.3.3. Solaris Native Threads9.3.4. Linux Native Threads9.4. Summary9.4.1. Example Classes
10. Thread Pools
10.1. Why Thread Pools?10.1.1. Thread Pools and Throughput10.1.2. Why Not Thread Pools?10.2. Executors10.3. Using a Thread Pool10.4. Queues and Sizes10.4.1. Rejected Tasks10.5. Thread Creation10.6. Callable Tasks and Future Results10.6.1. The FutureTask Class10.7. Single-Threaded Access10.8. Summary10.8.1. Example Classes
11. Task Scheduling
11.1. Overview of Task Scheduling11.2. The java.util.Timer Class11.2.1. Using the Timer11.3. The javax.swing.Timer Class11.3.1. Using the javax.swing.Timer Class11.4. The ScheduledThreadPoolExecutor Class11.4.1. Using the ScheduledThreadPoolExecutor Class11.4.2. Using the Future Interface11.5. Summary11.5.1. Example Classes
12. Threads and I/O
12.1. A Traditional I/O Server12.1.1. An Example Multithreaded Server12.1.1.1. Using the multithreaded server12.1.2. Scaling Using Traditional I/O12.2. A New I/O Server12.2.1. Nonblocking I/O12.2.2. A Single-Threaded NIO Server12.2.3. A Multithreaded New I/O Server12.3. Interrupted I/O12.4. Summary12.4.1. Example Classes
13. Miscellaneous Thread Topics
13.1. Thread Groups13.2. Threads and Java Security13.3. Daemon Threads13.4. Threads and Class Loading13.5. Threads and Exception Handling13.5.1. The ThreadDeath Class13.6. Threads, Stacks, and Memory Usage13.6.1. Stack Overflow Errors13.6.2. Out of Memory Errors13.6.3. Specifying Stack Sizes13.6.4. Stack APIs13.7. Summary13.7.1. Example Classes
14. Thread Performance
14.1. Overview of Performance14.1.1. Measuring Java Performance14.2. Synchronized Collections14.3. Atomic Variables and Contended Synchronization14.3.1. The ConcurrentHashMap Class14.4. Thread Creation and Thread Pools14.5. Summary14.5.1. Example Classes
15. Parallelizing Loops for Multiprocessor Machines
15.1. Parallelizing a Single-Threaded Program15.1.1. Loop Scheduling and Load Balancing15.1.1.1. Static or chunk scheduling15.1.1.2. Self-scheduling15.1.1.3. Guided self-scheduling15.1.1.4. User-defined scheduling15.1.2. Variable Classifications15.1.2.1. Loop-private variables15.1.2.2. Read-only variables15.1.2.3. Storeback variables15.1.2.4. Reduction variables15.1.2.5. Shared variables15.1.3. Loop Analysis and Transformations15.1.3.1. Loop distribution15.1.3.2. Loop isolation15.1.3.3. Loop interchange15.1.3.4. Loop reimplementation15.1.4. Inner-Loop Threading15.1.5. Loop Printing15.2. Multiprocessor Scaling15.2.1. A Simple Loop Test15.2.2. A Reduction Variable Test15.2.3. A Small Inner-Loop Test15.2.4. A Printing Test15.3. Summary15.3.1. Example Classes
A. Superseded Threading Utilities
A.1. The BusyFlag ClassA.2. The CondVar ClassA.3. The Barrier ClassA.4. The RWLock ClassA.5. The ThreadPool ClassA.6. The JobScheduler ClassA.6.1. The DaemonLock ClassA.7. Summary
Index
About the Authors
Colophon
Copyright

Content preview from Java Threads, 3rd Edition

Chapter 9. Thread Scheduling

The term “thread scheduling” covers a variety of topics. This chapter examines one of those topics, which is how a computer selects particular threads to run. The information in this chapter provides a basic understanding of when threads run and how computers handle multiple threads. There’s little programming in this chapter, but the information we present is an important foundation for other topics of thread scheduling. In particular, the next few chapters discuss task scheduling and thread pools, which are the programmatic techniques you use to manage large numbers of threads and jobs.

The key to understanding Java thread scheduling is to realize that a CPU is a scarce resource. When two or more threads want to run on a single-processor machine, they end up competing for the CPU, and it’s up to someone—either the programmer, the Java virtual machine, or the operating system—to make sure that the CPU is shared among these threads. The same is true whenever a program has more threads than the machine hosting the program has CPUs. The essence of this chapter is to understand how CPUs are shared among threads that want to access them.

In earlier examples, we didn’t concern ourselves with this topic because, in those cases, the details of thread scheduling weren’t important to us. This was because the threads we were concerned with didn’t normally compete for a CPU: they had specific tasks to do, but the threads themselves were usually short-lived or only ...

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.

Head of Cybersecurity

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.

Field Engineer

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.

Data Platform Tech Lead

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.

Mark W.

Embedded Software Engineer

Publisher Resources

ISBN: 0596007825Errata Page

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills

Java Threads, 3rd Edition

by Scott Oaks, Henry Wong

Chapter 9. Thread Scheduling

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.