Parallel And Distributed Simulation Research Group

User Tools

Site Tools

Trace: • gaia-apis
pads:gaia-apis

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
pads:gaia-apis [2017/12/20 07:47] – gdangelopads:gaia-apis [2017/12/20 07:48] (current) – gdangelo
Line 116: Line 116:
 **Description**: **Description**:
  
-Returns the length of the time-step used in the simulation. This parameter is initialized using the **GLOBAL_LA** parameters as defined in the file "**channels.txt**". For example, GLOBAL_LA=1 defines a global lookahead (timestep) of 1 time-unit, and GLOBAL_LA=0.01 is to define timesteps with a length of 1/100 of time-unit.+Returns the length of the timestep used in the simulation. This parameter is initialized using the **GLOBAL_LA** parameters as defined in the file "**channels.txt**". For example, GLOBAL_LA=1 defines a global lookahead (timestep) of 1 time-unit, and GLOBAL_LA=0.01 is to define timesteps with a length of 1/100 of time-unit.
  
 **Notes**: **Notes**:
Line 124: Line 124:
 **Return value:** **Return value:**
  
-The time-step length (double).+The timestep length (double).
  
 ---- ----
Line 377: Line 377:
 ^ Migration heuristic      ^  Description       ^  Pros  ^  Cons  ^ ^ Migration heuristic      ^  Description       ^  Pros  ^  Cons  ^
 | MIGR_OFF    |  //none//     |  none  |  none  | | MIGR_OFF    |  //none//     |  none  |  none  |
-| MIGR_ON / MIGR_E1   |  The heuristic is evaluated each time-step. It is based on the last E1_HISTORY_SLOTS timesteps of the simulation. It is implemented a sliding window approach that at each step throws away the oldest events and inserts the more recent ones  |  Very high LCR  \\  Well-suited for communication intensive models  |  In some cases, relevant overhead  | +| MIGR_ON / MIGR_E1   |  The heuristic is evaluated each timestep. It is based on the last E1_HISTORY_SLOTS timesteps of the simulation. It is implemented a sliding window approach that at each step throws away the oldest events and inserts the more recent ones  |  Very high LCR  \\  Well-suited for communication intensive models  |  In some cases, relevant overhead  | 
 | MIGR_E2  |  The heuristic is evaluated each timestep. It is based on the a sliding window with the last E2_EVENT_HISTORY_SIZE messages sent by the SE  |  Well suited for simulations in which the communication pattern of entities changes frequently   |  In some cases, relevant overhead  | | MIGR_E2  |  The heuristic is evaluated each timestep. It is based on the a sliding window with the last E2_EVENT_HISTORY_SIZE messages sent by the SE  |  Well suited for simulations in which the communication pattern of entities changes frequently   |  In some cases, relevant overhead  |
 | MIGR_E3  |  The heuristic is evaluated only if the SE has sent at least E3_EVENT_COUNTDOWN events after the last evaluation. The rest of the mechanism is the same as MIGR_E2  |  Well suited for simulations with a very high number of SEs and in which the communication pattern of entities changes frequently   |  In some cases slow convergence and slightly lower LCR  | | MIGR_E3  |  The heuristic is evaluated only if the SE has sent at least E3_EVENT_COUNTDOWN events after the last evaluation. The rest of the mechanism is the same as MIGR_E2  |  Well suited for simulations with a very high number of SEs and in which the communication pattern of entities changes frequently   |  In some cases slow convergence and slightly lower LCR  |
Line 474: Line 474:
 **Notes**: **Notes**:
  
-   * The message time-stamp has to respect the constraints given by the synchronization algorithm (time-stepped).+   * The message time-stamp has to respect the constraints given by the synchronization algorithm (timestepped).
  
    * This API has the exactly the same semantic of GAIA_Send(). For performance reasons, in this case the message is contained in an array instead of a String.    * This API has the exactly the same semantic of GAIA_Send(). For performance reasons, in this case the message is contained in an array instead of a String.
Line 504: Line 504:
 **Notes**: **Notes**:
  
-   * The message time-stamp has to respect the constraints given by the synchronization algorithm (time-stepped).+   * The message time-stamp has to respect the constraints given by the synchronization algorithm (timestepped).
  
    * Given that the message is delivered also to the SE that is originating it, it must be carefully managed to avoid loops.    * Given that the message is delivered also to the SE that is originating it, it must be carefully managed to avoid loops.
Line 533: Line 533:
 **Notes**: **Notes**:
  
-   * The message time-stamp has to respect the constraints given by the synchronization algorithm (time-stepped).+   * The message time-stamp has to respect the constraints given by the synchronization algorithm (timestepped).
  
    * Given that the message is delivered also to the SE that is originating it, it must be carefully managed to avoid loops.    * Given that the message is delivered also to the SE that is originating it, it must be carefully managed to avoid loops.
pads/gaia-apis.1513756038.txt.gz · Last modified: by gdangelo
Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki