z-logo
open-access-imgOpen Access
A NOTE ON OFF-LINE PERMUTATION ROUTING ON A MESH-CONNECTED PROCESSOR ARRAY
Author(s) -
Danny Kriz̧anc
Publication year - 1991
Publication title -
parallel processing letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.189
H-Index - 31
eISSN - 1793-642X
pISSN - 0129-6264
DOI - 10.1142/s0129626491000239
Subject(s) - permutation (music) , parallel computing , network packet , computer science , processor array , routing (electronic design automation) , line (geometry) , network processor , combinatorics , mathematics , embedded system , computer network , physics , geometry , acoustics
We show how to off-line route any permutation of an n×n mesh-connected processor array in 2.5n steps with at most two packets per processor per time step and in 2.25n+3 steps with at most four packets per processor per time step.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom