Chap5 Flashcards

1
Q

Thread specific data

A

Program counter
Status of the thread
Processor registers
Stack space

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Thread shares

A

Program code
Data
Resources

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

UNIX Processes’s address space

A

Subdivided into text, data, & stack segment
 Program file describes the address space

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Benefits of multithreaded
programming

A

Responsiveness
Resource sharing
Ease of memory and resource allocation
Utilization of multiprocessor architectures

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Process Manager implementations

A

 Calls like fork() in UNIX and CreateProcess() in windows to create processes.
 Calls like pthread_create() in Linux and CreateThread() in Windows to support threading.
 Calls like close() in Unix and CloseHandle() in Windows to close processes/threads to release resources.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Process Descriptors

A

OS creates/manages process abstraction
Also known as Process Control Block (PCB)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Process Descriptors’s data structure for each process

A

 Process ID
 Program counter
 Register values
 Process state
 Type & location of resources it holds
 List of resources it needs
 Security keys

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Process States (draw the diagram)

A

 Running: Instructions are being executed
 Blocked: The process is waiting for some event to
occur (eg, I/O completion)
 Ready: The process is waiting to be assigned to a
processor.
 Done: The process has finished execution

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Linux State Transition Diagram (draw diagram)

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly