Changes between Version 113 and Version 114 of Writing Rules/Tlmt
- Timestamp:
- Mar 3, 2009, 9:27:44 AM (15 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
Writing Rules/Tlmt
v113 v114 24 24 is only allowed to process when it has timing information on all its input ports. For example, an interconnect is only allowed to let a 25 25 command 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.26 To solve this issue the PDES algorithm uses ''nul message''. A null message contains no data, but only a time information. 27 27 Moreover, all processes can be in two modes : active & non-active. Only processes that are active participate to the temporal filtering. 28 28 29 29 A 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 independ antly without sending a timed message30 follow the Chandy-Misra pessimistic algorithm. Each process cannot run independently without sending a timed message 31 31 for a time larger that a predefined value, called the SYNCHRONIZATION_TIME_QUANTUM. When this time quantum is elapsed, 32 32 the process must send a null message on its output ports.