DocumentCode :
2745442
Title :
Analysis of a scheduling algorithm for real-time communication
Author :
Lindemann, Christoph W.
Author_Institution :
Inst. fuer Tech. Inf., Tech. Univ., Berlin, West Germany
fYear :
1990
fDate :
21-23 May 1990
Firstpage :
564
Lastpage :
569
Abstract :
A refined version of a random multiple-access algorithm for time-constrained communication in distributed computing systems is introduced. The performance of the algorithm is analyzed by simulation. The simulation experiment shows that the basic scheduling idea of the algorithm, namely, to reject messages with deadlines earlier than a minimum acceptable deadline, leads to an improvement in the quality of service as measured by the percentage of losses
Keywords :
computer networks; digital simulation; distributed processing; multi-access systems; performance evaluation; protocols; real-time systems; scheduling; data communication systems; digital simulation; distributed computing systems; random multiple-access algorithm; real-time communication; scheduling; Access protocols; Algorithm design and analysis; Communication networks; Computational modeling; Control systems; Job shop scheduling; Loss measurement; Quality of service; Robots; Scheduling algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Integrated Manufacturing, 1990., Proceedings of Rensselaer's Second International Conference on
Conference_Location :
Troy, NY
Print_ISBN :
0-8186-1966-X
Type :
conf
DOI :
10.1109/CIM.1990.128163
Filename :
128163
Link To Document :
بازگشت