Task Migration and its issues


Task Migration
         It is the movement of an executing task from one host processor in distributed computing system to another.
         Task placement is the selection of a host for a new task and the creation of the task on that host.

Benefits of task Migration
         Load Balancing: -Improve performance for a distributed computing system overall or a distributed application by spreading thee load more evenly over a set of host.
         Reduction in Communication overhead: - by locating on one host a group of tasks with intensive communication amongst them.
         Resource access:-not all resources are available across the network, a task may need to migrate in order to access a special device, or to satisfy a need for a large amount of physical memory
         Fault tolerance:-allowing long running processes to survive the planned shutdown or failure of a host.

Steps involved in task migration
         Suspending the task on the source.
         Extracting and transmitting the state of the task to destination.
         Reconstructing the state on the destination
         Deleting the task on the source and resuming the task’s execution on the destination.

Task Migration Issues
There are three issues in the task migration:-
         State Transfer
         Location transparency
         Structure of a migration mechanism

State Transfer
         The cost to support remote execution.
         Freezing the task.
         Obtaining and transferring the state.
         Unfreezing the task.

         Residual dependencies:-Refer to the amount of resources a host of a migrated task continues to dedicate to service requests from the migrated task. They are undesirable for three reasons:-Reliability, performance and complexity.

State Transfer mechanisms
         Recopying the state:-bulk of the task is copied to the new host before freezing the task.
         Location transparent file access mechanism
         Copy on reference: - just copy what is migrated task need for its execution.

Location Transparency
         Task Migration should hide the locations of tasks. Location transparency in principle requires that name (process name, file name) be independent of their locations (host names).
         Uniform name spacer throughout the system.

Structure of a migration mechanism
         Typically. Here will be interaction between the task migration mechanism, the memory management system, the interprocess communication mechanism and the file system.
         The mechanism can be designed to be independent for one another so that if one mechanism’s protocol changes; the other’s need not the migration mechanism can be turned off without interfering with other mechanisms.

EasyExamNotes.com covered following topics in these notes.
Python Programming ↓ 👆
Java Programming ↓ 👆
JAVA EasyExamNotes.com covered following topics in these notes.
JAVA Programs
Principles of Programming Languages ↓ 👆
Principles of Programming Languages
EasyExamNotes.com covered following topics in these notes.

Previous years solved papers:
A list of Video lectures References:
  1. Sebesta,”Concept of programming Language”, Pearson Edu 
  2. Louden, “Programming Languages: Principles & Practices” , Cengage Learning 
  3. Tucker, “Programming Languages: Principles and paradigms “, Tata McGraw –Hill. 
  4. E Horowitz, "Programming Languages", 2nd Edition, Addison Wesley

    Computer Organization and Architecture ↓ 👆

    Computer Organization and Architecture 

    EasyExamNotes.com covered following topics in these notes.

    1. Structure of desktop computers
    2. Logic gates
    3. Register organization
    4. Bus structure
    5. Addressing modes
    6. Register transfer language
    7. Direct mapping numericals
    8. Register in Assembly Language Programming
    9. Arrays in Assembly Language Programming


    1. William stalling ,“Computer Architecture and Organization” PHI
    2. Morris Mano , “Computer System Organization ”PHI

    Computer Network ↓ 👆
    Computer Network

    EasyExamNotes.com covered following topics in these notes.
    1. Data Link Layer
    2. Framing
    3. Byte count framing method
    4. Flag bytes with byte stuffing framing method
    5. Flag bits with bit stuffing framing method
    6. Physical layer coding violations framing method
    7. Error control in data link layer
    8. Stop and Wait scheme
    9. Sliding Window Protocol
    10. One bit sliding window protocol
    11. A protocol Using Go-Back-N
    12. Selective repeat protocol
    13. Application layer
    1. Andrew S. Tanenbaum, David J. Wetherall, “Computer Networks” Pearson Education.
    2. Douglas E Comer, “Internetworking with TCP/IP Principles, Protocols, And Architecture",Pearson Education
    3. KavehPahlavan, Prashant Krishnamurthy, “Networking Fundamentals”, Wiley Publication.
    4. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source Approach”, McGraw Hill.