scientific article; zbMATH DE number 1305455

MaRDI QIDQ4252341zbMATH OpenFDO

Authors Kar-Keung To, Tak-Wah Lam

Publication date 17 June 1999

zbMATH Keywords

on-line scheduling of sequential jobs

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• On-line scheduling with tight deadlines.
• Meeting deadlines: how much speed suffices?
• A tighter extra-resource analysis of online deadline scheduling
• Aggressive online deadline scheduling
• Competitive deadline scheduling via additional or faster processors

Cited in

(17)

• On-line scheduling with tight deadlines.
• Resource augmentation in load balancing.
• Applying extra-resource analysis to load balancing.
• The limited-preemptive feasibility of real-time tasks on uniprocessors
• An improved algorithm for online machine minimization
• A constant-approximate feasibility test for multiprocessor real-time scheduling
• Meeting deadlines: how much speed suffices?
• A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
• Time-memory-processor trade-offs
• An O( m)-competitive algorithm for online machine minimization
• Handling critical jobs online: deadline scheduling and convex-body chasing
• Performance guarantee for edf under overload
• Minimizing maximum (weighted) flow-time on related and unrelated machines
• Algorithm Theory - SWAT 2004
• On packet scheduling with adversarial jamming and speedup
• Extra processors versus future information in optimal deadline scheduling
• Optimal on-line algorithms to minimize makespan on two machines with resource augmentation

Describes a project that uses

Uses Software

• MOCA

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 Q4252341)