<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Rodrigues, João</style></author><author><style face="normal" font="default" size="100%">Ventura, João</style></author><author><style face="normal" font="default" size="100%">Campos, António Miguel de</style></author><author><style face="normal" font="default" size="100%">Rodrigues, Luís</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Implementation and analysis of real-time communication protocol compositions</style></title><secondary-title><style face="normal" font="default" size="100%">Real-Time Systems</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Allocation</style></keyword><keyword><style  face="normal" font="default" size="100%">Priority assignment</style></keyword><keyword><style  face="normal" font="default" size="100%">Protocol composition and execution framework</style></keyword><keyword><style  face="normal" font="default" size="100%">Real-Time</style></keyword><keyword><style  face="normal" font="default" size="100%">Schedulability Analysis</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2007</style></year><pub-dates><date><style  face="normal" font="default" size="100%">10/2007</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/s11241-007-9026-1</style></url></web-urls><related-urls><url><style face="normal" font="default" size="100%">http://www.venturas.org/sites/default/files/fulltext.pdf</style></url></related-urls></urls><publisher><style face="normal" font="default" size="100%">Springer Netherlands</style></publisher><volume><style face="normal" font="default" size="100%">37</style></volume><pages><style face="normal" font="default" size="100%">45-76</style></pages><abstract><style face="normal" font="default" size="100%">A flexible way of building modular communication stacks relies on the use of protocol composition. This paper describes a protocol composition framework that simplifies the task of deriving the worst-case response time of a protocol composition from the protocol implementation. In order to derive the worst-case response time of a protocol composition, one needs to capture its event-graph: the event-graph consists of the set of all events processed by each component and the relation between those events. The framework, called RT-Appia, takes a pragmatic approach: instead of requiring the use of domain specific code analysis tools, or dedicated compilers, it simply requires protocol programmers to make explicit which events are processed and produced by each layer, and how these events are related. An interesting aspect of the approach is that the same data structures that are used to simplify the task of computing the worst-case response time of the protocol composition are also used to optimize the performance and to debug the resulting implementation.</style></abstract><issue><style face="normal" font="default" size="100%">1</style></issue><notes><style face="normal" font="default" size="100%">© Springer 2007

The original publication is available at www.springerlink.com.</style></notes></record></records></xml>
