Jonathan F. Buss University of Waterloo  Home/Search
Context
Related
| plg.uwaterloo.ca/~jfbuss/networks.ps 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: plg.uwaterloo.ca/~jfbuss/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Internally monotone networks of processors are defined and discussed. Internally monotone networks are shown to be equivalent to alternating machines, in which the memory-access structure of the alternating machine corresponds to the topology of the network. Hypercubes, butterflies, and k-dimensional meshes occur as special cases. Algorithms written for internally monotone networks are well-suited for implementation on shared-memory machines. 1 Introduction The study of parallel computation... (Update)
Active bibliography (related documents): More All
0.0: Parallel Dynamic Programming - Bradford (1994) (Correct)
0.0: Decision Algorithms for Multiplayer Non-Cooperative Games.. - Peterson, Reif, Azhar (Correct)
0.0: Lower Bounds for Multiplayer Non-Cooperative Games of.. - PETERSON, REIF (Correct)
Similar documents based on text: More All
0.0: Empirical Evaluation of Randomly-Wired Multistage Networks.. - Leighton, al. (1990) (Correct)
0.0: Collecting Butterflies - Jones, Sheeran (1991) (Correct)
0.0: Randomly-Wired Multistage Networks - Maggs (1993) (Correct)
BibTeX entry: (Update)
@inproceedings{ buss90processor,
author = "Jonathan F. Buss",
title = "Processor Networks and Alternating Machines",
booktitle = "{ACM} Symposium on Parallel Algorithms and Architectures",
pages = "103-108",
year = "1990",
url = "citeseer.ist.psu.edu/240999.html" }
Citations (may not include all citations):34 Alternation (context) - Chandra, Kozen et al. - 1981
23 Towards a Complexity Theory of Synchronous Parallel Computat.. (context) - Cook - 1982
18 Alternation and the Computational Complexity of Logic Progra.. (context) - Shapiro - 1984
1 And/Or Programs: a New Approach to Structured Programming (context) - Harel - 1980
1 Simple Universal Parallel Computers Based on Hypercube Inter.. (context) - Ruzzo - 1986
Documents on the same site (http://plg.uwaterloo.ca/~jfbuss/): More
Lower Bounds on Universal Traversal Sequences Based on Chains.. - Buss, Tompa (1995) (Correct)
A Sublinear Space, Polynomial Time Algorithm for Directed - Connectivity Greg Barnes (Correct)
Pattern Matching For Permutations - Bose, Buss, Lubiw (1993) (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