On mapping processes to processors in distributed systems

DOI10.1007/BF01408172zbMath0632.68029OpenAlexW2052162800MaRDI QIDQ1095652

Yaron Wolfstahl, Shlomit S. Pinter

Publication date: 1987

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01408172

zbMATH Keywords

mappinggraph coveringparallel programsnetworks of processorsnetwork computersoptimal path cover

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (11)

On the \(k\)-path cover problem for cacti ⋮ Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow ⋮ Differential approximation results for the traveling salesman and related problems ⋮ Path covering problems and testing of printed circuits ⋮ Parameterizing path partitions ⋮ An efficient algorithm to construct disjoint path covers of DCell networks ⋮ Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs ⋮ Optimal covering of cacti by vertex-disjoint paths ⋮ Finding a minimum path cover of a distance-hereditary graph in polynomial time ⋮ An approximation algorithm for the asymmetric travelling salesman problem with distances one and two ⋮ Solving the path cover problem on circular-arc graphs by using an approximation algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Quotient Networks
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Augmentation Problems
• Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
• Optimal Sorting Algorithms for Parallel Computers

This page was built for publication: On mapping processes to processors in distributed systems