scientific article
From MaRDI portal
Publication:2921743
zbMath1297.68043MaRDI QIDQ2921743
Jay Sethuraman, Fei Li, Clifford Stein
Publication date: 13 October 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Related Items (16)
A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines ⋮ A comprehensive study of an online packet scheduling algorithm ⋮ Online packet scheduling with bounded delay and lookahead ⋮ The loss of serving in the dark ⋮ Collecting weighted items from a dynamic queue ⋮ Scheduling packets with values and deadlines in size-bounded buffers ⋮ Online buffer management for transmitting packets with processing cycles ⋮ An optimal lower bound for buffer management in multi-queue switches ⋮ Comparison-based buffer management in QoS switches ⋮ Improved randomized online scheduling of intervals and jobs ⋮ Buffer management for colored packets with deadlines ⋮ A universal randomized packet scheduling algorithm ⋮ Increasing Machine Speed in On-Line Scheduling of Weighted Unit-Length Jobs in Slotted Time ⋮ Randomized competitive algorithms for online buffer management in the adaptive adversary model ⋮ An optimal algorithm for 2-bounded delay buffer management with lookahead ⋮ Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers
This page was built for publication: