<abstract xml:lang="en" xmlns="http://www.w3.org/1999/xhtml"><p>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.</p></abstract>

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.

Minimization of the total completion time for asynchronous transmission in a packet data-transmission system

Department of Geoinformatics and Applied Computer Science, AGH University of Science and Technology, al. Mickiewicza 30, 30-059 Cracow, Poland

Computer Science Laboratory, Institute of Automatics, AGH University of Science and Technology, al. Mickiewicza 30, 30-059 Cracow, Poland

International Journal of Applied Mathematics and Computer Science

The minimization of the total completion time for asynchronous transmission in distributed systems is discussed. Attention is focused on the problem of message...

Minimization of the total completion time for asynchronous transmission in a packet data-transmission system

Data publikacji: 02 lip 2010

Zakres stron: 391 - 400

DOI: https://doi.org/10.2478/v10006-010-0029-z

Słowa kluczowe
message scheduling, message queuing, distributed systems, real-time systems

This content is open access.

Minimization of the total completion time for asynchronous transmission in a packet data-transmission system

Data publikacji: 02 lip 2010

Zakres stron: 391 - 400

DOI: https://doi.org/10.2478/v10006-010-0029-z

Słowa kluczowemessage scheduling, message queuing, distributed systems, real-time systems

This content is open access.

Słowa kluczowe
message scheduling, message queuing, distributed systems, real-time systems