Scheduling of the dag associated with pipeline inversion of triangular matrices

Parallel Processing Letters

Volumn 6, Issue 1, 1996, Pages 13-26

  Tchuente, Maurice ^a  

^a Déparlement d'Informatique   (Germany)

Author keywords

Allocation function; Earliest and latest optimal timing functions; Folding; Scheduling; Systolic arrays; Triangular matrix inversion

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; INVERSE PROBLEMS; MATRIX ALGEBRA; PIPELINE PROCESSING SYSTEMS; SCHEDULING; SYSTOLIC ARRAYS;

ALLOCATION FUNCTION; DEPENDENCE GRAPH; OPTIMAL TIMING FUNCTIONS; TRIANGULAR MATRIX INVERSION;

COMPUTATIONAL METHODS;

EID: 0030092442     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1142/s0129626496000030     Document Type: Article

References (3)

1. Delosme, J. M. Algorithms for finite shift-rank processes. Technical Report M735-22, Stanford University.
2. Quinton, P. Automatic synthesis of systolic arrays from uniform recurrence equations. In Proc. IEEE 11th International Conference on Computer Architecture, Ann Arbor, MI, pp. 208-214.
3. Moldovan, D. I. On the analysis and synthesis of VLSI algorithms. IEEE Transactions on Computers, C-31, 11, pp. 1121-1126.