CS655_HessahAlsaaran_ProcessMigration

In partial migration dependency between the source and

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview:   If the node’s load < CT à༎ initiate load request. Ê༌  Reason: small change in load can cause immediate node starvation. Ê༌  The network delay (ND) is the time it takes to receive a load after a request (adaptive). 37 38 Migration Algorithm (When?) Second Exception Migration Algorithm (Where?) Ê༌  If the node’s load > HT à༎ never initiate load request. Ê༌  Even if it predicted that it will become idle. Ê༌  Reason: Ê༌  DL must be high à༎ the value is probably rare and short lived. Ê༌  Each node maintains 2 tables: Sink Table and Source Table. Ê༌  For every load request it receives, the requesting node is considered a sink. Ê༌  For every load request reply it receives, the replying node is considered a source. Ê༌  To resist high spikes in load à༎ delay load requests until the load falls below HT. Ê༌  When a node initiates a load request: Ê༌  It selects the first source node in the Source Table. Ê༌  If table is empty à༎ select a random node (not in Sink Table). Ê༌  Send the load request to it. Ê༌  It may forward the request to another selected source node. 39 40 Migration Algorithm (How many?) Migration Algorithm (Which?) Ê༌  Using DL, the node predicts what its load will be after ND Ê༌  Old tasks (CPU time) time length à༎ predicted load (PL). Ê༌  If PL ≥ zero à༎ the node does not predict idleness in the next ND time period. Ê༌  Reason: they will probably live longer, making the migration process worthwhile....
View Full Document

This note was uploaded on 02/11/2014 for the course CS 655 taught by Professor Shrideeppallickara during the Fall '13 term at Colorado State.

Ask a homework question - tutors are online