Sciweavers

16159 search results - page 411 / 3232
» Parallel computing with CUDA
Sort
View
ICPPW
2003
IEEE
16 years 2 days ago
Performance Analysis of Approximate String Searching Implementations for Heterogeneous Computing Platform
This paper presents an analytical performance prediction model that can be used to predict the speedup and similar performance metrics of four approximate string searching implemen...
Panagiotis D. Michailidis, Konstantinos G. Margari...
PDPTA
1996
15 years 8 months ago
Solving a 2D Knapsack Problem on an Associative Computer Augmented with a Linear Network
This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...
Darrell R. Ulm, Johnnie W. Baker
ICCS
2005
Springer
16 years 9 days ago
Comparison of Nonlinear Conjugate-Gradient Methods for Computing the Electronic Properties of Nanostructure Architectures
In this article we report on our efforts to test and expand the current state-of-the-art in eigenvalue solvers applied to the field of nanotechnology. We singled out the nonlinea...
Stanimire Tomov, Julien Langou, Andrew Canning, Li...
FPL
1999
Springer
80views Hardware» more  FPL 1999»
15 years 11 months ago
An Internet Based Development Framework for Reconfigurable Computing
The paper presents a development framework for the Xputer prototype Map-oriented Machine with Parallel Data Access (MoM-PDA). The MoM-PDA operates as a reconfigurable accelerator t...
Reiner W. Hartenstein, Michael Herz, Ulrich Nageld...
169
Voted
JPDC
2006
134views more  JPDC 2006»
15 years 6 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong