Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation最新文献

Optimizing direct threaded code by selective inlining 通过选择性内联优化直接线程代码

Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation Pub Date : 1998-05-01 DOI: 10.1145/277650.277743

Ian Piumarta, F. Riccardi

引用次数: 139

Partial online cycle elimination in inclusion constraint graphs 包含约束图中的部分在线循环消去

Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation Pub Date : 1998-05-01 DOI: 10.1145/277650.277667

Manuel Fähndrich, J. Foster, Z. Su, A. Aiken

引用次数: 241

A study of dead data members in C++ applications c++应用程序中失效数据成员的研究

Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation Pub Date : 1998-05-01 DOI: 10.1145/277650.277750

P. Sweeney, F. Tip

引用次数: 45

Scalable cross-module optimization 可扩展的跨模块优化

Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation Pub Date : 1998-05-01 DOI: 10.1145/277650.277745

A. Ayers, Stuart de Jong, John Peyton, R. Schooler

{"title":"Scalable cross-module optimization","authors":"A. Ayers, Stuart de Jong, John Peyton, R. Schooler","doi":"10.1145/277650.277745","DOIUrl":"https://doi.org/10.1145/277650.277745","url":null,"abstract":"Large applications are typically partitioned into separately compiled modules. Large performance gains in these applications are available by optimizing across module boundaries. One barrier to applying crossmodule optimization (CMO) to large applications is the potentially enormous amount of time and space consumed by the optimization process.We describe a framework for scalable CMO that provides large gains in performance on applications that contain millions of lines of code. Two major techniques are described. First, careful management of in-memory data structures results in sub-linear memory occupancy when compared to the number of lines of code being optimized. Second, profile data is used to focus optimization effort on the performance-critical portions of applications. We also present practical issues that arise in deploying this framework in a production environment. These issues include debuggability and compatibility with existing development tools, such as make. Our framework is deployed in Hewlett-Packard's (HP) UNIX compiler products and speeds up shipped independent software vendors' applications by as much as 71%.","PeriodicalId":365404,"journal":{"name":"Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114667841","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}

引用次数: 40

Register promotion by sparse partial redundancy elimination of loads and stores 通过稀疏部分冗余消除负载和存储的寄存器提升

Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation Pub Date : 1998-05-01 DOI: 10.1145/277650.277659

R. Lo, Fred C. Chow, Robert Kennedy, Shin-Ming Liu, P. Tu

{"title":"Register promotion by sparse partial redundancy elimination of loads and stores","authors":"R. Lo, Fred C. Chow, Robert Kennedy, Shin-Ming Liu, P. Tu","doi":"10.1145/277650.277659","DOIUrl":"https://doi.org/10.1145/277650.277659","url":null,"abstract":"An algorithm for register promotion is presented based on the observation that the circumstances for promoting a memory location's value to register coincide with situations where the program exhibits partial redundancy between accesses to the memory location. The recent SSAPRE algorithm for eliminating partial redundancy using a sparse SSA representation forms the foundation for the present algorithm to eliminate redundancy among memory accesses, enabling us to achieve both computational and live range optimality in our register promotion results. We discuss how to effect speculative code motion in the SSAPRE framework. We present two different algorithms for performing speculative code motion: the conservative speculation algorithm used in the absence of profile data, and the the profile-driven speculation algorithm used when profile data are available. We define the static single use (SSU) form and develop the dual of the SSAPRE algorithm, called SSUPRE, to perform the partial redundancy elimination of stores. We provide measurement data on the SPECint95 benchmark suite to demonstrate the effectiveness of our register promotion approach in removing loads and stores. We also study the relative performance of the different speculative code motion strategies when applied to scalar loads and stores.","PeriodicalId":365404,"journal":{"name":"Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122179547","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}

引用次数: 112

Generational stack collection and profile-driven pretenuring 分代堆栈收集和配置文件驱动的伪装

Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation Pub Date : 1998-05-01 DOI: 10.1145/277650.277718

P. Cheng, R. Harper, Peter Lee

{"title":"Generational stack collection and profile-driven pretenuring","authors":"P. Cheng, R. Harper, Peter Lee","doi":"10.1145/277650.277718","DOIUrl":"https://doi.org/10.1145/277650.277718","url":null,"abstract":"This paper presents two techniques for improving garbage collection performance: generational stack collection and profile-driven pretenuring. The first is applicable to stack-based implementations of functional languages while the second is useful for any generational collector. We have implemented both techniques in a generational collector used by the TIL compiler (Tarditi, Morrisett, Cheng, Stone, Harper, and Lee 1996), and have observed decreases in garbage collection times of as much as 70% and 30%, respectively.Functional languages encourage the use of recursion which can lead to a long chain of activation records. When a collection occurs, these activation records must be scanned for roots. We show that scanning many activation records can take so long as to become the dominant cost of garbage collection. However, most deep stacks unwind very infrequently, so most of the root information obtained from the stack remains unchanged across successive garbage collections. Generational stack collection greatly reduces the stack scan cost by reusing information from previous scans.Generational techniques have been successful in reducing the cost of garbage collection (Ungar 1984). Various complex heap arrangements and tenuring policies have been proposed to increase the effectiveness of generational techniques by reducing the cost and frequency of scanning and copying. In contrast, we show that by using profile information to make lifetime predictions, pretenuring can avoid copying data altogether. In essence, this technique uses a refinement of the generational hypothesis (most data die young) with a locality principle concerning the age of data: most allocations sites produce data that immediately dies, while a few allocation sites consistently produce data that survives many collections.","PeriodicalId":365404,"journal":{"name":"Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation","volume":"477 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121349754","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}

引用次数: 116

Improving performance by branch reordering 通过分支重新排序提高性能

Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation Pub Date : 1998-05-01 DOI: 10.1145/277650.277711

Minghui Yang, Gang-Ryung Uh, D. Whalley

{"title":"Improving performance by branch reordering","authors":"Minghui Yang, Gang-Ryung Uh, D. Whalley","doi":"10.1145/277650.277711","DOIUrl":"https://doi.org/10.1145/277650.277711","url":null,"abstract":"The conditional branch has long been considered an expensive operation. The relative cost of conditional branches has increased as recently designed machines are now relying on deeper pipelines and higher multiple issue. Reducing the number of conditional branches executed can often result in a substantial performance benefit. This paper describes a code-improving transformation to reorder sequences of conditional branches. First, sequences of branches that can be reordered are detected in the control flow. Second, profiling information is collected to predict the probability that each branch will transfer control out of the sequence. Third, the cost of performing each conditional branch is estimated. Fourth, the most beneficial ordering of the branches based on the estimated probability and cost is selected. The most beneficial ordering often included the insertion of additional conditional branches that did not previously exist in the sequence. Finally, the control flow is restructured to refflect the new ordering. The results of applying the transformation were significant reductions in the dynamic number of instructions and branches, as well as decreases in execution time.","PeriodicalId":365404,"journal":{"name":"Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126697383","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}

引用次数: 20

A new algorithm for scalar register promotion based on SSA form 一种基于SSA格式的标量寄存器提升算法

Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation Pub Date : 1998-05-01 DOI: 10.1145/277650.277656

A. V. S. Sastry, R. Ju

引用次数: 47

The design and implementation of a certifying compiler 认证编译器的设计和实现

Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation Pub Date : 1998-05-01 DOI: 10.1145/277650.277752

G. Necula, Peter Lee

{"title":"The design and implementation of a certifying compiler","authors":"G. Necula, Peter Lee","doi":"10.1145/277650.277752","DOIUrl":"https://doi.org/10.1145/277650.277752","url":null,"abstract":"This paper presents the design and implementation of a compiler that translates programs written in a type-safe subset of the C programming language into highly optimized DEC Alpha assembly language programs, and a certifier that automatically checks the type safety and memory safety of any assembly language program produced by the compiler. The result of the certifier is either a formal proof of type safety or a counterexample pointing to a potential violation of the type system by the target program. The ensemble of the compiler and the certifier is called a certifying compiler.Several advantages of certifying compilation over previous approaches can be claimed. The notion of a certifying compiler is significantly easier to employ than a formal compiler verification, in part because it is generally easier to verify the correctness of the result of a computation than to prove the correctness of the computation itself. Also, the approach can be applied even to highly optimizing compilers, as demonstrated by the fact that our compiler generates target code, for a range of realistic C programs, which is competitive with both the cc and gcc compilers with all optimizations enabled. The certifier also drastically improves the effectiveness of compiler testing because, for each test case, it statically signals compilation errors that might otherwise require many executions to detect. Finally, this approach is a practical way to produce the safety proofs for a Proof-Carrying Code system, and thus may be useful in a system for safe mobile code.","PeriodicalId":365404,"journal":{"name":"Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123450527","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}

引用次数: 405

Eliminating array bound checking through dependent types 消除通过依赖类型进行的数组绑定检查

Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation Pub Date : 1998-05-01 DOI: 10.1145/277650.277732

H. Xi, F. Pfenning

引用次数: 334