检索结果-内蒙古大学图书馆

acm sigplan' 00 conference on programming language design and implementation (PLDI)

作者： Bodik, R Gupta, R Sarkar, V Univ Wisconsin Madison WI 53706 USA Univ Arizona Tucson AZ 85721 USA IBM Corp TJ Watson Res Ctr Yorktown Hts NY 10598 USA

To guarantee typesafe execution, Java and other strongly typed languages require bounds checking of array accesses. Because array-bounds checks may raise exceptions, they block code motion of instructions with side effects, thus preventing many useful code optimizations, such as partial redundancy elimination or instruction scheduling of memory operations. Furthermore, because it is not expressible at bytecode level, the elimination of bounds checks can only be performed at run time, after the bytecode program is loaded. Using existing powerful bounds-check optimizers at run time is not feasible, however, because they are too heavyweight for the dynamic compilation setting. ABCD is a light-weight algorithm for elimination of Array Bounds Checks on Demand. Its design emphasizes simplicity and efficiency. In essence, ABCD works by adding a few edges to the SSA value graph and performing a simple traversal of the graph. Despite its simplicity, ABCD is surprisingly powerful. On our benchmarks, ABCD removes on average 45% of dynamic bound check instructions, sometimes achieving near-ideal optimization. The efficiency of ABCD stems from two factors. First, ABCD works on a sparse representation. As a result, it requires on average fewer than 10 simple analysis steps per bounds check. Second, ABCD is demand-driven. It can be applied to a set of frequently executed (hot) bounds checks, which makes it suitable for the dynamic-compilation setting, in which compile-time cost is constrained but hot statements are known.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

A generational on-the-fly garbage collector for Java

A generational on-the-fly garbage collector for Java

引用

acm sigplan' 00 conference on programming language design and implementation (PLDI)

作者： Domani, T Kolodner, EK Petrank, E Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel

An on-the-fly garbage collector does not stop the program threads to perform the collection. Instead, the collector executes in a separate thread (or process) in parallel to the program. On-the-fly collectors are useful for multi-threaded applications running on multiprocessor servers, where it is important to fully utilize all processors and provide even response time, especially for systems for which stopping the threads is a costly operation. In this work, we report on the incorporation of generations into an on-the-fly garbage collector. The incorporation is non-trivial since an on-the-fly collector avoids explicit synchronization with the program threads. To the best of our knowledge, such an incorporation has not been tried before. We have implemented the collector for a prototype Java Virtual Machine on AIX, and measured its performance on a 4-way multiprocessor. As for other generational collectors, an on-the-fly generational collector has the potential for reducing the overall running time and working set of an application by concentrating collection efforts on the young objects. However, in contrast to other generational collectors, on-the-fly collectors do not move the objects;thus, there is no segregation between the old and the young objects. Furthermore, on-the-fly collectors do not stop the threads, so there is no extra benefit for the short pauses obtained by generational collection. Nevertheless, comparing our on-the-fly collector with and without generations, it turns out that the generational collector performs better for most applications. The best reduction in overall running time for the benchmarks we measured was 25%. However, there were some benchmarks for which it had no effect and one for which the overall running time increased by 4%.

关键词： programming languages memory management garbage collection generational garbage collection

来源：评论

学校读者我要写书评

暂无评论

An automatic object inlining optimization and its evaluation

An automatic object inlining optimization and its evaluation

引用

acm sigplan' 00 conference on programming language design and implementation (PLDI)

作者： Dolby, J Chien, AA IBM Corp TJ Watson Res Ctr Yorktown Hts NY 10598 USA Univ Calif San Diego Dept Comp Sci & Engn La Jolla CA 92093 USA

Automatic object inlining [19, 20] transforms heap data structures by fusing parent and child objects together. It can improve runtime by reducing object allocation and pointer dereference costs. We report continuing work studying object inlining optimizations. In particular, we present a new semantic derivation of the correctness conditions for object inlining, and program analysis which extends our previous work. And we present an object inlining transformation, focusing on a new algorithm which optimizes class field layout to minimize code expansion. Finally, we detail a fuller evaluation on eleven programs and libraries (including Xpdf, the 25,000 line Portable Document Format (PDF) file browser) that utilizes hardware measures of impact on the memory system. We show that our analysis scales effectively to large programs, finding many inlinable fields (45 in xpdf) at acceptable cost, and we show that, on some programs, it finds nearly all fields for which object inlining is correct, and averages 40% of such fields across our benchmarks. We implement our analyses in an advanced analysis infrastructure, and we show that, compared to traditional 1-CFA, that infrastructure provides better results and lower and more scalable cost. Across all programs, analysis identified about 30% of objects as inlinable on average. Our transformation increases code size by only 20% while inlining this 30% of fields. Inlining these objects eliminated on average 28% of field reads, 58% of object creations, 12% of all loads. Further, the optimized programs have significantly improved memory reference behavior, producing 25% fewer L1 data cache misses and 25% fewer read stalls. On average the runtime improved by 14%.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Analysis, design and implementation of an object-oriented framework in Ada95 5th

引用

5th Ada-Europe International conference on Reliable Software Technologies

作者： Schmitt, D Sema Grp GmbH D-26389 Wilhelmshaven Germany Open Univ Milton Keynes MK7 6AA Bucks England

ISBN: (纸本)3540676694

This paper describes the analysis, design and implementation of an object-oriented framework for discrete event simulation in the programming language Ada95. The framework was constructed in an industrial setting so that conclusions are drawn from first-hand, practical experience with this approach. After defining the term 'Object-Oriented Framework', discrete event simulation is analyzed as the domain of concern in the given context, producing a class diagram for that domain in the Unified Modelling language (UML). Following the analysis activities, the framework is designed and described, again using diagrams of the UML. In further sections the mapping from design artifacts to code in Ada95 and the usage of the framework are shown. The article finishes with a summary of the experience gained and the lessons learned.

关键词： frameworks object-oriented technologies experience reports from projects using Ada95 case studies and experiments

来源：评论

学校读者我要写书评

暂无评论

Multi-dispatch in the Java Virtual Machine: design and implementation

Multi-dispatch in the Java Virtual Machine: Design and imple...

引用

2000 conference on Object-Oriented programming, Systems, languages, and Applications, OOPSLA 2000

作者： Dutchyn, Christopher Lu, Paul Szafron, Duane Bromling, Steve Holst, Wade Department of Computing Science University of Alberta Edmonton AB T6G 2E8 Canada Department of Computer Science University of Western Ontario MiddleSex College London ON N6A 5B7 Canada

ISBN: (纸本)1581133073

Mainstream object-oriented languages, such as C++ and Java, provide only a restricted form of polymorphic methods, namely single-receiver dispatch. In common programming situations, programmers must work-around this limitation. We detail how to extend the Java Virtual Machine to support multiple-dispatch and examine the complications that Java imposes on multiple-dispatch in practice. Our technique avoids changes to the Java programming language itself, maintains source-code and library compatibility, and isolates the performance penalty and semantic changes of multiple-dispatch to the program sections which use it. We have micro-benchmark and application-level performance results for a dynamic Most Specific Applicable (MSA) dispatcher, two table-based dispatchers (Multiple Row Displacement (MRD) and Single Receiver Projections (SRP)), and a tuned SRP dispatcher. Our general-purpose technique provides smaller dispatch latency than equivalent programmer-written double-dispatch code. © 2000 acm.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Modular interprocedural pointer analysis using access paths: design, implementation, and evaluation 00

Modular interprocedural pointer analysis using access paths:...

引用

Proceedings of the acm sigplan 2000 conference on programming language design and implementation

作者： Ben-Chung Cheng Wen-Mei W. Hwu Department of Computer Science University of Illinois Department of Electrical and Computer Engineering University of Illinois

ISBN: (纸本)9781581131994

In this paper we present a modular interprocedural pointer analysis algorithm based on access-paths for C programs. We argue that access paths can reduce the overhead of representing context-sensitive transfer functions and effectively distinguish non-recursive heap objects. And when the modular analysis paradigm is used together with other techniques to handle type casts and function pointers, we are able to handle significant programs like those in the SPECcint92 and SPECcint95 suites. We have implemented the algorithm and tested it on a Pentium II 450 PC running Linux. The observed resource consumption and performance improvement are very encouraging.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A single intermediate language that supports multiple implementations of exceptions 00

A single intermediate language that supports multiple implem...

引用

Proceedings of the acm sigplan 2000 conference on programming language design and implementation

作者： Norman Ramsey Simon Peyton Jones Harvard University Microsoft Research Ltd

ISBN: (纸本)9781581131994

We present mechanisms that enable our compiler-target language, C--, to express four of the best known techniques for implementing exceptions, all within a single, uniform framework. We define the mechanisms precisely, using a formal operational semantics. We also show that exceptions need not require special treatment in the optimizer; by introducing extra dataflow edges, we make standard optimization techniques work even on programs that use exceptions. Our approach clarifies the design space of exception-handling techniques, and it allows a single optimizer to handle a variety of implementation techniques. Our ultimate goal is to allow a source-language compiler the freedom to choose its exception-handling policy, while encapsulating the architecture-dependent mechanisms and their optimization in an implementation of C--that can be used by compilers for many source languages.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A generational on-the-fly garbage collector for Java 00

A generational on-the-fly garbage collector for Java

引用

Proceedings of the acm sigplan 2000 conference on programming language design and implementation

作者： Tamar Domani Elliot K. Kolodner Erez Petrank IBM Haifa Research Lab. Computer Science Dept. Technion - Israel Institute of Technology

ISBN: (纸本)9781581131994

An on-the-fly garbage collector does not stop the program threads to perform the collection. Instead, the collector executes in a separate thread (or process) in parallel to the program. On-the-fly collectors are useful for multi-threaded applications running on multiprocessor servers, where it is important to fully utilize all processors and provide even response time, especially for systems for which stopping the threads is a costly operation. In this work, we report on the incorporation of generations into an on-the-fly garbage collector. The incorporation is non-trivial since an on-the-fly collector avoids explicit synchronization with the program threads. To the best of our knowledge, such an incorporation has not been tried before. We have implemented the collector for a prototype Java Virtual Machine on AIX, and measured its performance on a 4-way *** for other generational collectors, an on-the-fly generationalcollector has the potential for reducing the overall running time and working set of an application by concentrating collection efforts on the young objects. However, in contrast to other generational collectors,on-the-fly collectors do not move the objects; thus, there is no segregation between the old and the young objects. Furthermore, on-the-fly collectors do not stop the threads, so there is no extra benefit for the short pauses obtained by generational collection. Nevertheless, comparing our on-the-fly collector with and without generations, it turns out that the generational collector performs better for most applications. The best reduction in overall running time for the benchmarks we measured was 25%. However, there were some benchmarks for which it had no effect and one for which the overall running time increased by 4%.

关键词： memory management generational garbage collection programming languages garbage collection

来源：评论

学校读者我要写书评

暂无评论

Once upon a polymorphic type

Conference Record of the Annual ACM Symposium on Principles ...

引用

conference Record of the Annual acm Symposium on Principles of programming languages 1999年 15-28页

作者： Wansbrough, Keith Jones, Simon Peyton Univ of Cambridge Cambridge United Kingdom

We present a sound type-based `usage analysis' for a realistic lazy functional language. Accurate information on the usage of program subexpressions in a lazy functional language permits a compiler to perform a number of useful optimizations. However, existing analyses are either ad-hoc and approximate, or defined over restricted languages. Our work extends the Once Upon A Type system of Turner, Mossin, and Wadler (FPCA'95). Firstly, we add type polymorphism, an essential feature of typed functional programming languages. Secondly, we include general Haskell-style user-defined algebraic data types. Thirdly, we explain and solve the `poisoning problem', which causes the earlier analysis to yield poor results. Interesting design choices turn up in each of these areas. Our analysis is sound with respect to a Launchbury-style operational semantics, and it is straightforward to implement. Good results have been obtained from a prototype implementation, and we are currently integrating the system into the Glasgow Haskell Compiler.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Once upon a polymorphic type 99

Once upon a polymorphic type

引用

The 1999 26th Annual acm sigplan-SIGACT Symposium on Principles of programming language, POPL'99

作者： Wansbrough, Keith Jones, Simon Peyton Univ of Cambridge Cambridge United Kingdom

ISBN: (纸本)9781581130959

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：