The Lens Interconnection Strategy

Raphael A. Finkel; Marvin H. Solomon

doi:10.1109/TC.1981.1675735

The Lens Interconnection Strategy

Raphael A. Finkel, Marvin H. Solomon

Computer Science

Research output: Contribution to journal › Article › peer-review

22 Scopus citations

Abstract

In this paper we describe a new family of topologies for interconnecting many identical processors to form an MIMD multiprocessor. It extends to arbitrarily many processors while keeping the number of neighbors of any one processor fixed. We show that this family behaves very well with respect to uniformity of bus load, simplicity of routing algorithms, and distance between processors.

Original language	English
Pages (from-to)	960-965
Number of pages	6
Journal	IEEE Transactions on Computers
Volume	C-30
Issue number	12
DOIs	https://doi.org/10.1109/TC.1981.1675735
State	Published - Dec 1981

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture
Computational Theory and Mathematics

Access to Document

10.1109/TC.1981.1675735

Cite this

@article{d144a62b36ed4074b17d08c7c396bc01,

title = "The Lens Interconnection Strategy",

abstract = "In this paper we describe a new family of topologies for interconnecting many identical processors to form an MIMD multiprocessor. It extends to arbitrarily many processors while keeping the number of neighbors of any one processor fixed. We show that this family behaves very well with respect to uniformity of bus load, simplicity of routing algorithms, and distance between processors.",

author = "Finkel, {Raphael A.} and Solomon, {Marvin H.}",

year = "1981",

month = dec,

doi = "10.1109/TC.1981.1675735",

language = "English",

volume = "C-30",

pages = "960--965",

number = "12",

}

TY - JOUR

T1 - The Lens Interconnection Strategy

AU - Finkel, Raphael A.

AU - Solomon, Marvin H.

PY - 1981/12

Y1 - 1981/12

N2 - In this paper we describe a new family of topologies for interconnecting many identical processors to form an MIMD multiprocessor. It extends to arbitrarily many processors while keeping the number of neighbors of any one processor fixed. We show that this family behaves very well with respect to uniformity of bus load, simplicity of routing algorithms, and distance between processors.

AB - In this paper we describe a new family of topologies for interconnecting many identical processors to form an MIMD multiprocessor. It extends to arbitrarily many processors while keeping the number of neighbors of any one processor fixed. We show that this family behaves very well with respect to uniformity of bus load, simplicity of routing algorithms, and distance between processors.

UR - http://www.scopus.com/inward/record.url?scp=0019659174&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0019659174&partnerID=8YFLogxK

U2 - 10.1109/TC.1981.1675735

DO - 10.1109/TC.1981.1675735

M3 - Article

AN - SCOPUS:0019659174

SN - 0018-9340

VL - C-30

SP - 960

EP - 965

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

IS - 12

ER -

The Lens Interconnection Strategy

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this