421 search results - page 6 / 85 » An Intelligent Parallel Loop Scheduling for Parallelizing Co... |
ICPP
1999
IEEE
15 years 1 months ago
1999
IEEE
Most of today's multiprocessors have a DistributedShared Memory (DSM) organization, which enables scalability while retaining the convenience of the shared-memory programming...
LCPC
2009
Springer
15 years 2 months ago
2009
Springer
Classic loop unrolling allows to increase the performance of sequential loops by reducing the overheads of the non-computational parts of the loop. Unfortunately, when the loop con...
IPPS
1997
IEEE
15 years 1 months ago
1997
IEEE
This paper presents a compile-time scheme for partitioning non-rectangular loop nests which consist of inner loops whose bounds depend on the index of the outermost, parallel loop...
IPPS
1997
IEEE
15 years 1 months ago
1997
IEEE
This paper addresses the scheduling of uniformdependence loop nests within the framework of the bulksynchronous parallel (BSP) model. Two broad classes of tightly-nested loops are...
143
click to vote
PLDI
1993
ACM
15 years 1 months ago
1993
ACM
Data locality is critical to achievinghigh performance on large-scale parallel machines. Non-local data accesses result in communication that can greatly impact performance. Thus ...