International Symposium on Code Generation and Optimization (CGO'06)最新文献_第3页

Java JNI Bridge: a framework for mixed native ISA execution Java JNI Bridge:用于混合本机ISA执行的框架

International Symposium on Code Generation and Optimization (CGO'06) Pub Date : 2006-03-26 DOI: 10.1109/CGO.2006.22

Miaobo Chen, S. Goldenberg, S. Srinivas, Valery Ushakov, Young Wang, Qi Zhang, Eric Lin, Yoav Zach

{"title":"Java JNI Bridge: a framework for mixed native ISA execution","authors":"Miaobo Chen, S. Goldenberg, S. Srinivas, Valery Ushakov, Young Wang, Qi Zhang, Eric Lin, Yoav Zach","doi":"10.1109/CGO.2006.22","DOIUrl":"https://doi.org/10.1109/CGO.2006.22","url":null,"abstract":"Managed runtime environments (MRTEs) such as the Java platform promise a cross platform \"write once, deploy anywhere\" mechanism. However, MRTE applications that contain native method calls are not seamlessly portable across platforms. In this paper, we describe a new approach to transparently run Java applications containing native method calls to one ISA (instruction set architecture) on a different ISA's Java platform. This approach operates within the same operating system process that executes the application but with the support of a dynamic translator. This paper describes the technical challenges and solutions of such an in-process implementation within a production Java Virtual Machine (JVM). These include interfacing the JVM with a dynamic translator to support native calls to a different ISA, pursuing a JVM-independent implementation, enhancing the dynamic translator to support shared libraries in addition to executables, marshalling arguments across ISA boundaries, and providing full support for all Java features such as multi-threading. The paper presents performance results for an end-user application, showing our approach to be 2-3 times faster than other approaches.","PeriodicalId":196640,"journal":{"name":"International Symposium on Code Generation and Optimization (CGO'06)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129921498","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Data and computation transformations for Brook streaming applications on multiprocessors Brook流应用在多处理器上的数据和计算转换

International Symposium on Code Generation and Optimization (CGO'06) Pub Date : 2006-03-26 DOI: 10.1109/CGO.2006.13

Shih-Wei Liao, Zhaohui Du, Gansha Wu, Guei-Yuan Lueh

{"title":"Data and computation transformations for Brook streaming applications on multiprocessors","authors":"Shih-Wei Liao, Zhaohui Du, Gansha Wu, Guei-Yuan Lueh","doi":"10.1109/CGO.2006.13","DOIUrl":"https://doi.org/10.1109/CGO.2006.13","url":null,"abstract":"Multicore processors are about to become prevalent in the PC world. Meanwhile, over 90% of the computing cycles are estimated to be consumed by streaming media applications (Rixner et al., 1998). Although stream programming exposes parallelism naturally, we found that achieving high performance on multiprocessors is challenging. Therefore, we develop a parallel compiler for the Brook streaming language with aggressive data and computation transformations. First, we formulate fifteen Brook stream operators in terms of systems of inequalities. Our compiler optimizes the modeled operators to improve memory footprint and performance. Second, the stream computation including both kernels and operators is mapped to the affine partitioning model by modeling each kernel as an implicit loop nest over stream elements. Note that our general abstraction is not limited to Brook. Our modeling and transformations yield high performance on uniprocessors as well. The geometric mean of speedups is 4.7 on ten streaming applications on a Xeon. On multiprocessors, we show that exploiting the standard intra-kernel data parallelism is inferior to our general modeling. The former yields a speedup of 1.5 for ten applications on a 4-way Xeon, while the latter achieves a speedup of 6.4 over the same baseline. We show that our compiler effectively reduces memory footprint, exploits parallelism, and circumvents phase-ordering issues.","PeriodicalId":196640,"journal":{"name":"International Symposium on Code Generation and Optimization (CGO'06)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130920333","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 106

Compiler optimizations to reduce security overhead 编译器优化以减少安全开销

International Symposium on Code Generation and Optimization (CGO'06) Pub Date : 2006-03-26 DOI: 10.1109/CGO.2006.8

Zhang Tao, Xiaotong Zhuang, S. Pande

引用次数: 5

Inline analysis: beyond selection heuristics 内联分析:超越选择启发式

International Symposium on Code Generation and Optimization (CGO'06) Pub Date : 2006-03-26 DOI: 10.1109/CGO.2006.17

Dhruva R. Chakrabarti, Shin-Ming Liu

{"title":"Inline analysis: beyond selection heuristics","authors":"Dhruva R. Chakrabarti, Shin-Ming Liu","doi":"10.1109/CGO.2006.17","DOIUrl":"https://doi.org/10.1109/CGO.2006.17","url":null,"abstract":"Research on procedure inlining has mainly focused on heuristics that decide whether inlining a particular call-site maximizes application performance. However, other equally important aspects of inline analysis such as call-site analysis order, indirect effects of inlining, and selection of the most profitable version of a procedure warrant more attention. This paper evaluates a number of different sequences in which call-sites are examined for inlining and shows that choosing the correct order is crucial to obtaining the best run-time performance. We then present a novel, work-list-based, and updated sequence that achieves the best results. While applying cross-module inline analysis on large applications with thousands of files and millions of lines of code, we separate the analysis from the transformation phase and allow the former to work solely on summary information in order to reduce compile-time and memory consumption. A focus of this paper is to enumerate the summaries that our compiler maintains, present a technique to compute the goodness factor on which the work-list sequence is based, and describe methods to continuously update the summaries as and when a call-site is accepted for inlining. We then introduce inline specialization, a new technique that facilitates inlining into call chains selectively. The power of inline specialization lies in its ability to choose the most profitable version of the called procedure without having to maintain multiple versions at any point of time. We discuss implementation of these techniques in the HPUX Itanium/spl reg/ production compiler and present experimental results showing that a dynamic work-list based analysis order, comprehensive summary updates, and inline specialization significantly improve performance of applications.","PeriodicalId":196640,"journal":{"name":"International Symposium on Code Generation and Optimization (CGO'06)","volume":"255 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129987781","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 17

Region monitoring for local phase detection in dynamic optimization systems 动态优化系统局部相位检测的区域监测

International Symposium on Code Generation and Optimization (CGO'06) Pub Date : 2006-03-26 DOI: 10.1109/CGO.2006.39

A. Das, Jiwei Lu, W. Hsu

{"title":"Region monitoring for local phase detection in dynamic optimization systems","authors":"A. Das, Jiwei Lu, W. Hsu","doi":"10.1109/CGO.2006.39","DOIUrl":"https://doi.org/10.1109/CGO.2006.39","url":null,"abstract":"Dynamic optimization relies on phase detection for two important functions (1) To detect change in code working set and (2) To detect change in performance characteristics that can affect optimization strategy. Current prototype runtime optimization systems (J. Lu et al) compare aggregate metrics like CPI over fixed time intervals to detect a change in working set and a change in performance. While simple and cost-effective, these metrics are sensitive to sampling rate and interval size. A phase detection scheme that computes performance metrics by aggregating the performance of individually optimized regions can be misled by some regions impacting aggregate metrics adversely. In this paper, we investigate the benefits and limitations of using aggregate metrics for phase detection, which we call global phase detection (GPD). We present a new model to detect change in working set and propose that the scope of phase detection be limited to within the candidate regions for optimization. By associating phase detection to individual regions we can isolate the effects of regions that are inherently unstable. This approach, which we call local phase detection (LPD), shows improved performance on several benchmarks even when global phase detection is not able to detect stable phases.","PeriodicalId":196640,"journal":{"name":"International Symposium on Code Generation and Optimization (CGO'06)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128867096","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9

BIRD: binary interpretation using runtime disassembly BIRD:使用运行时反汇编的二进制解释

International Symposium on Code Generation and Optimization (CGO'06) Pub Date : 2006-03-26 DOI: 10.1109/CGO.2006.6

Susanta Nanda, Wei Li, L. Lam, T. Chiueh

{"title":"BIRD: binary interpretation using runtime disassembly","authors":"Susanta Nanda, Wei Li, L. Lam, T. Chiueh","doi":"10.1109/CGO.2006.6","DOIUrl":"https://doi.org/10.1109/CGO.2006.6","url":null,"abstract":"The majority of security vulnerabilities published in the literature is due to software bugs. Many researchers have developed program transformation and analysis techniques to automatically detect or eliminate such vulnerabilities. So far, most of them cannot be applied to commercially distributed applications on the Windows/x86 platform, because it is almost impossible to disassemble a binary file with 100% accuracy and coverage on that platform. This paper presents the design, implementation, and evaluation of a binary analysis and instrumentation infrastructure for the Windows/x86 platform called BIRD (binary interpretation using runtime disassembly), which provides two services to developers of security-enhancing program transformation tools: converting binary code into assembly language instructions for further analysis, and inserting instrumentation code at specific places of a given binary without affecting its execution semantics. Instead of requiring a high-fidelity instruction set architectural emulator, BIRD combines static disassembly with an on-demand dynamic disassembly approach to guarantee that each instruction in a binary file is analyzed or transformed before it is executed. It takes 12 student months to develop the first BIRD prototype, which can successfully work for all applications in Microsoft office suite as well as Internet explorer and IIS Web server, including all DLLs that they use. Moreover, the additional throughput penalty of the BIRD prototype on production server applications such as Apache, IIS, and BIND is uniformly below 4%.","PeriodicalId":196640,"journal":{"name":"International Symposium on Code Generation and Optimization (CGO'06)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126227365","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 121

2D-profiling: detecting input-dependent branches with a single input data set 2d分析:用单个输入数据集检测与输入相关的分支

International Symposium on Code Generation and Optimization (CGO'06) Pub Date : 2006-03-26 DOI: 10.1109/CGO.2006.1

Hyesoon Kim, M. A. Suleman, O. Mutlu, Y. Patt

引用次数: 15

Practical structure layout optimization and advice 实用结构布局优化及建议

International Symposium on Code Generation and Optimization (CGO'06) Pub Date : 2006-03-26 DOI: 10.1109/CGO.2006.29

R. Hundt, Sandya Mannarswamy, Dhruva R. Chakrabarti

{"title":"Practical structure layout optimization and advice","authors":"R. Hundt, Sandya Mannarswamy, Dhruva R. Chakrabarti","doi":"10.1109/CGO.2006.29","DOIUrl":"https://doi.org/10.1109/CGO.2006.29","url":null,"abstract":"With the delta between processor clock frequency and memory latency ever increasing and with the standard locality improving transformations maturing, compilers increasingly seek to modify an application's data layout to improve spatial and temporal locality and to reduce cache miss and page fault penalties. In this paper, we describe a practical implementation of the data layout optimizations structure splitting, structure peeling, structure field reordering and dead field removal, both for profile and non-profile based compilations. We demonstrate significant performance gains, but find that automatic transformations fail for a relatively high number of record types because of legality violations or profitability constraints. Additionally, we find a class of desirable transformations for which the framework cannot provide satisfying results. To address this issue, we complement the automatic transformations with an advisory tool. We reuse the compiler analysis done for automatic transformation and correlate its results with performance data collected during runtime for structure fields, such as data cache misses and latencies. We then use the compiler as a performance analysis and reporting tool and provide insight into how to layout structure types more efficiently.","PeriodicalId":196640,"journal":{"name":"International Symposium on Code Generation and Optimization (CGO'06)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124428625","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 37

Multi-platform auto-vectorization 多平台自动向量化

International Symposium on Code Generation and Optimization (CGO'06) Pub Date : 2006-03-26 DOI: 10.1109/CGO.2006.25

Dorit Nuzman, Richard Henderson

引用次数: 101