Sciweavers

1855 search results - page 161 / 371
» A coding theorem for distributed computation
Sort
View
IPPS
1998
IEEE
15 years 10 months ago
Local Enumeration Techniques for Sparse Algorithms
Several methods have been proposed in the literature for the local enumeration of dense references for arrays distributed by the CYCLIC(k) data-distributionin High Performance For...
Gerardo Bandera, Pablo P. Trabado, Emilio L. Zapat...
IPPS
2009
IEEE
16 years 1 months ago
Implementing protein seed-based comparison algorithm on the SGI RASC-100 platform
This paper describes a parallel FPGA implementation of a genomic sequence comparison algorithm for finding similarities between a large set of protein sequences and full genomes....
Van Hoa Nguyen, Alexandre Cornu, Dominique Lavenie...
CLADE
2003
IEEE
15 years 11 months ago
Issues in Runtime Algorithm Selection for Grid Environments
The heterogeneity and unpredictability of grid computing environments is a severe challenge to algorithm selection for large-scale scientific codes. This paper discusses a set of ...
Prachi Bora, Calvin J. Ribbens, Sandeep Prabhakar,...
IPPS
1997
IEEE
15 years 10 months ago
DPF: A Data Parallel Fortran Benchmark Suite
We present the Data Parallel Fortran (DPF) benchmark suite, a set of data parallel Fortran codes forevaluatingdata parallel compilers appropriatefor any target parallel architectu...
Y. Charlie Hu, S. Lennart Johnsson, Dimitris Kehag...
IPPS
2005
IEEE
15 years 12 months ago
Data Redistribution and Remote Method Invocation in Parallel Component Architectures
With the increasing availability of high-performance massively parallel computer systems, the prevalence of sophisticated scientific simulation has grown rapidly. The complexity ...
Felipe Bertrand, Randall Bramley, Alan Sussman, Da...