Processor Reordering Rules

DOI10.1017/S0269964800001534MaRDI QIDQ3415965zbMATH OpenFDO

Authors Sheldon M. Ross

Publication date 19 January 2007

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0269964800001534

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Network protocols (68M12) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36)

Recommendations

• scientific article; zbMATH DE number 480526
• scientific article; zbMATH DE number 3856448
• Probabilistic Analysis of a Machine Scheduling Problem
• Scheduling jobs on heterogeneous processors
• Applying POS(i) rules to communication problems

Cites work

• A counterexample to a conjecture on optimal list ordering
• Optimal list order under partial memory constraints
• Reordering heuristics for routing in communications networks
• Two Spectra of Self-Organizing Sequential Search Algorithms

Cited in

(2)

• Reordering heuristics for routing in communications networks
• scientific article; zbMATH DE number 1258209 (Why is no real title available?)

This page was built for publication: Processor Reordering Rules

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