Understanding algorithm performance on an oversubscribed scheduling application

MaRDI QIDQ3624043zbMATH OpenFDO

Authors Laura Barbulescu, Adele E. Howe, L. Darrell Whitley, Mark Roberts

Publication date 28 April 2009

Full work available at URL https://arxiv.org/abs/1110.2735

zbMATH Keywords

algorithm performance

Mathematics Subject Classification ID

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

Recommendations

• Scheduling space-ground communications for the air force satellite control network
• Scheduling space-ground communications for the air force satellite control network
• AFSCN scheduling: how the problem and solution have evolved
• How to make OR-results available: A proposal for project scheduling
• Three scheduling algorithms applied to the Earth observing systems domain

Cited in

(1)

• High-performance technique for satellite range scheduling

This page was built for publication: Understanding algorithm performance on an oversubscribed scheduling application

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