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

DOI10.2478/v10006-010-0029-zzbMath1231.68101OpenAlexW2085288436MaRDI QIDQ3587069

Jan Werewka, Adam Piórkowski

Publication date: 2 September 2010

Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/207995

zbMATH Keywords

distributed systemsreal-time systemsmessage schedulingmessage queuing

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (5)

A discrete-time queueing system with changes in the vacation times ⋮ Modeling message queueing services with reliability guarantee in cloud computing environment using colored Petri nets ⋮ A finite-buffer queue with a single vacation policy: an analytical study with evolutionary positioning ⋮ A discrete-time system with service control and repairs ⋮ An arriving decision problem in a discrete-time queueing system

Cites Work

• Unnamed Item
• Unnamed Item
• Single processor scheduling with job values depending on their completion times
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: Minimization of the total completion time for asynchronous transmission in a packet data-transmission system