Wyniki wyszukiwania - BazTech

Ograniczanie wyników

1 Control and Cybernetics

1 2014

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: total weighted completion time

Sortuj według:

Ogranicz wyniki do:

Heuristic algorithms for the optimization of total weighted completion time for asynchronous transmission in a packet data transmission system

Piórkowski A., Werewka J., Bielecka M.

Control and Cybernetics

2014

Vol. 43, no. 4

507--529

In this paper, the minimization of total weighted completion time (total cost) for asynchronous transmission in distributed systems is discussed. Special attention has been paid to the problem of message scheduling on the sender side. Messages to be sent form a queue, therefore the order in which they are to be sent has to be set. Scheduling algorithms can be chosen to optimize scheduling criteria such as total completion time or total weighted completion time. The message scheduling problem becomes complicated considerably when the transmitted data stream between the sender and the receiver is formed into packets. TheWSPT (Weighted Shortest Processing Time) scheduling rule, which orders messages according to non-decreasing length and weight ratios has been proven to be non-optimal. It has been demonstrated that the problem of minimizing the total weighted completion time is NP-hard. Here, we propose heuristic algorithms for scheduling messages and experimentally evaluate the performance of these scheduling algorithms.