Deadlock-freeness of hexagonal systolic arrays

DOI10.1016/J.IPL.2010.04.021MaRDI QIDQ765473zbMATHOpenAlexFDO

Authors D. Kharzeev

Publication date 19 March 2012

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

Full work available at URL https://doi.org/10.1016/j.ipl.2010.04.021

zbMATH Keywords

parallelismparallel processingsystolic arraydeadlockRoscoe-Dathi method

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Network design and communication in computer systems (68M10)

Recommendations

• Deadlock avoidance for systolic communication
• The pursuit of deadlock freedom
• Deadlock-free message routing in multicomputer networks
• A fault-tolerant hexagonal systolic array
• Publication:3792219

Cites work

• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 2061713 (Why is no real title available?)
• scientific article; zbMATH DE number 1418468 (Why is no real title available?)
• Deadlock avoidance for systolic communication
• The pursuit of deadlock freedom

Cited in

(1)

• Deadlock avoidance for systolic communication

Describes a project that uses

Uses Software

• CSP-prover

This page was built for publication: Deadlock-freeness of hexagonal systolic arrays

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