Scheduling for flow-time with admission control

DOI10.1007/B13632zbMATH Open1266.68067OpenAlexW1827234103MaRDI QIDQ5897233FDOQ5897233

Authors: N. Bansal, Shuchi Chawla, Kedar Dhamdhere, Avrim Blum 

Publication date: 3 March 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b13632

Recommendations

• scientific article; zbMATH DE number 5999563
• Scheduling for weighted flow time and energy with rejection penalty
• Non-preemptive flow-time minimization via rejections
• Rejecting jobs to Minimize Load and Maximum Flow-time
• Online scheduling with preemption or non-completion penalties

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (7)

• Online scheduling FIFO policies with admission and push-out
• Statistical admission control for real-time services under earliest deadline first scheduling
• Exact admission-control for integrated aperiodic and periodic tasks
• Minimizing average flow-time under knapsack constraint
• Bin packing with rejection revisited
• Non-preemptive flow-time minimization via rejections
• Rejecting jobs to minimize load and maximum flow-time

This page was built for publication: Scheduling for flow-time with admission control

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897233)