Sciweavers

163 search results - page 8 / 33
» A Parallel Search Engine with BSP
Sort
View
ICPP
2006
IEEE
15 years 6 months ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri
CLADE
2004
IEEE
15 years 4 months ago
Engineering a Peer-to-Peer Collaboratory for Tissue Microarray Research
This paper presents the design, development and evaluation of a prototype peer-to-peer collaboratory for imaging, analyzing, and seamlessly sharing tissue microarrays (TMA), corre...
Cristina Schmidt, Manish Parashar, Wenjin Chen, Da...
92
Voted
GCC
2005
Springer
15 years 6 months ago
Parallel Web Spiders for Cooperative Information Gathering
Web spider is a widely used approach to obtain information for search engines. As the size of the Web grows, it becomes a natural choice to parallelize the spider’s crawling proc...
Jiewen Luo, Zhongzhi Shi, Maoguang Wang, Wei Wang
92
Voted
COORDINATION
2004
Springer
15 years 5 months ago
A Component-Based Parallel Constraint Solver
As a case study that illustrates our view on coordination and component-based software engineering, we present the design and implementation of a parallel constraint solver. The pa...
Peter Zoeteweij, Farhad Arbab
PPOPP
2012
ACM
13 years 8 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal