Sciweavers

794 search results - page 24 / 159
» Challenges in Parallel Graph Processing
Sort
View
ICPP
2006
IEEE
14 years 3 months ago
A Parallel External-Memory Frontier Breadth-First Traversal Algorithm for Clusters of Workstations
— This paper presents a parallel external-memory algorithm for performing a breadth-first traversal of an implicit graph on a cluster of workstations. The algorithm is a paralle...
Robert Niewiadomski, José Nelson Amaral, Ro...
TPDS
2008
124views more  TPDS 2008»
13 years 9 months ago
Efficient Breadth-First Search on the Cell/BE Processor
Multicore processors are an architectural paradigm shift that promises a dramatic increase in performance. But, they also bring an unprecedented level of complexity in algorithmic ...
Daniele Paolo Scarpazza, Oreste Villa, Fabrizio Pe...
DAC
2007
ACM
14 years 10 months ago
Program Mapping onto Network Processors by Recursive Bipartitioning and Refining
Mapping packet processing applications onto embedded network processors (NP) is a challenging task due to the unique constraints of NP systems and the characteristics of network a...
Jia Yu, Jingnan Yao, Jun Yang 0002, Laxmi N. Bhuya...
DMG
2005
Springer
14 years 2 months ago
Adapting to Changing Resource Performance in Grid Query Processing
The Grid provides facilities that support the coordinated use of diverse resources, and consequently, provides new opportunities for wide-area query processing. However, Grid resou...
Anastasios Gounaris, Jim Smith, Norman W. Paton, R...
IPPS
2008
IEEE
14 years 3 months ago
Supporting high performance bioinformatics flat-file data processing using indices
As an essential part of in vitro analysis, biological database query has become more and more important in the research process. A few challenges that are specific to bioinformat...
Xuan Zhang, Gagan Agrawal