Processor Reordering Rules

DOI10.1017/S0269964800001534zbMATH Open1134.90414MaRDI QIDQ3415965FDOQ3415965

Authors: Sheldon M. Ross 

Publication date: 19 January 2007

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Reordering heuristics for routing in communications networks
• Title not available (Why is that?)

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)