This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
SWAP: Parallelization through Algorithm Substitution
July-Aug. 2012 (vol. 32 no. 4)
pp. 54-67
Hengjie Li, Institute of Computing Technology, CAS
Wenting He, Institute of Computing Technology, CAS
Yang Chen, Institute of Computing Technology, CAS
Lieven Eeckhout, Ghent University
Olivier Temam, INRIA Saclay
Chengyong Wu, Institute of Computing Technology, CAS
By explicitly indicating which algorithms they use and encapsulating these algorithms within software components, programmers make it possible for an algorithm-aware compiler to replace their original algorithm implementations with compatible parallel implementations, or with the parallel implementations of compatible algorithms, using the so-called specification compatibility graph (SCG). Along with the SCG, a software environment is introduced for performing algorithm-aware compilation.
Index Terms:
Software algorithms,Parallel processing,Computer architecture,Program processors,Semantics,Algorithm design and analysis,SWAP,Software algorithms,Parallel processing,Computer architecture,Program processors,Semantics,Algorithm design and analysis,specification compatibility graph,parallel programming,parallelization
Citation:
Hengjie Li, Wenting He, Yang Chen, Lieven Eeckhout, Olivier Temam, Chengyong Wu, "SWAP: Parallelization through Algorithm Substitution," IEEE Micro, vol. 32, no. 4, pp. 54-67, July-Aug. 2012, doi:10.1109/MM.2012.53
Usage of this product signifies your acceptance of the Terms of Use.