logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Analysis of permutation routing algorithms

delete2000-09-01
delete1
PRE
AI
J
József Békési
G
Gábor Galambos *
P
Peter I. Hajnal
DOI：10.1016/S0377-2217(99)00455-5delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In this paper we analyze some permutation routing algorithms for different kinds of mesh architectures. First we give lower and upper bounds for the expected number of steps of the basic greedy algorithm on linear and two-dimensional arrays without bus. Finally we present lower bounds for the number of steps of arbitrary on-line or off-line algorithms on rectangular meshes with buses. (C) 2000 Elsevier Science B.V. All rights reserved.
Keywords:
parallel processing
network communication
analysis of algorithms
mesh architecture
permutation routing
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

European Journal of Operational Research cover
European Journal of Operational Research
IF:
6
Papers:
2.2W
Citations:
6.4W

Organization

No organization information available