ScholarWorks@숙명여자대학교

초록

Event message processing is important in DVE because collaboration among distributed participants is exploited only by sharing event messages over the network. Existing DVE systems process event messages in FCFS algorithm based on the occurrence time of event, and do not reflect the priority of event. It implies how serious an event is to the receivers, and is dependent on the type of event, and the location of event occurrence, and so on. This paper proposes a new event scheduling algorithm in DVE introducing this priority information of event. The advantage of the suggested algorithm is the improvement of system response time to user's interaction, compared with previous FCFS scheduling, especially when high DOI events occur. It considers event occurrence time as well as the priority simultaneously not so as to cause starvation situations of low DOI events. For performance evaluation, this work has measured and compared average waiting time of events in event queue.