A Systolic Array for the Assignment Problem

Authors:
U. Schwiegelshohn;L. Thiele
Affiliations:
Technical Univ., Munich, W. Germany;Technical Univ., Munich, W. Germany
Venue:
IEEE Transactions on Computers
Year:
1988

Citing 2
Cited 0

A Theorem on Boolean Matrices

Journal of the ACM (JACM)
Algorithm 97: Shortest path

Communications of the ACM

Quantified Score

Hi-index	14.98

Visualization

Abstract

A pure systolic realization of an algorithm for solving the n*n assignment problem is presented. This systolic algorithm can be implemented on an homogeneous hexagonal processor array and requires O(n/sup 2/) area complexity and O(n/sup 2/) time complexity.