On mapping processes to processors in distributed systems

DOI10.1007/BF01408172zbMATH Open0632.68029OpenAlexW2052162800MaRDI QIDQ1095652FDOQ1095652

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

Recommendations

• scientific article
• scientific article; zbMATH DE number 795218
• scientific article; zbMATH DE number 279005
• scientific article; zbMATH DE number 3570347
• An approach to parallel algorithm design

zbMATH Keywords

mappinggraph coveringparallel programsnetworks of processorsnetwork computersoptimal path cover

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cites Work

• Title not available (Why is that?)
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Title not available (Why is that?)
• Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
• Augmentation Problems
• Optimal Sorting Algorithms for Parallel Computers
• Quotient Networks

Cited In (17)

• Solving the path cover problem on circular-arc graphs by using an approximation algorithm
• An efficient algorithm to construct disjoint path covers of DCell networks
• Differential approximation results for the traveling salesman and related problems
• Optimal covering of cacti by vertex-disjoint paths
• Title not available (Why is that?)
• On mapping production systems onto multiprocessors
• On the properties of a tree-structured server process
• An approximation algorithm for the asymmetric travelling salesman problem with distances one and two
• Finding a minimum path cover of a distance-hereditary graph in polynomial time
• Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs
• Title not available (Why is that?)
• Parameterizing path partitions
• On the \(k\)-path cover problem for cacti
• Parameterizing path partitions
• Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow
• Path covering problems and testing of printed circuits
• Towards a Visual Definition of a Process in a Distributed Environment

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

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