scientific article; zbMATH DE number 1796988

MaRDI QIDQ4551383zbMATH OpenFDO

Authors Ee-Chien Chang, Chee K. Yap

Publication date 5 September 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2108/21080453

Mathematics Subject Classification ID

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

Recommendations

• Competitive on-line scheduling with level of service
• Online scheduling on parallel machines with two goS levels
• Online Scheduling on Parallel Machines with Two GoS Levels
• Competitive video on demand schedulers for popular movies
• Competitive on-line scheduling of continuous-media streams

Cited in

(8)

• Competitive video on demand schedulers for popular movies
• Preemptive scheduling in overloaded systems.
• Competitive on-line scheduling of continuous-media streams
• Online scheduling with partial job values: does timesharing or randomization help?
• Improved competitive algorithms for online scheduling with partial job values
• Online competitive algorithms for maximizing weighted throughput of unit jobs
• Competitive on-line scheduling with level of service
• Online scheduling with increasing subsequence serving constraint

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