SRI VIDYA COLLEGE OF ENGINEERING & TECHNOLOGY - VIRUDHUNAGAR
UNIT V
PART A
1. What is process?
Process means a program in execution. Process execution must progress sequential order.
2. What is process migration?
The phenomenon of shifting a process from one machine to another one which is called
process migration.
3. What is Load?
Load may be define as number of tasks are running in queue, CPU utilization, load
average, I/O utilization, amount of free CPU time/memory, etc.
M
4. List desirable features of good process migration mechanism.
O
Transparency
C
Efficiency
Minimal interference
S.
U
Minimize freezing time
C
FO
Minimal residual dependencies.
TS
5. List any three challenges of process migration.
EN
Process state capturing and transfer
Scheduling
D
U
System call
ST
6. What are strategies for the migration of files?
If the file is locked by the migrating process and resides on the same system, then
transfer file with the process
If the process is moved temporarily, transfer the file only after an access request
was made by the migrated process.
7. Define thread.
A minimal software processor in which context a series of instructions can be executed.
Saving a thread context implies stopping the current execution and saving all the data
needed to continue the execution at a later stage
8. Explain the benefit of process migration
CS6601-DISTRIBUTED SYSTEMS Page 1
SRI VIDYA COLLEGE OF ENGINEERING & TECHNOLOGY - VIRUDHUNAGAR
Better response time and execution speed – up
Reducing network traffic
Improving system reliability
Higher throughput and effective resource utilization
9. List the types of process scheduling techniques.
Task management approaching
Load balancing approaching
Load – Sharing approaching
10. What is kernel level thread?
In kernel level thread, thread management is done by kernel. OS support the kernel level
thread. Since kernel managing threads, kernel can schedule another thread if a given
thread blocks rather than blocking the entire processes.
M
O
11. What is user level thread?
C
User level thread uses user space for thread scheduling. These threads are transparent to
S.
the operating system. User level threads are created by runtime libraries that cannot
U
execute privileged instructions.
C
FO
12. What is preemptive process migration?
TS
Preemptive process transfer involve the transfer of a process that is partially executed.
This transfer is an expensive operation as the collection of a process’s state can be
EN
difficult.
D
U
ST
13. What is non preemptive process migration?
Non –preemptive process transfers involve the transfer of process that have not begun
execution an hence do not require the transfer of the proces’s state. In both types of
transfers, information about the environment in which the process will execute must be
transferred to the receiving node.
PART B
1. Explain in detail about process migration.
Process migration is the transfer of a sufficient amount of the state of a process
from one computer to another for the process to execute on the target machine.
Working of process migration:
Selecting a process to be migrated
Selecting the destination node
Suspending the process
Capturing the process state
CS6601-DISTRIBUTED SYSTEMS Page 2
SRI VIDYA COLLEGE OF ENGINEERING & TECHNOLOGY - VIRUDHUNAGAR
Sending the state to the destination
Resuming the process
Forwarding future messages to the destination
Process migration is of two types:
Preemptive process migration
Non – preemptive process migration
Desirable features of good process migration mechanism
Transparency
Minimal interference
Minimal residual dependencies
Efficiency
Robustness
M
O
Process migration mechanisms
C
S.
Freezing and restarting a process
U
Transferring the address space and state
C
Message – forwarding mechanism
FO
TS
Advantages of process migration
EN
Balancing the load
D
Moving the process closer to the resources it is using utilizes resources
U
effectively and reduces network traffic
ST
Being able to move a copy of a process on another node improves system
reliability
2. Explain in detail about thread?
Thread is a dispatchable unit of work. It consists of thread ID, program counter,
stack and register set.
Thread advantages
Context switching time is minimized
Thread support for efficient communication
Resources sharing is possible using threads
A thread provides concurrency within a process
CS6601-DISTRIBUTED SYSTEMS Page 3
SRI VIDYA COLLEGE OF ENGINEERING & TECHNOLOGY - VIRUDHUNAGAR
3. Illustrate thread model.
User level thread
Kernel level thread
User level thread
User level thread uses user space for thread scheduling. These threads are
transparent to the operating system. User level threads are created by runtime
libraries that cannot execute privileged instructions.
Advantage:
Kernel mode privilege does not require for thread switching
These threads are fast to create and manage
User level threads are more portable
Disadvantage:
M
O
Not suitable for multiprocessor system
C
S.
User level threads also do not support system wide scheduling priority
U
C
Kernel level thread
FO
In kernel level thread, thread management is done by kernel. OS support
TS
the kernel level thread.
EN
Advantages:
D
U
Each thread can be thread separately
ST
Kernel routines itself as multithreaded.
Disadvantage:
Slower than user level thread.
There will be overhead and increased in kernel complexity
4. Explain in detail about resource management
Distributed systems contain a set of resources interconnected by a network. The
processes are migrated to fulfill their resource requirements and resource manager are to
control the assignment of resources to processes.
Types of process scheduling techniques
Task assignment approach
Load balancing approach
CS6601-DISTRIBUTED SYSTEMS Page 4
SRI VIDYA COLLEGE OF ENGINEERING & TECHNOLOGY - VIRUDHUNAGAR
Load sharing approach
Features
Dynamic in nature
Quick decision making capability
Balanced system performance
Stability
Fault tolerance
Fairness of service
5. Explain in detail about Task assignment approach
Process have been split into tasks
Computational requirement of tasks and speed of processors are known
Costs of processing tasks on nodes are known
Reassignment of task is not possible
M
O
C
Goals of task assignment algorithm
S.
Minimization of IPC costs
U
C
Quick turnaround time for the complete process
FO
A high degree of parallelism
TS
Efficient utilization of system resources
EN
Task assignment algorithms are of three types:
D
Graph theoretic deterministic algorithm
U
Centralized heuristics algorithm
ST
Hierarchical algorithm
CS6601-DISTRIBUTED SYSTEMS Page 5
