Isaac D. Scherson and Chi-Kai Chien Department of Information and Computer...  Home/Search
Context Related
| uci.edu/~schark/lcans.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uci.edu/~schark/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Least Common Ancestor Networks (LCANs) are introduced and shown to be a class of networks that include fat-trees, baseline networks, SW-banyans and the router networks of the TRAC 1.1 and 2.0, and the CM-5. Some LCAN properties are stated and the permutation routing capabilities of an important subclass are analyzed. Simulation results for three permutation classes verify the accuracy of an iterative solution for a randomized routing strategy. 1 (Update)
Context of citations to this paper: More
.... Architectures using unidirectional multistage interconnection networks (MINs) and bidirectional MINs (bidi MINs) or fat tree networks [16, 29] fall into this category. In such networks, the regular pattern of interconnection between switches allows for simple routing...
...extensively. Architectures using unidirectional multistage interconnection networks (MINs) and bidirectional MINs or fat tree networks [19, 34] fall into this category. In such networks, the regular pattern of interconnection between switches allows for simple routing...
Cited by: More
Nearest Common Ancestors: A survey and a new.. - Alstrup, Gavoille.. (2002) (Correct)
Adaptive Routing on the New Switch Chip for IBM SP.. - Abali, Stunkel.. (Correct)
Performance Evaluation of Switch-Based Wormhole Networks - Lionel Ni Fellow (1995) (Correct)
Active bibliography (related documents): More All
0.5: An Operating System Framework for Large Parallel.. - Scherson.. (Correct)
0.5: Periodic Gossiping in Back-To-Back Trees - Labahn, Raspaud (1996) (Correct)
0.1: An Algebraic Theory for Regular Data Mappings on Parallel.. - Munthe-Kaas (1995) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.0: An Analytical Model of Packet-Switching Finite-Buffered Multistage .. - Nwosu (Correct)
0.0: Reconfiguration With Time Division Multiplexed MINs for.. - Qiao (1994) (Correct)
0.0: Varieties of Lattices - Jb (Correct)
Related documents from co-citation: More All
11: The SP2 High-Performance Switch (context) - Stunkel, Shea et al. - 1995
6: Efficient Broadcast and Multicast on Multistage Interconnection Networks using M.. - Sivaram, Panda et al. - 1996
5: The network architecture of the connection machine CM - Leiserson - 1992
BibTeX entry: (Update)
I. D. Scherson and C. H. Chien. Least common ancestor networks. In Proc. 7th Int. Parallel Processing Symp., pages 507--513, 1993. BIBLIOGRAPHY 64 http://citeseer.ist.psu.edu/scherson93least.html More
@inproceedings{ scherson93least,
author = "Isaac D. Scherson and Chi-Kai Chien",
title = "Least Common Ancestor Networks",
booktitle = "International Parallel Processing Symposium",
pages = "507-513",
year = "1993",
url = "citeseer.ist.psu.edu/scherson93least.html" }
Citations (may not include all citations):981 Introduction to parallel algorithms and architectures: array.. (context) - Leighton - 1992
164 The network architecture of the connection machine CM - Leiserson - 1992
156 Fat trees: Universal networks for hardware-efficient superco.. (context) - Leiserson - 1985
136 Fast algorithms for finding nearest common ancestors (context) - Harel, Tarjan - 1984
127 Highly parallel computing (context) - Almasi, Gottlieb - 1989
113 Computer architecture and parallel processing (context) - Hwang, Briggs - 1984
95 On finding lowest common ancestors: simplification and paral.. (context) - Schieber, Vishkin - 1988
88 A study of non-blocking switching networks (context) - Clos - 1953
79 Mathematical theory of connecting networks and telephone tra.. (context) - Benes - 1965
58 Interconnection networks for largescale parallel processing (context) - Siegel - 1985
57 A survey of interconnection networks (context) - Feng - 1981
46 a class of multistage interconnection networks (context) - Wu, Feng - 1980
24 A self-routing Benes network and parallel permutation algori.. (context) - Nassimi, Sahni - 1981
10 Parallel permutations of data: A Benes network control algor.. (context) - Lenfant - 1978
2 MasPar Computer Corporation (context) - Blank, Tuck et al. - 1991
2 The KYKLOS multicomputer network: Interconnection strategies (context) - Menezes, Jenevein - 1991
1 Personal communication (context) - Alleyne - 1993
1 Malek Parallel computing (context) - Lipovski - 1987
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ics.uci.edu/~schark/): More
Rate of Change Load Balancing in Distributed and Parallel.. - Luis Miguel Campos (Correct)
A Lower Bound for Dynamic Scheduling of Data Parallel Programs - Fabricio Alves Barbosa (Correct)
Bounds on Gang Service Scheduling - Silva, Scherson (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC