A Systolic Array for the Assignment ProblemDownload PDFOpen Website

Uwe Schwiegelshohn, Lothar Thiele

Published: 1988, Last Modified: 22 May 2023IEEE Trans. Computers 1988Readers: Everyone
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.<
0 Replies