scientific article; zbMATH DE number 2086672

MaRDI QIDQ4737209zbMATH OpenFDO

Authors Leah Epstein, J. Noga, Jiří Sgall, Rob van Stee, Tomáš Tichý, Nodari Vakhania, Marek Chrobak

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2380/23800800.htm

Mathematics Subject Classification ID

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

Recommendations

• Preemptive scheduling in overloaded systems.
• scientific article; zbMATH DE number 6157244
• scientific article; zbMATH DE number 1487943
• Preemptive Scheduling of Uniform Processor Systems
• Preemptive scheduling with finite capacity input buffers
• Rational preemptive scheduling
• Preemptive scheduling with deadlines on parallel machines
• On the Value of Preemption in Scheduling
• Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness

Cited in

(9)

• Preemptive scheduling in overloaded systems.
• An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources
• A tighter extra-resource analysis of online deadline scheduling
• Online scheduling with partial job values: does timesharing or randomization help?
• New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling
• On the Value of Preemption in Scheduling
• scientific article; zbMATH DE number 1263237 (Why is no real title available?)
• scientific article; zbMATH DE number 6157244 (Why is no real title available?)
• Scheduling search procedures: The wheel of fortune

This page was built for publication:

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