论文信息 - Priority polling and dynamic time-window mechanisms in a multicycle Fieldbus

Priority polling and dynamic time-window mechanisms in a multicycle Fieldbus

Real-time local area networks have to handle synchronous and asynchronous data transfer. The data transfer is handled in two different phases or time windows. Priority polling algorithms that generate the polling sequence for the data transfer automatically respecting the periodic deadlines are presented. Dynamic mechanisms to extend time-windows are introduced and the network bandwidth is utilized more efficiently. These algorithms are computed during the real-time operation of the network.<<ETX>>

P. Raja | G. Ulloa

[1] Chung Laung Liu,et al. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[2] Lui Sha,et al. Exploiting unused periodic time for aperiodic service using the extended priority exchange algorithm , 1988, Proceedings. Real-Time Systems Symposium.

[3] J. M. Moore,et al. A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .

[4] Jean-Dominique Decotignie,et al. Multicycle operations in a field bus: application layer implications , 1989, 15th Annual Conference of IEEE Industrial Electronics Society.