Distributed-memory message-passing machines deliver scalable performance but are difficult to program. Shared-memory machines, on the other hand, are easier to program but obtaining scalable performance with large number of processors is difficult. Recently, scalable machines based on logically shar
โฆ LIBER โฆ
A GPGPU compiler for memory optimization and parallelism management
โ Scribed by Yang, Yi; Xiang, Ping; Kong, Jingfei; Zhou, Huiyang
- Book ID
- 118266182
- Publisher
- Association for Computing Machinery
- Year
- 2010
- Weight
- 532 KB
- Volume
- 45
- Category
- Article
- ISSN
- 0362-1340
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Compiler Algorithms for Optimizing Local
โ
M. Kandemir; J. Ramanujam; A. Choudhary
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 608 KB
Compiler and runtime techniques for soft
โ
Peng Wu; Maged M. Michael; Christoph von Praun; Takuya Nakaike; Rajesh Bordaweka
๐
Article
๐
2009
๐
John Wiley and Sons
๐
English
โ 234 KB
A compiler for multiple memory models
โ
S. P. Midkiff; J. Lee; D. A. Padua
๐
Article
๐
2004
๐
John Wiley and Sons
๐
English
โ 344 KB
๐ 1 views
Memory Access Optimized Implementation o
โ
Hyunwoo Ji; Junho Cho; Wonyong Sung
๐
Article
๐
2010
๐
Springer US
๐
English
โ 644 KB
A Robust Compile Time Method for Schedul
โ
Sekhar Darbha; Santosh Pande
๐
Article
๐
1998
๐
Springer US
๐
English
โ 229 KB
Parallel loops โ A test suite for parall
โ
Jack Dongarra; Mark Furtney; Steve Reinhardt; Jerry Russell
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 505 KB
Several multiprocessor systems are now commercially available, and advances in compiler technology provide automatic conversion of programs to run on such systems. However, no accepted measure of this parallel compiler ability exists. This paper presents a test suite of subroutines and loops, called