Skip Navigation

The Computer Journal 1990 33(6):562-569; doi:10.1093/comjnl/33.6.562
© 1990 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Megson, G. M.
Right arrow Articles by Evans, D. J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A Systolic Array Solution for the Assignment Problem

G. M. Megson1 * and D. J. Evans2 § ¶

1 Computing Laboratory, University of Newcastle upon Tyne, UK, 2 Parallel Algorithms Research Centre, Loughborough University of Technology, Loughborough, Leicestershire, UK

A systolic array for the solution of the assignment problem is presented. The algorithm requires O(n2) time and an orthogonally connected array of (n+2)*(n+2) cells consisting of simple adders and control logic. The design is area-efficient and incorporates the new concept of a Systolic Control Ring (SCR) to generate the necessary systolic wavefronts in any orientation within the design, while special cells are positioned only on the periphery of the design.

The resulting Assignment Problem Iteration (API) is suitable for Wafer Scale integration using only single input and output for data permitting low bandwidth.

Received April 1987. revised July 1990.

* Computing Laboratory, University of Newcastle upon Tyne

§ Parallel Algorithms Research Centre, Loughborough University of Technology, Loughborough, Leicestershire

To whom corespondence should be addressed


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.