Sciweavers

611 search results - page 43 / 123
» Highly scalable parallel sorting
Sort
View
IPPS
2007
IEEE
14 years 3 months ago
Domain Decomposition vs. Master-Slave in Apparently Homogeneous Systems
This paper investigates the utilization of the master-slave (MS) paradigm as an alternative to domain decomposition (DD) methods for parallelizing lattice gauge theory (LGT) model...
Cyril Banino-Rokkones
IPPS
2002
IEEE
14 years 1 months ago
A Parallel Two-Level Hybrid Method for Diagonal Dominant Tridiagonal Systems
A new method, namely the Parallel Two-Level Hybrid (PTH) method, is developed to solve tridiagonal systems on parallel computers. PTH is designed based on Parallel Diagonal Domina...
Xian-He Sun, Wu Zhang
EUROPAR
2001
Springer
14 years 1 months ago
Data-Parallel Compiler Support for Multipartitioning
Multipartitioning is a skewed-cyclic block distribution that yields better parallel efficiency and scalability for line-sweep computations than traditional block partitionings. Th...
Daniel G. Chavarría-Miranda, John M. Mellor...
DEBS
2009
ACM
14 years 3 months ago
Parallel event processing for content-based publish/subscribe systems
Event processing systems are a promising technology for enterprise-scale applications. However, achieving scalability yet maintaining high performance is a challenging problem. Th...
Amer Farroukh, Elias Ferzli, Naweed Tajuddin, Hans...
PVM
1999
Springer
14 years 28 days ago
Parallel Computation of the SVD of a Matrix Product
In this paper we study a parallel algorithm for computing the singular value decomposition (SVD) of a product of two matrices on message passing multiprocessors. This algorithm is ...
José M. Claver, Manuel Mollar, Vicente Hern...