- Shopping Bag ( 0 items )
Threads aren't a new idea: many operating systems and languages support them. But despite widespread support, threads tend to be something that everyone talks about, but few use. Programming with threads has a reputation for being tricky and nonportable.Not so with Java. Java's thread facilities are easy to use, and—like everything else in Java—are completely portable between platforms. And that's a good thing, because it's impossible to write anything but the simplest applet without encountering threads. If you ...
Ships from: Durham, NH
Usually ships in 1-2 business days
Ships from: Wilmington, NC
Usually ships in 1-2 business days
Ships from: Pasadena, CA
Usually ships in 1-2 business days
Threads aren't a new idea: many operating systems and languages support them. But despite widespread support, threads tend to be something that everyone talks about, but few use. Programming with threads has a reputation for being tricky and nonportable.Not so with Java. Java's thread facilities are easy to use, and—like everything else in Java—are completely portable between platforms. And that's a good thing, because it's impossible to write anything but the simplest applet without encountering threads. If you want to work with Java, you have to learn about threads.This new edition shows you how to take full advantage of Java's thread facilities: where to use threads to increase efficiency, how to use them effectively, and how to avoid common mistakes.Java Threads discusses problems like deadlock, race condition, and starvation in detail, helping you to write code without hidden bugs. It brings you up to date with the latest changes in the thread interface for JDK 1.2.The book offers a thorough discussion of the Thread and ThreadGroup classes, the Runnable interface, the language's synchronized operator. It explains thread scheduling ends by developing a CPUSchedule class, showing you how to implement your own scheduling policy. In addition, Java Threads shows you how to extend Java's thread primitives. Other extended examples include classes that implement reader/writer locks, general locks, locks at arbitrary scope, and asynchronous I/O. This edition also adds extensive examples on thread pools, advanced synchronization technique, like condition variables, barriers, and daemon locks. It shows how to work with classes that are not thread safe, and pays special attention to threading issues with Swing. A new chapter shows you how to write parallel code for multiprocessor machines.In short, Java Threads covers everything you need to know about threads, from the simplest animation applet to the most complex applications. If you plan to do any serious work in Java, you will find this book invaluable. Examples available online. Covers Java 2.
Historically, threading was first exploited to make certain programs easier to write: if a program can be split into separate tasks, it's often easier to program the algorithm as separate tasks or threads. Programs that fall into this category are typically specialized and deal with multiple independent tasks. The relative rareness of these types of programs makes threading in this category a specialized skill. Often, these programs were written as separate processes using operating-system-dependent communication tools such as signals and shared memory spaces to communicate between processes. This approach increased system complexity.
The popularity of threading increased when graphical inter-faces became the standard for desktop computers because the threading system allowed the user to perceive better program performance. The introduction of threads into these platforms didn't make the programs any faster, but it did create an illusion of faster performance for the user, who now had a dedicated thread to service input or display output.
Recently, there's been a flurry of activity regarding a new use of threaded programs: to exploit the growing number of computers that have multiple processors. Programs that require a lot of CPU processing are natural candidates for this category, since a calculation that requires one hour on a single-processor machine could (at least theoretically) run in half an hour on a two-processor machine, or 15 minutes on a four-processor machine. All that is required is that the program be written to use multiple threads to perform the calculation.
While computers with multiple processors have been around for a long time, we're now seeing these machines become cheap enough to be very widely available. The advent of less expensive machines with multiple processors, and of operating systems that provide programmers with thread libraries to exploit those processors, has made threaded programming a hot topic, as developers move to extract every benefit from these new machines. Until Java, much of the interest in threading centered around using threads to take advantage of multiple processors on a single machine.
However, threading in Java often has nothing at all to do with multiprocessor machines and their capabilities; in fact, the first Java virtual machines were unable to take advantage of multiple processors on a machine, and many implementations of the virtual machine still follow that model. However, there are also implementations of the virtual machine that do take advantage of the multiple processors that the computer may have. A correctly written program running in one of those virtual machines on a computer with two processors may indeed take roughly half the time to execute that it would take on a computer with a single processor. If you're looking to use Java to have your program scale to many processors, that is indeed possible when you use the correct virtual machine. However, even if your Java program is destined to be run on a machine with a single CPU, threading is still very important.
The major reason threading is so important in Java is that Java has no concept of asynchronous behavior. This means that many of the programming techniques you've become accustomed to using in typical programs are not applicable in Java; instead, you must learn a new repertoire of threading techniques to handle these cases of asynchronous behavior.
This is not to say there aren't other times when threads are a handy programming technique in Java; certainly it's easy to use Java for a program that implements an algorithm that naturally lends itself to threading. And many Java programs implement multiple independent behaviors. The next few sections cover some of the circumstances in which Java threads are a required component of the program, due to the need for asynchronous behavior or to the elegance that threading lends to the problem.
This type of behavior is often undesirable. If you're reading data from a network socket, that data is often not available when you want to read it: the data may have been delayed in transit over the network, or you may be reading from a network server that sends data only periodically. If the program blocks when it tries to read from the socket, then it's unable to do anything else until the data is actually available. If the program has a user interface that contains a button and the user presses the button while the program is executing the read () method, nothing will happen: the program will be unable to process the mouse events and execute the event-processing method associated with the button. This can be very frustrating for the user, who thinks the program has hung.
Traditionally, there are three techniques to cope with this situation:
Developers often take all input sources and use a system call like select () to notify them when data is available from a particular source. This allows input to be handled much like an event from the user (in fact, many graphical tool kits use this method transparently to the user, who simply registers a callback function that is called whenever data is available from a particular source).
Polling allows a developer to test if data is available from a particular source. If data is available, the data can be read and processed; if it is not, the program can perform another task. Polling can be done either explicitly--with a system call like poll ()--or, in some systems, by making the read () function return an indication that no data is immediately available.
A file descriptor representing an input source can often be set so that an asynchronous signal is delivered to the program when data is available on that input source. This signal interrupts the program, which processes the data and then returns to whatever task it had been doing.
In Java, none of these techniques is directly available. There is limited support for polling via the available () method of the FilterInputStream class, but this method does not have the rich semantics that polling typically has in most operating systems. To compensate for the lack of these features, a Java developer must set up a separate thread to read the data. This separate thread can block when data isn't available, and the other thread (s) in the Java program can process events from the user or perform other tasks.
While this issue of blocking I/O can conceivably occur with any data source, it occurs most frequently with network sockets. If you're used to programming sockets, you've probably used one of these techniques to read from a socket, but perhaps not to write to one. Many developers, used to programming on a local area network, are vaguely aware that writing to a socket may block, but it's a possibility that many of them ignore because it can only happen under certain circumstances, such as a backlog in getting data onto the network. This backlog rarely happens on a fast local area network, but if you're using Java to program sockets over the Internet, the chances of this backlog happening are greatly increased; hence the chance of blocking while attempting to write data onto the network is also increased. So in Java, you may need two threads to handle the socket: one to read from the socket and one to write to it...
Who Should Read This Book?;
Versions Used in This Book;
Organization of This Book;
Conventions Used in This Book;
Feedback for Authors;
Chapter 1: Introduction to Threading;
1.1 Java Terms;
1.2 Thread Overview;
1.3 Why Threads?;
Chapter 2: The Java ThreadingAPI;
2.1 Threading Using the Thread Class;
2.2 Threading Using the Runnable Interface;
2.3 The Life Cycle of a Thread;
2.4 Thread Naming;
2.5 Thread Access;
2.6 More on Starting, Stopping, and Joining;
Chapter 3: Synchronization Techniques;
3.1 A Banking Example;
3.2 Reading Data Asynchronously;
3.3 A Class to Perform Synchronization;
3.4 The Synchronized Block;
3.5 Nested Locks;
3.7 Return to the Banking Example;
3.8 Synchronizing Static Methods;
Chapter 4: Wait and Notify;
4.1 Back to Work (at the Bank);
4.2 Wait and Notify;
4.3 wait(), notify(), and notifyAll();
4.4 wait() and sleep();
4.5 Thread Interruption;
4.6 Static Methods (Synchronization Details);
Chapter 5: Useful Examplesof Java Thread Programming;
5.1 Data Structures and Containers;
5.2 Simple Synchronization Examples;
5.3 A Network Server Class;
5.4 The AsyncInputStream Class;
5.5 Using TCPServer with AsyncInputStreams;
Chapter 6: Java Thread Scheduling;
6.1 An Overview of Thread Scheduling;
6.2 When Scheduling Is Important;
6.3 Scheduling with Thread Priorities;
6.4 Popular Scheduling Implementations;
6.5 Native Scheduling Support;
6.6 Other Thread-Scheduling Methods;
Chapter 7: Java Thread Scheduling Examples;
7.1 Thread Pools;
7.2 Round-Robin Scheduling;
7.3 Job Scheduling;
Chapter 8: Advanced Synchronization Topics;
8.1 Synchronization Terms;
8.2 Preventing Deadlock;
8.3 Lock Starvation;
8.4 Thread-Unsafe Classes;
Chapter 9: Parallelizing for Multiprocessor Machines;
9.1 Parallelizing a Single-Threaded Program;
9.2 Inner-Loop Threading;
9.3 Loop Printing;
9.4 Multiprocessor Scaling;
Chapter 10: Thread Groups;
10.1 Thread Group Concepts;
10.2 Creating Thread Groups;
10.3 Thread Group Methods;
10.4 Manipulating Thread Groups;
10.5 Thread Groups, Threads, and Security;
Thread Stack Information;
General Thread Information;
Default Exception Handler;
The ThreadDeath Class;
The Volatile Keyword;
Exceptions and Errors;