DocumentCode
2219553
Title
Polling algorithms and their properties for Fieldbus networks
Author
Raja, P. ; Vijayananda, K. ; Decotignie, J.-D.
Author_Institution
Lab. d´´Inf. Tech., Swiss Federal Inst. of Technol., Lausanne, Switzerland
fYear
1993
fDate
15-19 Nov 1993
Firstpage
530
Abstract
Real-time local area networks like Fieldbus have to handle two types of data transfer, synchronous and asynchronous. Synchronous data are generated periodically and have to be transmitted before fixed deadlines. Asynchronous messages are generated by unforeseen events and thus cannot be predicted. The data transfer is handled in two different phases. In this paper the authors study the properties of some scheduling algorithms to see how best the asynchronous messages are scheduled so that they meet their deadlines
Keywords
local area networks; message passing; real-time systems; scheduling; Fieldbus networks; asynchronous messages; data transfer; polling algorithms; real-time local area networks; scheduling algorithms; synchronous; Automatic control; Costs; Field buses; Job shop scheduling; Local area networks; Network servers; Process control; Protocols; Scheduling algorithm; Synchronous generators;
fLanguage
English
Publisher
ieee
Conference_Titel
Industrial Electronics, Control, and Instrumentation, 1993. Proceedings of the IECON '93., International Conference on
Conference_Location
Maui, HI
Print_ISBN
0-7803-0891-3
Type
conf
DOI
10.1109/IECON.1993.339020
Filename
339020
Link To Document