Workshop on Dynamic and Adaptive Compilation and Optimization最新文献

筛选
英文 中文
Probabilistic data flow system with two-edge profiling 具有双向轮廓的概率数据流系统
Workshop on Dynamic and Adaptive Compilation and Optimization Pub Date : 2000-07-01 DOI: 10.1145/351397.351418
E. Mehofer, Bernhard Scholz
{"title":"Probabilistic data flow system with two-edge profiling","authors":"E. Mehofer, Bernhard Scholz","doi":"10.1145/351397.351418","DOIUrl":"https://doi.org/10.1145/351397.351418","url":null,"abstract":"Traditionally optimization is done statistically independent of actual execution environments. For generating highly optimized code, however, runtime information can be used to adapt a program to different environments. In probabilistic data flow systems runtime information on representative input data is exploited to compute the probability with what data flow facts may hold. Probabilistic data flow analysis can guide sophisticated optimizing transformations resulting in better performance. In comparison classical data flow analysis does not take runtime information into account. All paths are equally weighted irrespectively whether they are never, heavily, or rarely executed.\u0000In this paper we present the best solution what we can theoretically obtain for probabilistic data flow problems and compare it with the state-of-the-art one-edge approach. We show that the differences can be considerable and improvements are crucial. However, the theoretically best solution is too expensive in general and feasible approaches are required. In the sequel we develop an efficient approach which employs two-edge profiling and classical data flow analysis. We show that the results of the two-edge approach are significantly better than the state-of-the-art one-edge approach.","PeriodicalId":261161,"journal":{"name":"Workshop on Dynamic and Adaptive Compilation and Optimization","volume":"11 suppl_1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123783299","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}
引用次数: 11
DyC (Panel Session) 副会长(小组讨论)
Workshop on Dynamic and Adaptive Compilation and Optimization Pub Date : 2000-07-01 DOI: 10.1145/351397.351419
R. Cytron, C. Chambers
{"title":"DyC (Panel Session)","authors":"R. Cytron, C. Chambers","doi":"10.1145/351397.351419","DOIUrl":"https://doi.org/10.1145/351397.351419","url":null,"abstract":"DyC is a selective dynamic compiler for C. It statically arranges for intraprocedural regions of a C program, selected by the user, to be compiled in part at run-time, exploiting the values of variables and data structures computed at runtime for better optimization. DyC can produce multiple versions of dynamically compiled code, each version optimized for a different combination of values of variables; DyC automatically manages the caching and reuse of dynamically generated code. Our PEPM'97 paper and our forthcoming TCS paper describe DyC's architecture, analyses, and run-time compiler generator. Our PLDI'99 paper presents experimental results and some new run-time optimizations. Our PLDI'96 paper describes our earlier, simpler system. All these papers are available from our project web page.","PeriodicalId":261161,"journal":{"name":"Workshop on Dynamic and Adaptive Compilation and Optimization","volume":"1397 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127438898","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}
引用次数: 0
Derive: a tool that automatically reverse-engineers instruction encodings 派生:一个自动逆向工程指令编码的工具
Workshop on Dynamic and Adaptive Compilation and Optimization Pub Date : 2000-07-01 DOI: 10.1145/351397.351409
D. Engler, Wilson C. Hsieh
{"title":"Derive: a tool that automatically reverse-engineers instruction encodings","authors":"D. Engler, Wilson C. Hsieh","doi":"10.1145/351397.351409","DOIUrl":"https://doi.org/10.1145/351397.351409","url":null,"abstract":"Many binary tools, such as disassemblers, dynamic code generation systems, and executable code rewriters, need to understand how machine instructions are encoded. Unfortunately, specifying such encodings is tedious and error-prone. Users must typically specify thousands of details of instruction layout, such as opcode and field locations values, legal operands, and jump offset encodings. We have built a tool called DERIVE that extracts these details from existing software: the system assembler. Users need only provide the assembly syntax for the instructions for which they want encodings. DERIVE automatically reverse-engineers instruction encoding knowledge from the assembler by feeding it permutations of instructions and doing equation solving on the output.\u0000DERIVE is robust and general. It derives instruction encodings for SPARC, MIPS, Alpha, PowerPC, ARM, and x86. In the last case, it handles variable-sized instructions, large instructions, instruction encodings determined by operand size, and other CISC features. DERIVE is also remarkably simple: it is a factor of 6 smaller than equivalent, more traditional systems. Finally, its declarative specifications eliminate the mis-specification errors that plague previous approaches, such as illegal registers used as operands or incorrect field offsets and sizes. This paper discusses our current DERIVE prototype, explains how it computes instruction encodings, and also discusses the more general implications of the ability to extract functionality from installed software.","PeriodicalId":261161,"journal":{"name":"Workshop on Dynamic and Adaptive Compilation and Optimization","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132943610","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}
引用次数: 8
Overcoming the Challenges to Feedback-Directed Optimization 克服反馈导向优化的挑战
Workshop on Dynamic and Adaptive Compilation and Optimization Pub Date : 2000-07-01 DOI: 10.1145/351403.351408
Michael D. Smith
{"title":"Overcoming the Challenges to Feedback-Directed Optimization","authors":"Michael D. Smith","doi":"10.1145/351403.351408","DOIUrl":"https://doi.org/10.1145/351403.351408","url":null,"abstract":"Feedback-directed optimization (FDO) is a general term used to describe any technique that alters a program 's execution based on tendencies observed in its present or past runs. This paper reviews the current state of affairs in FDO and discusses the challenges inhibiting further acceptance of these techniques. It also argues that current trends in hardware and software technology have resulted in an execution environment where immutable executables and traditional static optimizations are no longer sufficient. It explains how we can improve the effectiveness of our optimizers by increasing our understanding of program behavior, and it provides examples of temporal behavior that we can (or could in the future) exploit during optimization.","PeriodicalId":261161,"journal":{"name":"Workshop on Dynamic and Adaptive Compilation and Optimization","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128092063","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}
引用次数: 98
A framework for remote dynamic program optimization 远程动态程序优化框架
Workshop on Dynamic and Adaptive Compilation and Optimization Pub Date : 2000-07-01 DOI: 10.1145/351397.351413
Michael J. Voss, R. Eigenmann
{"title":"A framework for remote dynamic program optimization","authors":"Michael J. Voss, R. Eigenmann","doi":"10.1145/351397.351413","DOIUrl":"https://doi.org/10.1145/351397.351413","url":null,"abstract":"Dynamic program optimization allows programs to be generated that are highly tuned for a given environment and input data set. Optimization techniques can be applied and re-applied as program and machine characteristics are discovered and change. In most dynamic optimization and compilation frameworks, the time spent in code generation and optimization must be minimized since it is directly reflected in the total program execution time. We propose a generic framework for remote dynamic program optimization that mitigates this need. A local optimizer thread monitors the program as it executes and selects program sections that should be optimized. An optimizer, running on a remote machine or a free processor of a multiprocessor, is then called to actually perform the optimization and generate a new code variant for the section. A dynamic selector is used to select the most appropriate code variant for each code interval based upon the current runtime environment. We describe this framework in detail and present an example of its use on a simple application. We show that our framework, when used with changing input, can outperform the best statically optimized version of the application.","PeriodicalId":261161,"journal":{"name":"Workshop on Dynamic and Adaptive Compilation and Optimization","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116486725","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}
引用次数: 32
A comparative study of static and profile-based heuristics for inlining 静态和基于概要的内联启发式的比较研究
Workshop on Dynamic and Adaptive Compilation and Optimization Pub Date : 2000-07-01 DOI: 10.1145/351397.351416
Matthew Arnold, Stephen J. Fink, Vivek Sarkar, P. Sweeney
{"title":"A comparative study of static and profile-based heuristics for inlining","authors":"Matthew Arnold, Stephen J. Fink, Vivek Sarkar, P. Sweeney","doi":"10.1145/351397.351416","DOIUrl":"https://doi.org/10.1145/351397.351416","url":null,"abstract":"In this paper, we present a comparative study of static and profile-based heuristics for inlining. Our motivation for this study is to use the results to design the best inlining algorithm that we can for the Jalapeño dynamic optimizing compiler for Java [6]. We use a well-known approximation algorithm for the KNAPSACK problem as a common “meta-algorithm” for the inlining heuristics studied in this paper. We present performance results for an implementation of these inlining heuristics in the Jalapeño dynamic optimizing compiler. Our performance results show that the inlining heuristics studied in this paper can lead to significant speedups in execution time (up to 1.68x) even with modest limits on code size expansion (at most 10%).","PeriodicalId":261161,"journal":{"name":"Workshop on Dynamic and Adaptive Compilation and Optimization","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130548292","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}
引用次数: 85
Dynamic compilation in Jalapeño (Panel Session) 在Jalapeño中动态编译(小组讨论)
Workshop on Dynamic and Adaptive Compilation and Optimization Pub Date : 2000-07-01 DOI: 10.1145/351397.351425
R. Cytron, Vivek Sarkar
{"title":"Dynamic compilation in Jalapeño (Panel Session)","authors":"R. Cytron, Vivek Sarkar","doi":"10.1145/351397.351425","DOIUrl":"https://doi.org/10.1145/351397.351425","url":null,"abstract":"","PeriodicalId":261161,"journal":{"name":"Workshop on Dynamic and Adaptive Compilation and Optimization","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129982874","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}
引用次数: 0
Summary of the Dynamo '00 panel discussion (Panel Session) Dynamo '00小组讨论总结(小组讨论环节)
Workshop on Dynamic and Adaptive Compilation and Optimization Pub Date : 2000-07-01 DOI: 10.1145/351397.351426
R. Cytron, Yoo C. Chung, Michael Voss
{"title":"Summary of the Dynamo '00 panel discussion (Panel Session)","authors":"R. Cytron, Yoo C. Chung, Michael Voss","doi":"10.1145/351397.351426","DOIUrl":"https://doi.org/10.1145/351397.351426","url":null,"abstract":"","PeriodicalId":261161,"journal":{"name":"Workshop on Dynamic and Adaptive Compilation and Optimization","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124388743","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}
引用次数: 1
Tempo, a program specializer for C (Panel Session) Tempo, C语言的程序专家(小组会议)
Workshop on Dynamic and Adaptive Compilation and Optimization Pub Date : 2000-07-01 DOI: 10.1145/351397.351424
R. Cytron, R. Marlet
{"title":"Tempo, a program specializer for C (Panel Session)","authors":"R. Cytron, R. Marlet","doi":"10.1145/351397.351424","DOIUrl":"https://doi.org/10.1145/351397.351424","url":null,"abstract":"","PeriodicalId":261161,"journal":{"name":"Workshop on Dynamic and Adaptive Compilation and Optimization","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134307505","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}
引用次数: 1
Machine-adaptable dynamic binary translation 机器适应的动态二进制翻译
Workshop on Dynamic and Adaptive Compilation and Optimization Pub Date : 2000-07-01 DOI: 10.1145/351397.351414
David Ung, C. Cifuentes
{"title":"Machine-adaptable dynamic binary translation","authors":"David Ung, C. Cifuentes","doi":"10.1145/351397.351414","DOIUrl":"https://doi.org/10.1145/351397.351414","url":null,"abstract":"Dynamic binary translation is the process of translating and optimizing executable code for one machine to another at runtime, while the program is “executing” on the target machine.\u0000Dynamic translation techniques have normally been limited to two particular machines; a competitor's machine and the hardware manufacturer's machine. This research provides for a more general framework for dynamic translations, by providing a framework based on specifications of machines that can be reused or adapted to new hardware architectures. In this way, developers of such techniques can isolate design issues from machine descriptions and reuse many components and analyses.\u0000We describe our dynamic translation framework and provide some initial results obtained by using this system.","PeriodicalId":261161,"journal":{"name":"Workshop on Dynamic and Adaptive Compilation and Optimization","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131809076","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}
引用次数: 98
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信