See this document in CiteSeerX!

A Combining Mechanism for Parallel Computers (1992)  (Make Corrections)  (22 citations)
Leslie G. Valiant Center for Research in Computing Technology Harvard...
Heinz Nixdorf Symposium



  Home/Search   Context   Related

 
View or download:
harvard.edu/techreport...tr2492.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  indiana.edu/pub/ucstri/index (more)
(Enter author homepages)

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

Abstract: In a multiprocessor computer communication among the components may be based either on a simple router, which delivers messages point-to-point like a mail service, or on a more elaborate combining network that, in return for a greater investment in hardware, can combine messages to the same address prior to delivery. This paper describes a mechanism for recirculating messages in a simple router so that the added functionality of a combining network, for arbitrary access patterns, can be... (Update)

Context of citations to this paper:   More

...through the program, with the required remote communication occurring between supersteps. The BSP computer as described in [18, 39, 40, 41, 50, 51, 52] consists of the following three components. 1 (1) A collection of p processor memory components numbered 0, p 1. It...

.... include the use of routing switches to support hardware combining [9, 27] and algorithmic techniques to support combining in software [31, 13]. The latter method will critically depend on the effectiveness of the combining and the overheads introduced by the software. This...

Cited by:   More
Improved Virtual Leveled Routing Strategy for Meshes - Leppänen   (Correct)
Concurrent Heaps on the BSP Model - Gerbessiotis, Siniolakis (1996)   (Correct)
Scalable and Portable Computing Using the WPRAM Model - Nash, Dew, Dyer (1996)   (Correct)

Active bibliography (related documents):   More   All
0.1:   Efficient Communication Using Total-Exchange - Rao, Suel, Tsantilas (1995)   (Correct)
0.1:   General Purpose Parallel Computing - McColl (1993)   (Correct)
0.1:   ERCW PRAMs and Optical Communication - MacKenzie, Ramachandran (1996)   (Correct)

Similar documents based on text:   More   All
0.2:   Leslie G. Valiant - Tr- Center For   (Correct)
0.1:   Why is Boolean Complexity Theory Difficult? - Valiant (1992)   (Correct)
0.1:   Cognitive Computation - Extend Ed   (Correct)

Related documents from co-citation:   More   All
18:   A bridging model for parallel computation (context) - Valiant - 1990
17:   General purpose parallel architectures (context) - Valiant - 1990
10:   An architecture independent programming model for scalable parallel computing (context) - McColl - 1994

BibTeX entry:   (Update)

L.G. Valiant. A Combining Mechanism for Parallel Computers. Technical Report TR-24-92, Harvard University, Aiken Computation Laboratory, 1992. http://citeseer.ist.psu.edu/valiant92combining.html   More

@inproceedings{ valiant92combining,
    author = "Leslie G. Valiant",
    title = "A Combining Mechanism for Parallel Computers",
    booktitle = "Heinz Nixdorf Symposium",
    pages = "1-10",
    year = "1992",
    url = "citeseer.ist.psu.edu/valiant92combining.html" }
Citations (may not include all citations):
735   A bridging model for parallel computation (context) - Valiant - 1990
234   General purpose parallel architectures (context) - Valiant - 1990
218   Probabilistic construction of deterministic algorithms (context) - Raghavan - 1986
196   How to emulate shared memory (context) - Ranade - 1987
177   Direct bulk-synchronous parallel algorithms - Gerbessiotis, Valiant - 1992
159   The NYU Ultracomputer - Designing an MIMD shared-memory para.. (context) - Gottlieb - 1983
123   the method of bounded differences (context) - McDiarmid - 1989
70   A complexity theory of efficient parallel algorithms (context) - Kruskal, Rudolph et al. - 1990
62   Distributing hot-spot addressing in large-scale multiprocess.. (context) - Yew, Tzeng et al. - 1987
60   Optical communication for pointer based algorithms - Anderson, Miller - 1988
55   Parallel hashing -- an efficient implementation of shared me.. (context) - Karlin, Upfal - 1986
28   Efficient optical communication in parallel computers (context) - Ger'eb-Graus, Tsantilas - 1992
28   A large scale homogeneous fully distributed parallel machine (context) - Sullivan, Bashkow et al. - 1977
11   Design sketches for optical crossbar switches intended for l.. (context) - Hartmann, Redfield - 1989
1   A survey of algorithms for shared-memory machines (context) - Karp, Ramachandran - 1990



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.indiana.edu/pub/ucstri/index):   More
Environment Modelling for Mobile Robots: Neural Learning for.. - van Dam (1998)   (Correct)
Broadcasting in Butterfly and DeBruijn Networks - Klasing, Monien, Peine, Stöhr (1992)   (Correct)
ILFA - A Project in Experimental Logic Computation - Dunker, Flögel, Büning..   (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