scientific article; zbMATH DE number 910880

MaRDI QIDQ4886054zbMATH OpenFDO

Authors Amotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Madhu Sudan

Publication date 13 October 1996

zbMATH Keywords

access and flow-controlconflict graphwireless networks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Guaranteeing Fair Service to Persistent Dependent Tasks
• scientific article; zbMATH DE number 871903
• Minimizing migrations in fair multiprocessor scheduling of persistent tasks
• Scheduling with conflicts on bipartite and interval graphs
• Probabilistic analysis for scheduling with conflicts

Cited in

(6)

• On chromatic sums and distributed resource allocation
• Scheduling algorithms for conducting conflict-free measurements in overlay networks
• On Scheduling Policies for Streams of Structured Jobs
• Guaranteeing Fair Service to Persistent Dependent Tasks
• Quantitatively fair scheduling
• Probabilistic analysis for scheduling with conflicts

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