Sciweavers

1415 search results - page 151 / 283
» Can Parallel Algorithms Enhance Serial Implementation
Sort
View
IPPS
2003
IEEE
15 years 7 months ago
Performance Modeling of the Grace Hash Join on Cluster Architectures
Aim of the paper is to develop a concise but comprehensive analytical model for the well-known Grace Hash Join algorithm on cost effective cluster architectures. This approach is ...
Erich Schikuta
APPT
2009
Springer
15 years 6 months ago
Efficient Multiplication of Polynomials on Graphics Hardware
We present the algorithm to multiply univariate polynomials with integer coefficients efficiently using the Number Theoretic transform (NTT) on Graphics Processing Units (GPU). The...
Pavel Emeliyanenko
ICDCS
2002
IEEE
15 years 7 months ago
Fast Collect in the absence of contention
We present a generic module, called Fast Collect. Fast Collect is an implementation of Single-Writer Multi-Reader (SWMR) Shared-Memory in an asynchronous system in which a process...
Burkhard Englert, Eli Gafni
SPAA
1996
ACM
15 years 6 months ago
BSP vs LogP
A quantitative comparison of the BSP and LogP models of parallel computation is developed. We concentrate on a variant of LogP that disallows the so-called stalling behavior, alth...
Gianfranco Bilardi, Kieran T. Herley, Andrea Pietr...
PAAMS
2010
Springer
15 years 19 days ago
A GPU-Based Multi-agent System for Real-Time Simulations
The huge number of cores existing in current Graphics Processor Units (GPUs) provides these devices with computing capabilities that can be exploited by distributed applications. I...
Guillermo Vigueras, Juan M. Orduña, Miguel ...