A block algorithm for the algebraic path problem and its execution on a systolic array

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/108138

Title:	A block algorithm for the algebraic path problem and its execution on a systolic array
Author:	Núñez, Fernando J.; Valero Cortés, Mateo
Other authors:	Universitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors; Facultat d'Informàtica de Barcelona; Universitat Politècnica de Catalunya. CAP - Grup de Computació d'Altes Prestacions
Abstract:	The solution of the algebraic path problem (APP) for arbitrarily sized graphs by a fixed-size systolic array processor (SAP) is addressed. The APP is decomposed into two subproblems, and SAP is designed for each one. Both SAPs combined produce a highly implementable versatile SAP. The proposed SAP has p*p processing elements (PEs) solving the APP of an N-vertex graph in N/sup 3//p/sup 2/+N/sup 2//p+3p-2 cycles. With slight modifications in the operations performed by the PEs, the problem is optimally solved in N/sup 3//p/sup 2/+3p-2 cycles.
Abstract:	Peer Reviewed
Subject(s):	-Àrees temàtiques de la UPC::Informàtica::Arquitectura de computadors -Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica -Parallel algorithms -Computational complexity -Graph theory -Cellular arrays -Algorismes paral·lels -Complexitat computacional -Grafs, Teoria de
Rights:
Document type:	Article - Published version Conference Object
Published by:	Institute of Electrical and Electronics Engineers (IEEE)
Share: