Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 222,876,860 papers from all fields of science
Search
Sign In
Create Free Account
Clos network
Known as:
Clos
, Beneš network
, Benes network
Expand
In the field of telecommunications, a Clos network is a kind of multistage circuit switching network, first formalized by Charles Clos in 1952, which…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
Circuit switching
Crossbar switch
Fat tree
Hall's marriage theorem
Expand
Broader (2)
Network topology
Networking hardware
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2007
Review
2007
SINDBAD : a realistic multi-purpose and scalable X-ray si mulation tool for NDT applications
J. Tabary
,
P. Hugonnard
,
F. Mathy
2007
Corpus ID: 16488870
The X-ray radiographic simulation software SINDBAD, has been developed to help the design stage of radiographic systems or to…
Expand
Review
1998
Review
1998
Architectural choices in large scale ATM switches
J. Turner
,
N. Yamanaka
1998
Corpus ID: 9218195
The rapid development of Asynchronous Transfer Mode technology in the last 10-15 years has stimulated renewed interest in the…
Expand
Highly Cited
1993
Highly Cited
1993
Quantitative Modeling of Complex Computational Task Environments
Keith S. Decker
,
V. Lesser
AAAI Conference on Artificial Intelligence
1993
Corpus ID: 14575259
Formal approaches to specifying how the mental state of an agent entails that it perform particular actions put the agent at the…
Expand
1992
1992
An object-oriented refinement calculus with modular reasoning
Barry Mark Utting
1992
Corpus ID: 61202181
In this thesis, the refinement calculus is extended to support a variety of object-oriented programming styles. The late binding…
Expand
Highly Cited
1991
Highly Cited
1991
On Self-Routing in Benes and Shuffle-Exchange Networks
C. Raghavendra
,
R. Boppana
IEEE Trans. Computers
1991
Corpus ID: 20139802
The authors present self-routing algorithms for realizing the class of linear permutations in various multistage networks such as…
Expand
1990
1990
Fault-tolerant routing in MIN-based supercomputers
S. Chalasani
,
C. Raghavendra
,
A. Varma
Proceedings SUPERCOMPUTING '90
1990
Corpus ID: 17375243
The authors study methods for routing data in supercomputers that use multistage interconnection networks (MINs) in the presence…
Expand
1988
1988
The common Lisp object system metaobject kernel: a status report
D. Bobrow
,
G. Kiczales
LISP and Functional Programming
1988
Corpus ID: 6864662
The metaobject kernel of the Common Lisp Object System (CLOS) comprises the classes and methods that define and implement the…
Expand
Highly Cited
1987
Highly Cited
1987
A New Benes Network Control Algorithm
Kyungsook Y. Lee
IEEE Trans. Computers
1987
Corpus ID: 32221797
A new Benes network control algorithm is presented. Unlike the original looping algorithm, the new algorithm is not recursive. In…
Expand
Highly Cited
1985
Highly Cited
1985
On the Rearrangeability of 2(log2N) - 1 Stage Permutation Networks
Kyungsook Y. Lee
IEEE Trans. Computers
1985
Corpus ID: 42272624
For any parallel computer systems which consist of many processing elements and memories, interconnection networks provide…
Expand
Highly Cited
1981
Highly Cited
1981
A Self-Routing Benes Network and Parallel Permutation Algorithms
David Nassimi
,
S. Sahni
IEEE transactions on computers
1981
Corpus ID: 10976982
A Benes permutation network capable of setting its own switches dynamically is presented. The total switch setting and delay time…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE