{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T10:43:47Z","timestamp":1709203427951},"reference-count":21,"publisher":"University of Zielona G\u00f3ra, Poland","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6,1]]},"abstract":"<jats:title>Minimization of the total completion time for asynchronous transmission in a packet data-transmission system<\/jats:title><jats: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\u2014Shortest 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.<\/jats:p>","DOI":"10.2478\/v10006-010-0029-z","type":"journal-article","created":{"date-parts":[[2010,7,3]],"date-time":"2010-07-03T06:34:38Z","timestamp":1278138878000},"page":"391-400","source":"Crossref","is-referenced-by-count":3,"title":["Minimization of the total completion time for asynchronous transmission in a packet data-transmission system"],"prefix":"10.61822","volume":"20","author":[{"given":"Adam","family":"Pi\u00f3rkowski","sequence":"first","affiliation":[]},{"given":"Jan","family":"Werewka","sequence":"additional","affiliation":[]}],"member":"37438","reference":[{"key":"1","first-page":"1","article-title":"Time-constrained scheduling of weighted packets on trees and meshes","author":"M. Adler","year":"1999"},{"key":"2","first-page":"269","article-title":"Scheduling time-constrained communication in linear networks","author":"M. Adler","year":"1998"},{"key":"3","doi-asserted-by":"crossref","unstructured":"Bansal, N. and Harchol-Balter, M. (2000). Analysis of SRPT scheduling: Investigating unfairness, <i>Technical Report CMU-CS-00-149<\/i>, Carnegie Mellon University, Pittsburgh, PA.","DOI":"10.21236\/ADA382309"},{"key":"4","volume-title":"Distributed Systems\u2014Concepts and Design","author":"C. Coulouris","year":"2001"},{"key":"5","doi-asserted-by":"crossref","DOI":"10.1109\/ETFA.2001.996374","article-title":"Implementing off-line message scheduling on Controller Area Network (CAN)","author":"R. Dobrin","year":"2001"},{"key":"6","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1109\/CIC.2002.1166765","article-title":"Ambient intelligence and pervasive systems for the monitoring of citizens at cardiac risk: New solutions from the EPI-MEDICS project","volume":"29","author":"F. Gouaux","year":"2002","journal-title":"IEEE Computers in Cardiology"},{"issue":"5","key":"7","first-page":"287","article-title":"Optimization and approximation in deterministic sequencing and scheduling: A survey","volume":"5","author":"R. Graham","year":"1979","journal-title":"Annals of Operations Research"},{"key":"8","first-page":"709","article-title":"Offline architecture for real-time betting","volume":"I","author":"P. Hamalainen","year":"2003"},{"key":"9","doi-asserted-by":"crossref","unstructured":"Harchol-Balter, M., Bansal, N. and Schroeder, B. (2000). Implementation of SRPT scheduling in web servers, <i>Technical Report CMU-CS-00-170<\/i>, Carnegie Mellon School of Computer Science, Pittsburgh, PA.","DOI":"10.1007\/3-540-45540-X_2"},{"issue":"2","key":"10","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s10951-006-0004-6","article-title":"Single processor scheduling with job values depending on their completion times","volume":"10","author":"A. Janiak","year":"2007","journal-title":"Journal of Scheduling"},{"key":"11","first-page":"209","article-title":"Internet-based, GPRS, long-term ECG monitoring and non-linear heart-rate analysis for cardiovascular telemedicine management","volume":"30","author":"S. Khoor","year":"2003","journal-title":"Computers in Cardiology"},{"key":"12","first-page":"43","article-title":"MPI's reduction operations in clustered wide area systems","author":"T. Kielmann","year":"1999"},{"issue":"1","key":"13","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","article-title":"Scheduling algorithms for multiprogramming in a hard real-time environment","volume":"20","author":"C. Liu","year":"1973","journal-title":"Journal of the ACM"},{"key":"14","first-page":"556","article-title":"Scheduling in synchronous networks and the greedy algorithm","volume":"2","author":"K. Lui","year":"1997"},{"key":"15","first-page":"556","article-title":"Simple pools online betting software system\u2014A UML use case analysis","volume":"2","author":"M. Osman","year":"2000"},{"key":"16","first-page":"183","article-title":"Deadline constrained message scheduling in point-to-point interconnection","author":"P. Ramanathan","year":"1991"},{"issue":"2","key":"17","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","article-title":"Various optimizers for single-stage production","author":"W. Smith","year":"1956","journal-title":"Naval Research Logistics"},{"key":"18","first-page":"150","article-title":"Combined routing and scheduling of concurrent communication traffic in hypercube multicomputers","author":"B. Tsai","year":"1996"},{"key":"19","first-page":"327","article-title":"Communication performance optimization for mobile agent system","author":"B. Yang","year":"2002"},{"key":"20","first-page":"30","article-title":"The videotex hot line lottery-ticket-buying solution based on mobile GPRS system","author":"X. Xu","year":"2008"},{"key":"21","first-page":"1617","article-title":"Heavy tails, generalized coding and optimal web layout","volume":"3","author":"X. Zhu","year":"2001"}],"container-title":["International Journal of Applied Mathematics and Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/content.sciendo.com\/view\/journals\/amcs\/20\/2\/article-p391.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/view\/j\/amcs.2010.20.issue-2\/v10006-010-0029-z\/v10006-010-0029-z.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T10:27:45Z","timestamp":1709202465000},"score":1,"resource":{"primary":{"URL":"https:\/\/content.sciendo.com\/doi\/10.2478\/v10006-010-0029-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,1]]},"references-count":21,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.2478\/v10006-010-0029-z","relation":{},"ISSN":["1641-876X"],"issn-type":[{"value":"1641-876X","type":"print"}],"subject":[],"published":{"date-parts":[[2010,6,1]]}}}