constraint-based locality analysis for x10 programs

ISCAS OpenIR

	constraint-based locality analysis for x10 programs
	Sun Qiang; Chen Yuting; Zhao Jianjun
	2013
会议名称	ACM SIGPLAN 2013 Workshop on Partial Evaluation and Program Manipulation, PEPM 2013 - Co-located with POPL 2013
会议录名称	PEPM 2013 - Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, Co-located with POPL 2013
页码	137-146
会议日期	January 21, 2013 - January 22, 2013
会议地点	Rome, Italy
收录类别	EI
ISBN	9781450318426
部门归属	(1) Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China; (2) School of Software Shanghai Jiao Tong University Shanghai China; (3) State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China; (4) Shanghai Key Laboratory of Computer Software Testing and Evaluating Shanghai China
摘要	X10 is a HPC (High Performance Computing) programming language proposed by IBMfor supporting a PGAS (Partitioned Global Address Space) programming model offering a shared address space. The address space can be further partitioned into several logical locations where objects and activities (or threads) will be dynamically created. An analysis of locations can help to check the safety of object accesses through exploring which objects and activities may reside in which locations, while in practice the objects and activities are usually designated at runtime and their locations may also vary under different environments. In this paper, we propose a constraint-based locality analysis method called Leopard for X10. Leopard calculates the points-to relations for analyzing the objects and activities in a program and uses a place constraint graph to analyze their locations. We have developed a tool to support Leopard, and conducted an experiment to evaluate its effectiveness and efficiency. The experimental results show that Leopard can calculate the locations of objects and activities precisely. Copyright © 2013 ACM.; X10 is a HPC (High Performance Computing) programming language proposed by IBMfor supporting a PGAS (Partitioned Global Address Space) programming model offering a shared address space. The address space can be further partitioned into several logical locations where objects and activities (or threads) will be dynamically created. An analysis of locations can help to check the safety of object accesses through exploring which objects and activities may reside in which locations, while in practice the objects and activities are usually designated at runtime and their locations may also vary under different environments. In this paper, we propose a constraint-based locality analysis method called Leopard for X10. Leopard calculates the points-to relations for analyzing the objects and activities in a program and uses a place constraint graph to analyze their locations. We have developed a tool to support Leopard, and conducted an experiment to evaluate its effectiveness and efficiency. The experimental results show that Leopard can calculate the locations of objects and activities precisely. Copyright © 2013 ACM.
主办者	ACM SIGPLAN
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/15906
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Sun Qiang,Chen Yuting,Zhao Jianjun. constraint-based locality analysis for x10 programs[C],2013:137-146.