Sciweavers

6004 search results - page 703 / 1201
» Parallelizing query optimization
Sort
View
IPPS
1997
IEEE
15 years 8 months ago
The Sparse Cyclic Distribution against its Dense Counterparts
Several methods have been proposed in the literature for the distribution of data on distributed memory machines, either oriented to dense or sparse structures. Many of the real a...
Gerardo Bandera, Manuel Ujaldon, María A. T...
HPCA
1996
IEEE
15 years 8 months ago
Co-Scheduling Hardware and Software Pipelines
Exploiting instruction-level parallelism (ILP) is extremely important for achieving high performance in application specific instruction set processors (ASIPs) and embedded process...
Ramaswamy Govindarajan, Erik R. Altman, Guang R. G...
SC
1990
ACM
15 years 8 months ago
Loop distribution with arbitrary control flow
Loop distribution is an integral part of transforming a sequential program into a parallel one. It is used extensively in parallelization,vectorization, and memory management. For...
Ken Kennedy, Kathryn S. McKinley
PODC
2010
ACM
15 years 8 months ago
On maintaining multiple versions in STM
An effective way to reduce the number of aborts in software transactional memory (STM) is to keep multiple versions of transactional objects. In this paper, we study inherent prop...
Dmitri Perelman, Rui Fan, Idit Keidar
ICS
1995
Tsinghua U.
15 years 8 months ago
Optimum Modulo Schedules for Minimum Register Requirements
Modulo scheduling is an e cient technique for exploiting instruction level parallelism in a variety of loops, resulting in high performance code but increased register requirement...
Alexandre E. Eichenberger, Edward S. Davidson, San...