Deadlock-freeness of hexagonal systolic arrays

Authors:
S. Gruner;T. J. Steyn
Affiliations:
Department of Computer Science, University of Pretoria, 0002, South Africa;43 Manning Street, Pretoria, 0083, South Africa
Venue:
Information Processing Letters
Year:
2010

Citing 6
Cited 0

Communicating sequential processes

Communicating sequential processes
The pursuit of deadlock freedom

Information and Computation
Deadlock avoidance for systolic communication

ISCA '88 Proceedings of the 15th Annual International Symposium on Computer architecture
Model checking

Model checking
Why Systolic Architectures?

Computer
On a semantic definition of data independence

TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications

Quantified Score

Hi-index	0.89

Visualization

Abstract

With the re-emergence of parallel computation for technical applications in these days also the classical concept of systolic arrays is becoming important again. However, for the sake of their operational safety, the question of deadlock must be addressed. For this contribution we used the well-known Roscoe-Dathi method to demonstrate the deadlock-freeness of a systolic array with hexagonal connectivity. Our result implies that it is theoretically safe to deploy such arrays on various platforms. Our proof is valid for all cases in which the computational pattern (input-output-behaviour) of the array does not depend on the particular values (contents) of the communicated data.