The Community for Technology Leaders
2012 21st International Conference on Parallel Architectures and Compilation Techniques (PACT) (2012)
Minneapolis, MN, USA
Sept. 19, 2012 to Sept. 23, 2012
ISBN: 978-1-5090-6609-4
pp: 469-470
Congming Chen , State Key Laboratory of Computer, Architecture, CAS, Beijing, China
Wei Huo , State Key Laboratory of Computer, Architecture, CAS, Beijing, China
Xiaobing Feng , State Key Laboratory of Computer, Architecture, CAS, Beijing, China
ABSTRACT
May-Happen-in-Parallel (MHP) analysis is a very important and fundamental mechanism to facilitate concurrent program analysis. But the limitation of its efficiency keep it away from being practical and effective in analyzing large scale real world concurrent programs. We proposed a novel MHP algorithm by performing a reachability analysis on a so-called parallel reachability graph of a program. The MHP algorithm mainly comprises two phases: pre-computation of initial MHP information and top-down propagation of this information along the parallel reachability graph. Our algorithm is fast as it has a low complexity O(|N|+|E|), in which N is the number of nodes in the parallel reachability graph and E is the number of edges in this graph. Our preliminary experiment on 13 concurrent programs indicates that our approach is extremely faster than two state-of-art approaches, respectively achieving a relative geometry average speed up of 395.53× and 136.37×, while yielding the same precision with these two approaches.
INDEX TERMS
Instruction sets, Programming, Concurrent computing, Algorithm design and analysis, Computer architecture, Reachability analysis, Java,program analysis, may happen in parallel, concurrent
CITATION
Congming Chen, Wei Huo, Xiaobing Feng, "Making it practical and effective: Fast and precise May-Happen-in-Parallel analysis", 2012 21st International Conference on Parallel Architectures and Compilation Techniques (PACT), vol. 00, no. , pp. 469-470, 2012, doi:
97 ms
(Ver 3.3 (11022016))