See this document in CiteSeerX!

Practical Algorithms for Online Routing on SIMD Meshes (1991)  (Make Corrections)  
Martin C. Herbordt, James C. Corbett, Charles C. Weems, John Spalding



  Home/Search   Context   Related

 
View or download:
umass.edu/pub/techr...UMCS1991063.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  mat.uc.pt/~rps/papers/routing (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: : The problem of online routing on SIMD meshes arises when these processors are used for real-time analysis of sensory input. Existing algorithms---ones not making unrealistic hardware assumptions---use sorting as a subroutine and so, while asymptotically optimal, have running times at least 3 times greater (for likely array sizes) than the lower bound of 4n \Gamma 4 communication steps. Dedicated router networks address this problem, but are costly and not available on all processors. We... (Update)

Similar documents (at the sentence level):
11.5%:   Message-Passing Algorithms for a SIMD Torus with Coteries - Herbordt, Weems, Corbett   (Correct)

Active bibliography (related documents):   More   All
1.2:   The Evaluation Of Massively Parallel Array Architectures - Herbordt (1994)   (Correct)
1.1:   A Computational Framework and SIMD Algorithms for.. - Herbordt, Weems, Scudder (1991)   (Correct)
0.8:   General Routing on the Lowest Level of the Image.. - Herbordt, Weems, Shu (1990)   (Correct)

Similar documents based on text:   More   All
0.2:   Using Emulations to Enhance the Performance of Parallel.. - Bojana Obreni Martin (1999)   (Correct)
0.2:   Associative, Multiassociative, and Hybrid Processing (Extended .. - Herbordt, al. (1993)   (Correct)
0.2:   Routing and Sorting on Meshes with Row and Column Buses - Suel (1994)   (Correct)

BibTeX entry:   (Update)

@techreport{ herbordt91practical,
    author = "M. Herbordt and J. Corbett and C. Weems and J. Spalding",
    title = "Practical Algorithms For Online Routing on {SIMD} Meshes",
    number = "UM-CS-1991-063",
    month = ",",
    year = "1991",
    url = "citeseer.ist.psu.edu/175945.html" }
Citations (may not include all citations):
286   The Connection Machine (context) - Hillis - 1985
223   Virtual Cut-Through: A New Computer Communication Switching .. (context) - Kermani, Kleinrock - 1979
149   Multicomputers: Message Passing Concurrent Computers (context) - Athas, Seitz - 1988
76   The Image Understanding Architecture (context) - Weems, Levitan et al. - 1989
74   Design of the Massively Parallel Processor (context) - Batcher - 1980
72   An Optimal Sorting Algorithm for Mesh Connected Computers (context) - Schnorr, Shamir - 1986
69   Average Case Analysis of Greedy Routing Algorithms on Arrays (context) - Leighton - 1990
66   Data Broadcasting in SIMD Computers (context) - Nassimi, Sahni - 1981
48   Meshes With Reconfigurable Buses (context) - Miller, Prasanna et al. - 1988
42   Fast Algorithms for Bit-Serial Routing on a Hypercube - Aiello, Leighton et al. - 1990
36   Connection Machine Model CM-2 Technical Summary (context) - Corporation - 1987
30   Polymorphic Torus Network (context) - Li, Maresca - 1989
27   An Optimal Routing Algorithm for Mesh-Connected Parallel Com.. (context) - Nassimi, Sahni - 1980
23   Gamma 2 Step Algorithm for Routing in an n \Theta n Array Wi.. (context) - Leighton, Makedon et al. - 1989
21   BLITZEN: A Highly Integrated Massively Parallel Machine (context) - Blevins, Davis et al. - 1990
19   Algorithmic Techniques for Computer Vision on a Fine-Grained.. (context) - Little, Blelloch et al. - 1989
17   A Unified Approach to Off-line Permutation Routing on Parall.. (context) - Annexstein, Baumslag - 1990
14   The Illiac IV System (context) - Bouknight, Denenberg et al. - 1972
14   Lower Bounds for Sorting on Mesh-Connected Architectures (context) - Kunde - 1987
14   The Distance Bound for Sorting on Mesh-Connected Processor A.. (context) - Ma, Sen et al. - 1986
12   Systolic Sorting on a Mesh-Connected Network (context) - Lang, Schimmler et al. - 1985
12   The Image Understanding Architecture and its Programming Env.. (context) - Weems, Burrill - 1991
10   Permutations on Illiac IV-Type Networks (context) - Raghavendra, Prasanna - 1986
10   Deadlock Free Routing in Multiprocessor Interconnection Netw.. (context) - Dally, Seitz - 1987
9   An Efficient Implementation of Batcher's Odd-Even Merge Algo.. (context) - Kumar, Hirschberg - 1983
9   The Illinois Pattern Recognition Computer -- ILLIAC III (context) - McCormick - 1963
9   Non-Uniform Region Processing on SIMD Arrays Using the Coter.. (context) - Herbordt, Weems et al. - 1991
8   Universal Schemes for Parallel Computation (context) - Valiant, Brebner - 1981
7   The ICL DAP and its application to image processing (context) - Hunt - 1981
7   Message Passing Algorithms for a SIMD Torus with Coteries - Herbordt, Weems et al. - 1990
6   Review of the CLIP image processing system (context) - Duff - 1978
5   Sorting on a Mesh Connected Computer (context) - Thompson, Kung - 1977
4   A Feedback Concentrator for the Image Understanding Architec.. (context) - Rana, Weems - 1990
3   Spring Joint Computer Conf (context) - Batcher - 1968
2   MasPar MP-1 Principles of Operation (context) - Corporation - 1990
2   Parallel Routing and Sorting on Mesh-Connected Processor Arr.. (context) - Kunde - 1988
2   Implementation of Permutation Functions in Illiac IV-Type Co.. (context) - Orcutt - 1976
1   Interconnections for Parallel Memories to Unscramble p-Order.. (context) - Swanson - 1974

Documents on the same site (http://www.mat.uc.pt/~rps/papers/routing.html):   More
SHADE: Technology for Knowledge-Based Collaborative Engineering - McGuire, Kuokka, al. (1993)   (Correct)
On the pathwise optimal Bernoulli routing policy for homogeneous.. - Koole (1994)   (Correct)
Deadlock Free Routing on a Ring: A Performance Evaluation - Liu, Mussi (1994)   (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