Sciweavers

3656 search results - page 392 / 732
» Parallel programming in Split-C
Sort
View
IPPS
1998
IEEE
15 years 10 months ago
Comparing the Optimal Performance of Different MIMD Multiprocessor Architectures
We compare the performance of systems consisting of one large cluster containing q processors with systems where processors are grouped into k clusters containing u processors eac...
Lars Lundberg, Håkan Lennerstad
EUROPAR
2010
Springer
15 years 7 months ago
Generators-of-Generators Library with Optimization Capabilities in Fortress
Abstract. To resolve difficulties in parallel programming, a large number of studies are conducted on parallel skeletons and optimization theorems over skeleton programs. However, ...
Kento Emoto, Zhenjiang Hu, Kazuhiko Kakehi, Kimino...
ICDE
2001
IEEE
141views Database» more  ICDE 2001»
16 years 8 months ago
Processing Queries with Expensive Functions and Large Objects in Distributed Mediator Systems
LeSelect is a mediator system which allows scientists to publish their resources (data and programs) so they can be transparently accessed. The scientists can typically issue quer...
Fabio Porto, Françoise Fabret, Luc Bouganim...
ASPLOS
2009
ACM
16 years 7 months ago
QR decomposition on GPUs
QR decomposition is a computationally intensive linear algebra operation that factors a matrix A into the product of a unitary matrix Q and upper triangular matrix R. Adaptive sys...
Andrew Kerr, Dan Campbell, Mark Richards
PPOPP
2009
ACM
16 years 7 months ago
Comparability graph coloring for optimizing utilization of stream register files in stream processors
A stream processor executes an application that has been decomposed into a sequence of kernels that operate on streams of data elements. During the execution of a kernel, all stre...
Xuejun Yang, Li Wang, Jingling Xue, Yu Deng, Ying ...