Online scheduling FIFO policies with admission and push-out
From MaRDI portal
(Redirected from Publication:255276)
Recommendations
- scientific article; zbMATH DE number 1947443
- On-line scheduling revisited
- Preemptive online algorithms for scheduling
- Scheduling for flow-time with admission control
- Preemptive online scheduling with reordering
- Preemptive Online Scheduling with Reordering
- Online scheduling of equal-processing-time task systems
- scientific article; zbMATH DE number 7051282
- Online scheduling of packets with agreeable deadlines
Cites work
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 1559527 (Why is no real title available?)
- An improved algorithm for CIOQ switches
- Best effort and priority queuing policies for buffered crossbar switches
- Buffer Overflow Management in QoS Switches
- Competitive queue policies for differentiated services
- FIFO queueing policies for packets with heterogeneous processing
- Improved competitive performance bounds for CIOQ switches
- Job-shop scheduling with limited capacity buffers
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Lower and upper bounds on FIFO buffer management in QoS switches
- Maximizing throughput in multi-queue switches
- Nonclairvoyant scheduling
- Online Scheduling to Minimize Average Stretch
- Optimal smoothing schedules for real-time streams
- Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
- Predictive scheduling of network processors.
- The hybrid flow shop scheduling problem
Cited in
(3)
This page was built for publication: Online scheduling FIFO policies with admission and push-out
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q255276)