Home > Store

Programming with Threads

Register your product to gain access to bonus material or receive a coupon.

Programming with Threads

Book

  • Sorry, this book is no longer in print.
Not for Sale

About

Features

  • Introduces the basic thread interfaces, how to create threads, thread synchronization, thread -specific data, and how threads interact with the basic UNIX process model.
  • Introduces specialized thread interfaces for unusual or performance-critical situations.
  • Provides techniques for constructing correct multithreaded programs and libraries.
  • Includes the UNIX International Threads interfaces and shows differences between UI and POSIX interfaces.
  • Covers:
    • converting an existing single-thread application into a multithreaded application
    • designing a multithreaded application
    • implementing a multithreaded application
    • maintaining a multithreaded application on the SunOSTM 5.x operating system platform.

Description

  • Copyright 1996
  • Dimensions: 7 x 9-1/4
  • Pages: 576
  • Edition: 1st
  • Book
  • ISBN-10: 0-13-172389-8
  • ISBN-13: 978-0-13-172389-4

Written by the principal architect of Sunsoft's threads implementation, this practical guide to developing multithreaded programs on UNIX, concentrates on when and how to apply threads, what problems to expect, and how to deal with them. KEY TOPICS: Covers advanced interfaces appropriate to performance-critical situations. Explores the use of threads and the construction of correct MT programs and libraries. Includes a variety of multithreading examples. MARKET: For programmers interested in developing multithreaded programs on UNIX.

Sample Content

Table of Contents

(NOTE: Each chapter concludes with a Summary.)
1. Introduction to Threads.
What Are Threads? The Benefits of Threads. Throughput Multiple Processors. User Interface Responsiveness. Server Responsiveness. Server Deadlock Avoidance. Program Structure. Communication. A Warning. Controlling Concurrency. Concurrent Programming.

2. Getting Started.
A Simple Example Using Threads. Threads Interfaces. Creating Threads. Using the Thread Start Routine Argument. Destroying Threads. Waiting for Threads to Exit. Getting the Current Thread-id. Comparing Thread-ids. Thread Attributes. Detached Threads.

3. Synchronization.
The Synchronization Problem. Synchronization Variables. Mutual Exclusion. Initializing and Destroying Mutexes. Locking and Unlocking Mutexes. Data Races. The POSIX Memory Model. Condition Variables. Initializing and Destroying Condition Variables. Waiting for and Signalling Conditions. Using Condition Variables. Using pthread_cond_broadcast(). Dynamic Package Initialization.

4. Using Libraries in Multithreaded Programs.
System Calls. errno. Thread-Safe Functions. Serializability. Restrictions on Concurrency. POSIX Thread-Safe Functions. Memory Allocation. stdio. C++ iostream Library. Explicitly Locked Functions. Thread-Unsafe Functions. Other Thread-Safety Variations. Package-Unsafe Functions. Object-Unsafe Functions.

5. Threads and Process Resources.
Process Resources. Unshared Resources. Positioned I/O. Arguments and Environment Variables. Timers and Waiting. Signals. Process Creation and Destruction. Using fork(). Waiting for Processes to Exit.

6. Synchronization Strategies.
Single Global Lock. Thread-Safe Functions. Structured Code Locking. Monitors. Internal Functions. Invariants. Releasing the Monitor Lock. Multiple Conditions. Structured Data Locking. Object Deletion. Locking and Modularity. Nested Monitors. Long Operations. Reentrant Monitors. Monitors Revisited. Deadlock. Lock Ordering. Resource Deadlocks. C++. Scoped Locking. Locking Guidelines.

7. Using Threads.
Creating Threads. Improving I/O Throughput. Using Multiple Processors. Improving User Interface Responsiveness. Improving Server Responsiveness. Program Structure. Server Deadlock Avoidance. Failure Attributes. Threads vs. Event Loops. Processes vs. Threads. Thread Paradigms. Deferring Work. Anticipating Work. Pipelines, Pumps, and Serializers. Sleepers and One-Shots. Deadlock Avoiders. Task Rejuvenation. Threading Data Structures. Linked Lists. Queues. Hash Tables. An Example.

8. Thread-Specific Data.
Thread-Specific Data. Allocating TSD keys. Accessing TSD Values. Using TSD. Deleting TSD keys. Considerations in Using TSD. Redefining Interfaces for Threads.

9. Signals.
Signal Mask. Signal Generation. Sending Signals to Threads. raise(). Signal Delivery. Signal Handlers. Async-Safe Functions. Nonlocal goto. Waiting for Signals. sigsuspend(). Pending Signals. Per-Thread Signal Handlers.

10. Advanced Synchronization.
Interprocess Synchronization. Synchronization Variables in Files. Interprocess Synchronization and Process Death. Semaphores. Named and Unnamed Semaphores. Creating and Opening Named Semaphores. Unlinking Named Semaphores. Initializing and Destroying Unnamed Semaphores. Waiting For and Posting Semaphores. Getting a Semaphore's Value. Using Semaphores. Semaphores and Signal Handlers. Semaphores and the Memory Model.

11. Thread Cancellation.
Destroying Other Threads. Cancelling Threads. Cancellation Points. Cancellation Cleanup Handlers. Cleanup Handlers and Condition Variables. Detaching Threads During Cancellation. Testing for Cancellation. Asynchronous Cancellation. Disabling Cancellation. Using Cancellation.

12. Threads Scheduling.
Thread Scheduling Models. Using Contention Scope. Thread Scheduling Attributes. Inheriting Scheduling Attributes. Thread Scheduling Policies. Priorities. Yielding. Scheduling Policies. Scheduling Allocation Domain. Priority Inversion. Priority Ceiling Protocol. Priority Inheritance. Scheduling Strategies. Thread Scheduling in Solaris 2. Concurrency and Process Contention Scope Threads. System Contention Scope Threads. Contention Scope and Process-Shared Synchronization Variables.

13. Threads and Processes: Advanced Topics.
Managing Thread Stacks. Default Stack Management. Thread Stack Size Limits. Managing Your Own Thread Stacks. Strategies for Using fork(). Fork Handlers.

14. Advanced Synchronization Strategies.
Critical Section Concurrency. Lessons from Queuing Theory. Read/Write Locks. Read/Write Lock Conditions. Breaking Up Locks. Explicitly Locked Functions. Recursive Locks. Object-Unsafe Functions. Locking Guidelines II.

15. Multiprocessor Issues.
Shared Memory Multiprocessors. Caches and Cache Consistency Protocols. Synchronization Instructions. Synchronization on Multiprocessors. Spin Blocking. Wait-Free Synchronization. Convoys. Livelock.

16. Parallel Computation.
Using Threads to Parallelize Algorithms. Thread Paradigms. Master-Slave Paradigm. Master-Slave Example: Matrix Multiply. Barrier Synchronization. Master-Slave Example: Relaxation. Spin Barriers. Workpile Paradigm. Workpile Controllers. Workpile Example: Quicksort. Pipeline Paradigm. Pipeline Example: Graphics Rendering. Pipeline Example: Relaxation. Parallelizing Using Compiler Techniques. Performance. Imbalance. Synchronization Overhead. Lock Contention. Data Sharing and False Sharing Overhead. Performance and Problem Size. Guidelines for Writing Parallel Programs.

17. Multithreading Existing Code.
Libraries. Thread-Safety. Cancellation-Safety. Fork-Safety. Establishing Fork Handlers. Applications. Multithreading a Graphical User Interface.

18. Threads Development Environment.
Compiling Multithreaded Programs. Other POSIX Libraries. Header Files. Static Data Race Analysis. lock_lint. Debugging. debugger on Solaris 2. Performance Tuning. Critical Path Analysis. Critical Section Analysis. Profiling. Tracing.

A. Example Programs.
B. UNIX International Threads.
Overview. POSIX/UI Common Features. Additional Features of the UI Interface. Read/Write Locks. UI Resource Limits. Suspend and Continue. Daemon Threads. Forking Multithreaded Processes. Avoiding Data Races. Thread Scheduling. Concurrency Level. Thread Priorities. Scheduling Classes. Compiling and Linking UNIX International Programs. Header Files.

C. Manual Pages
threads(3T). cancellation(3T). condition(3T). mutex(3T). pthread_atfork(3T). pthread_attr_init(3T). pthread_condattr_init(3T). pthread_create(3T). pthread_detach(3T). pthread_equal(3T). pthread_exit(3T). pthread_join(3T). pthread_kill(3T). pthread_mutex_setprioceiling(3T). pthread_mutexattr_init(3T). pthread_once(3T). pthread_self(3T). pthread_setschedparam(3T). pthread_sigmask(3T). rwlock(3T). semaphore(3T). thr_min_stack(3T). thr_setconcurrency(3T). thr_suspend(3T). thr_yield(3T). sched_get_priority_max(3R). sched_setparam(3R). sched_setscheduler(3R). sched_yield(3R). sem_close(3R). sem_destroy(3R). sem_getvalue(3R). sem_init(3R). sem_open(3R). sem_post(3R). sem_unlink(3R). sem_wait(3R). sigwaitinfo(3R). sigwait(2). ctime(3C). directory(3C). getgrnam(3C). getlogin(3C). getpwnam(3C). rand(3C). string(3C). sysconf(3C). ttyname(3C).

D. Annotated Bibliography.

Preface

Threads are a new and powerful tool. As with most powerful tools, programmers must apply threads with discretion lest they do more harm than good. Part of the art of good multithreaded programming is knowing when not to use threads. Keep in mind that UNIX has gotten along for many years without them. The real impetus toward using threads has been the increasing popularity of multiprocessors and client-server computing. Typically, programs are expected to handle many requests simultaneously in these situations.

This book is for programmers interested in a practical guide to developing multithreaded programs. This book concentrates on teaching when and how to apply threads, what problems to expect and how to deal with them. It covers concurrency theory relatively lightly as there are many other books and papers that do better justice to the topic. This book also can be used as reference for the practicing threads programmer.

We assume that you are generally familiar with both UNIX programming concepts and the C programming language. It will be helpful if you have some experience with asynchronous programming using signal handlers or with programs that respond to multiple events, such as window or network programs.

This book is designed to be a general guide to programming with threads, not a tutorial on a specific set of interfaces. The two main UNIX threads interfaces are the IEEE Portable Operating System Interface (POSIX) standard P1003.1c (also called "Pthreads" and ISO/IEC 9945-1:1990c) and the UNIX International (UI) threads standard (see Appendix\x11B, "UNIX International Threads"). Both have the same basic model of threads, though the actual function definitions tend to use different styles. The coding examples in this book use the thread and operating system interfaces specified by the POSIX standards.

The POSIX thread standard specifies the threads application programming interfaces and the ways in which the other POSIX interfaces behave with respect to threads. In practice, threads programming also involves using other, non-standard aspects of the threads programming environment such as debuggers, performance tools, and non-standard libraries. In addition, effective threads programming requires some knowledge of the potential ways that the interfaces may be implemented within the standard. This book explains some of the tools available in the threads programming environment and some of the potential threads implementation strategies. In-depth examples of tools and implementation strategies are taken from the SolarisTM programming environment from Sun Microsystems.

In many cases, a threads programmer will be asked to convert existing applications and libraries to be multithreaded. This book covers potential approaches to threading existing code.

Using This Book

The chapters in this book are grouped into sections that can be skipped or skimmed depending on your interests.

Introduction

This section introduces the basic thread interfaces, thread creation, thread synchronization, libraries, and how threads interact with the UNIX process model. It covers some techniques for applying threads and constructing correct multithreaded programs. After reading this section, you should be able to construct useful multithreaded programs.

Chapter 1, "Introduction to Threads"

Chapter 2, "Getting Started"

Chapter 3, "Synchronization"

Chapter 4, "Using Libraries in Multithreaded Programs"

Chapter 5, "Threads and Process Resources"

Chapter 6, "Synchronization Strategies"

Chapter 7, "Using Threads"

Programmers who are already familiar with general thread concepts can simply browse this section to become familiar with the POSIX interfaces.

Advanced Interfaces
This section introduces the interfaces and strategies that are appropriate in more unusual or performance-critical situations.

Chapter 8, "Thread-Specific Data"

Chapter 9, "Signals"

Chapter 10, "Advanced Synchronization"

Chapter 11, "Thread Cancellation"

Chapter 12, "Threads Scheduling"

Chapter 13, "Threads and Processes: Advanced Topics"

Chapter 14, "Advanced Synchronization Strategies"

Chapter 15, "Multiprocessor Issues"

Chapter 16, "Parallel Computation"
You can skip this section on a first reading, but it is a good idea to at least skim it at some point so you know what's there if you need it.

Using Threads in the Real World
This section covers techniques for applying threads and constructing correct multithreaded programs and libraries.
Chapter 17, "Multithreading Existing Code"

Chapter 18, "Threads Development Environment"
Reference material This section contains reference material for the practicing thread programmer on a variety of subjects.
Appendix 1A, "Example Programs"
Appendix 1B, "UNIX International Threads"
Appendix 1C, "Manual Pages"
Appendix 1D, "Annotated Bibliography"
There is a World Wide Web site for threads examples, errata and other materials at:

http://www.sun.com/smi/ssoftpress/threads/

This site also contain most of the larger code examples in this book in full running form.
Coding Conventions

In many of the smaller coding examples, full declarations, included files, and full testing for errors are deleted for clarity. In these examples you should generally assume that the line:

#include
appears somewhere before the code. Since this book concentrates on threads more than the other aspects of POSIX, you should understand that the newer POSIX interfaces (as well as the newer UNIX International interfaces) no longer rely on the global variable errno to return error codes. Instead, they mostly return zero if the function was successful, or a non-zero error code (found in the include-file ).

Updates

Submit Errata

More Information

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.

Overview


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information


To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.

Surveys

Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.

Newsletters

If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information


Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.

Security


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.

Children


This site is not directed to children under the age of 13.

Marketing


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information


If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.

Choice/Opt-out


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information


Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents


California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure


Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.

Links


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact


Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice


We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020