(Enter summary)
Abstract: In this work, we propose a speculative parallelization strategy for Probabilistic
Search algorithms. We design a parallel version of one such algorithm for a real--time
computer vision problem with many practical applications. The implementation is
performed on a cluster of eight DEC AlphaServer 2100 4/233 machines connected
via a DEC Memory Channel network. Four types of run--time systems are tested:
Hardware--coherent Shared Memory (HSM), Distributed Shared Memory (DSM) with
software... (Update)
Context of citations to this paper: More
.... we designed and analyzed the performance of a parallel real time probabilistic search algorithm to solve the correspondence problem [2]. We also have a preliminary implementation of a parallel object recognition algorithm. The object recognition system uses a multi gigabyte...
Cited by: More
Annual Report on NSF ESS Grant CCR-9705594 Integrated.. - Scott, Dwarkadas (1999)
(Correct)
Active bibliography (related documents): More All
0.1: The Cranium Network Interface Architecture: Support for Message.. - McKenzie (1997)
(Correct)
0.1: SCI for Local Area Networks - Ryan, Bryhni (1998)
(Correct)
0.1: SCI Clustering through the I/O bus: A Performance and.. - Omang (1998)
(Correct)
Similar documents based on text: More All
0.1: The Implementation of Cashmere - Stets, Chen, Dwarkadas, Hardavellas, ..
(Correct)
0.1: VM-Based Shared Memory on Low-Latency.. - Kontothanassis.. (1997)
(Correct)
0.1: A Model For Alarm Correlation in Telecommunications Networks - Meira (1997)
(Correct)
BibTeX entry: (Update)
R. L. Carceroni, W. Meira, R. Stets, and S. Dwarkadas. Evaluating the trade-offs in the parallelization of probabilistic search algorithms. In Proceedings of the 9th Brazilian Symposium on Computer Architecture and High Performance Processing, October 1997. http://citeseer.ist.psu.edu/carceroni97evaluating.html More
@misc{ carceroni97evaluating,
author = "R. Carceroni and W. Meira and R. Stets and S. Dwarkadas",
title = "Evaluating the trade-offs in the parallelization of probabilistic search
algorithms",
text = "R. L. Carceroni, W. Meira, R. Stets, and S. Dwarkadas. Evaluating the trade-offs
in the parallelization of probabilistic search algorithms. In Proceedings
of the 9th Brazilian Symposium on Computer Architecture and High Performance
Processing, October 1997.",
year = "1997",
url = "citeseer.ist.psu.edu/carceroni97evaluating.html" }
Citations (may not include all citations):
130
Fitting parameterized three--dimensional models to images
- Lowe - 1991
113
Robust model--based motion tracking through the integration ..
- Lowe - 1992
100
Branch--and--bound methods: A survey (context) - Lawler, Wood - 1966
91
Localizing overlapping parts by searching the interpretation.. (context) - Grimson, Lozano-P'erez - 1987
87
Software coherent shared memory on a clustered remote--write.. (context) - Stets, Dwarkadas et al. - 1997
74
Memory channel network for PCI
- Gillett - 1996
51
Symbolic reasoning among 3-D models and 2-D images (context) - Brooks - 1981
15
PVM: A framework for parallel and distributed computing (context) - Sunderam - 1990
8
Experience using the first--generation memory channel for PC.. (context) - Gillett, Kaufmann
Documents on the same site (http://www.cs.rochester.edu/users/faculty/sandhya/publications.html): More
Combining Compile-Time and Run-Time Support for.. - Dwarkadas, Lu.. (1999)
(Correct)
Compiler and Run-Time Support for Adaptive Load Balancing.. - Ioannidis, Dwarkadas (1998)
(Correct)
Compiler and Software Distributed Shared Memory Support for.. - Lu (1997)
(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