Scheduling time-constrained communication in linear networks
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Time-constrained scheduling of weighted packets on trees and meshes
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Distributed systems (3rd ed.): concepts and design
Distributed systems (3rd ed.): concepts and design
Scheduling in Synchronous Networks and the Greedy Algorithm (Extended Abstract)
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Combined routing and scheduling of concurrent communication traffic in hypercube multicomputers
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Offline architecture for real-time betting
ICME '03 Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 2
Single processor scheduling with job values depending on their completion times
Journal of Scheduling
The Videotex Hot Line Lottery-Ticket-Buying Solution Based on Mobile GPRS System
ICMECG '08 Proceedings of the 2008 International Conference on Management of e-Commerce and e-Government
Hi-index | 0.00 |
The minimization of the total completion time for asynchronous transmission in distributed systems is discussed. Attention is focused on the problem of message scheduling on part of the sender. Messages to be sent form a queue, and the order in which they are to be sent has to be first established. The methods of scheduling messages, which minimize the factor of the total completion time, are presented herein. The message-scheduling problem becomes considerably complicated when the stream of data transmitted between the sender and the receiver is organized into packets. A scheduling rule, according to which the shortest messages (SPT-Shortest Processing Time) are selected as the first to be sent, has been proven to be appropriate for the proposed model. A heuristic algorithm for scheduling messages with real-time constraints is proposed. The performance of the scheduling algorithm is experimentally evaluated. The results of the study show the possibility of improving the total completion time from a few to ten percent, depending on the characteristics of the sender. Thus, the practicability of the method has been proved.