Scribd
Upload
34 views

Chapter 1 - Why Threads

1

Uploaded by

savio77
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
34 views

Chapter 1 - Why Threads

1

Uploaded by

savio77
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Chapter 1 - Why Threads

Pthreads Programming Bradford Nichols, Dick Buttlar and Jacqueline Proulx Farrell Copyright 1996 O'Reilly & Associates, Inc.

Chapter 1: Why Threads?


Overview
When describing how computers work to someone new to PCs, it's often easiest to haul out the old notion that a program is a very large collection of instructions that are performed from beginning to end. Our notion of a program can include certain eccentricities, like loops and jumps, that make a program more resemble a game of Chutes and Ladders than a piano roll. If programming instructions were squares on a game board, we can see that our program has places where we stall, squares that we cross again and again, and spots we don't cross at all. But we have one way into our program, regardless of its spins and hops, and one way out. Not too many years ago, single instructions were how we delivered work to computers. Since then, computers have become more and more powerful and grown more efficient at performing the work that makes running our programs possible. Today's computers can do many things at once (or very effectively make us believe so). When we package our work according to the traditional, serial notion of a program, we're asking the computer to execute it close to the humble performance of a computer of yesterday. If all of our programs run like this, we're very likely not using our computer to its fullest capabilities. One of those capabilities is a computing system's ability to perform multitasking. Today, it's frequently useful to look at our program (our very big task) as a collection of subtasks. For instance, if our program is a marine navigation system, we could launch separate tasks to perform each sounding and maintain other tasks that calculate relative depth, correlate coordinates with depth measurements, and display charts on a screen. If we can get the computer to execute some of these subtasks at the same time, with no change in our program's results, our overall task will continue to get as much processing as it needs, but it will complete in a shorter period of time. On some systems, the execution of subtasks will be interleaved on a single processor; on others, they can run in parallel. Either way, we'll see a performance boost. Up until now, when we divided our program into multiple tasks, we had only one way of delivering them to the processorprocesses. Specifically, we started designing programs in which parent processes forked child processes to perform subtasks. In this model, each subtask must exist within its own process. Now, we've been given an alternative that's even more efficient and provides even better performance for our overall programthreads. In the threads model, multiple subtasks exist as individual streams of control within the same process. The threads model takes a process and divides it into two parts: One contains resources used across the whole program (the processwide information),such as program instructions and global data. This part is still referred to as the process. The other contains information related to the execution state, such as a program counter and a stack. This part is referred to as a thread. To compare and contrast multitasking between cooperating processes and multitasking using threads, let's first look at how the simple C program in Example 1-1 can be represented as a process (Figure 1-1), a process with a single thread (Figure 1-2), and, finally, as a process with multiple threads (Figure 1-3). Example 1-1: A Simple C Program (simple.c) #include <stdio.h> void do_one_thing(int *); void do_another_thing(int *); void do_wrap_up(int, int); int r1 = 0, r2 = 0; extern int main(void) { do_one_thing(&r1); do_another_thing(&r2); do_wrap_up(r1, r2); return 0; } void do_one_thing(int *pnum_times) { int i, j, x; for (i = 0; i < 4; i++) { printf("doing one thing\n");
converted by Web2PDFConvert.com

for (j = 0; j < 10000; j++) x = x + i; (*pnum_times)++; } } void do_another_thing(int *pnum_times) { int i, j, x; for (i = 0; i < 4; i++) { printf("doing another \n"); for (j = 0; j < 10000; j++) x = x + i; (*pnum_times)++; } } void do_wrap_up(int one_times, int another_times) { int total; total = one_times + another_times; printf("wrap up: one thing %d, another %d, total %d\n", one_times, another_times, total); } Figure 1-1 shows the layout of this program in the virtual memory of a process, indicating how memory is assigned and which resources the process consumes. Several regions of memory exist: A read-only area for program instructions (or "text" in UNIX parlance) A read-write area for global data (such as the variables r1 and r2 in our program)

Figure 1-1: The simple program as a process A heap area for memory that is dynamically allocated through malloc system calls A stack on which the automatic variables of the current procedure are kept (along with function arguments and other information needed to link it to the procedure that called it), just below similar information for the procedure that called it, just below similar information for the procedure that called it, and so on and so on. Each of these procedure-specific areas is known as a stack frame, and one exists for each procedure in the program that remains active. In the stack area of this illustration you can see the stack frames of our procedures do_one_thing and main. To complete our inventory of system resources needed to sustain this process, notice: Machine registers, including a program counter (PC) to the currently executing instruction and a pointer (SP) to the current stack frame Process-specific include tables, maintained by the operating system, to track systemsupplied resources such as open files (each requiring a file descriptor), communication end points (sockets), locks, and signals Figure 1-2 shows the same C program as a process with a single thread. Here, the machine registers (program counter, stack pointer, and the rest) have become part of the thread, leaving the rest as the process. As far as the outside observer of the program is concerned, nothing much has changed. As a process with a single thread, this program executes in exactly the same way as it does when modeled as a nonthreaded process. It is only when we design our program to take advantage of multiple threads in the same process that the thread model really takes off.

Figure 1-2: The simple program as a process with a thread Figure 1-3 shows our program as it might execute if it were designed to operate in two threads in a single process. Here, each thread has its own copy of the machine registers. (It's certainly very handy for a thread to keep track of the instruction it is currently executing and where in the stack area it should be pushing and popping its procedure-context information.) This allows Thread 1 and Thread 2 to execute at different locations (or exactly the same location) in the program's text. Thread 1, the thread in which the program was started, is executing do_one_thing, while Thread 2 is executing do_another_thing. Each
converted by Web2PDFConvert.com

thread can refer to global variables in the same data area. (do_one_thing uses r1 as a counter; do_another_thing uses r2.) Both threads can refer to the same file descriptors and other resources the system maintains for the process.

Figure 1-3: The simple program as a process with multiple threads

Books24x7.com, Inc 2000 Feedback

converted by Web2PDFConvert.com

You might also like