Critical Load Factors in Two-Processor Distributed Systems
From MaRDI portal
Publication:4158484
DOI10.1109/TSE.1978.231502zbMath0379.68041OpenAlexW2067936976MaRDI QIDQ4158484
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
Formal languages and automata (68Q45) Deterministic network models in operations research (90B10) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items (14)
Efficient algorithms for robustness in resource allocation and scheduling problems ⋮ Optimal task assignment with precedence in distributed computing systems ⋮ On approximating the memory-constrained module allocation problem ⋮ Analysis of the effects of system parameters on load balancing ⋮ Load balancing: An exercise in constrained convergence ⋮ A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem ⋮ Parametric stable marriage and minimum cuts ⋮ A fast algorithm for the generalized parametric minimum cut problem and applications ⋮ Generalization of a theorem on the parametric maximum flow problem ⋮ Structural and algorithmic properties for parametric minimum cuts ⋮ Approximating the Minimum Chain Completion problem ⋮ The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs ⋮ Ordered optimal solutions and parametric minimum cut problems ⋮ Partitioning multiple-chain-like task across a host-satellite system
This page was built for publication: Critical Load Factors in Two-Processor Distributed Systems
