scientific article; zbMATH DE number 1107721

MaRDI QIDQ4373669zbMATH OpenFDO

Authors Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stéphane Pérennes

Publication date 27 September 1998

zbMATH Keywords

acyclic orientation of a graphparallel algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Deadlock prevention by acyclic orientations
• Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms
• Static deadlock prevention in dynamically configured communication networks
• scientific article; zbMATH DE number 749818
• Optimal Turn Prohibition for Deadlock Prevention in Networks With Regular Topologies
• A generic design methodology for deadlock-free routing in multicomputer networks
• Optimization aspects of deadlock prevention in packet-switching networks
• Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings

Cited in

(4)

• Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing
• Deadlock prevention by acyclic orientations
• Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms
• Acyclic orientations with path constraints

This page was built for publication:

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