Deadlock avoidance for systolic communication

DOI10.1016/0885-064X(88)90023-4zbMATH Open0647.68029MaRDI QIDQ1104743FDOQ1104743

Authors: H. T. Kung 

Publication date: 1988

Published in: Journal of Complexity (Search for Journal in Brave)

Recommendations

• Deadlock-freeness of hexagonal systolic arrays
• Optimal centralized algorithms for store-and-forward deadlock avoidance
• Deadlock-free message routing in multicomputer networks
• scientific article; zbMATH DE number 3926230
• Prevention of deadlocks in parallel programs of multiprocessor machines

zbMATH Keywords

deadlock avoidanceparallel processing systemqueue bufferingsystolic communication model

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Grammars and rewriting systems (68Q42) Theory of operating systems (68N25)

Cited In (4)

• Dealing with final state sensitivity for synchronous communication
• Title not available (Why is that?)
• Deadlock-freeness of hexagonal systolic arrays
• Title not available (Why is that?)

This page was built for publication: Deadlock avoidance for systolic communication

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