Critical Load Factors in Two-Processor Distributed Systems

DOI10.1109/TSE.1978.231502MaRDI QIDQ4158484zbMATH OpenOpenAlexFDO

Authors Harold S. Stone

Publication date 1978

Published in IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tse.1978.231502

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45) Deterministic network models in operations research (90B10) Algorithms in computer science (68W99)

Cited in

(14)

• The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
• Structural and algorithmic properties for parametric minimum cuts
• Optimal task assignment with precedence in distributed computing systems
• On approximating the memory-constrained module allocation problem
• Partitioning multiple-chain-like task across a host-satellite system
• Efficient algorithms for robustness in resource allocation and scheduling problems
• A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem
• Generalization of a theorem on the parametric maximum flow problem
• Analysis of the effects of system parameters on load balancing
• Parametric stable marriage and minimum cuts
• A fast algorithm for the generalized parametric minimum cut problem and applications
• Ordered optimal solutions and parametric minimum cut problems
• Approximating the Minimum Chain Completion problem
• Load balancing: An exercise in constrained convergence

This page was built for publication: Critical Load Factors in Two-Processor Distributed Systems

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