A deadlock-free communication kernel for loop architecture

DOI10.1016/0020-0190(91)90239-EMaRDI QIDQ1178215zbMATH OpenOpenAlexFDO

Authors S. Singh

Publication date 26 June 1992

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(91)90239-e

zbMATH Keywords

deadlock preventiondistributed operating systemmessage-passing multiprocessorsparallel processing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Theory of operating systems (68N25)

Recommendations

• Deadlock-free message routing in multicomputer networks
• Deadlock avoidance for systolic communication
• A deadlock free and starvation free network of packet switching communication processors
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
• Deadlock-free routing in k-ary hypercube network in presence of processor failures

Cites work

• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
• Fault-tolerant and flexible interconnection of multiple processors

This page was built for publication: A deadlock-free communication kernel for loop architecture

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