Sciweavers

366 search results - page 41 / 74
» Evaluating the Performance of Skeleton-Based High Level Para...
Sort
View
ICS
1995
Tsinghua U.
14 years 1 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...
HPCA
1999
IEEE
14 years 2 months ago
Comparative Evaluation of Fine- and Coarse-Grain Approaches for Software Distributed Shared Memory
Symmetric multiprocessors (SMPs) connected with low-latency networks provide attractive building blocks for software distributed shared memory systems. Two distinct approaches hav...
Sandhya Dwarkadas, Kourosh Gharachorloo, Leonidas ...
ICPP
2009
IEEE
14 years 4 months ago
LeWI: A Runtime Balancing Algorithm for Nested Parallelism
Abstract—We present LeWI: a novel load balancing algorithm, that can balance applications with very different patterns of imbalance. Our algorithm can balance fine grain imbalan...
Marta Garcia, Julita Corbalán, Jesús...
ISPAN
2002
IEEE
14 years 2 months ago
On the Impact of Naming Methods for Heap-Oriented Pointers in C Programs
Many applications written in C allocate memory blocks for their major data structures from the heap space at runtime. The analysis of heap-oriented pointers in such programs is cr...
Tong Chen, Jin Lin, Wei-Chung Hsu, Pen-Chung Yew
GCC
2006
Springer
14 years 1 months ago
Grid Programming Environment over ChinaGrid Support Platform
Grid computing is becoming more and more attractive to provide a convenient uniform platform for coordinating highly distributed and heterogeneous resources and services. GridPPI ...
Feng He, Yongwei Wu, Guangwen Yang, Sikan Chen, Li...