Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
research
oaioai:upcommons.upc.edu:2117/108138

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

Authors
Publication date
1 January 1989
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Doi

    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.Peer ReviewedPostprint (published version

    Similar works

    Full text

    thumbnail-image

    UPCommons. Portal del coneixement obert de la UPC

    redirect
    oaioai:upcommons.upc.edu:2117/108...
    Last time updated on 12/10/2017

    This paper was published in UPCommons. Portal del coneixement obert de la UPC.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.