Changes between Version 113 and Version 114 of Writing Rules/Tlmt


Ignore:
Timestamp:
Mar 3, 2009, 9:27:44 AM (14 years ago)
Author:
alinevieiramello@…
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • Writing Rules/Tlmt

    v113 v114  
    2424is only allowed to process when it has timing information on all its input ports. For example, an interconnect is only allowed to let a
    2525command packet reach a given target when all the initiators that can address this target have sent at least one timed message.
    26 To solve this issue the PDES algorithm uses ''nul message''. A null message contain no data, but only a time information.
     26To solve this issue the PDES algorithm uses ''nul message''. A null message contains no data, but only a time information.
    2727Moreover, all processes can be in two modes : active & non-active. Only processes that are active participate to the temporal filtering.
    2828
    2929A first implementation of TLMT used ''sollicited null messages'', but the final solution uses ''direct null-messages'', that strictly
    30 follow the Chandy-Misra pessimistic algorithm. Each process cannot run independantly without sending a timed message
     30follow the Chandy-Misra pessimistic algorithm. Each process cannot run independently without sending a timed message
    3131for a time larger that a predefined value, called the SYNCHRONIZATION_TIME_QUANTUM. When this time quantum is elapsed,
    3232the process must send a null message on its output ports.