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

proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Wickline, Philip Lee, Peter Pfenning, Frank Carnegie Mellon Univ Pittsburgh PA United States

ISBN: (纸本)9780897919876

This paper presents a typed programming language and compiler for run-time code generation. The language, called ML, extends ML with modal operators in the style of the Mini-MLe language of Davies and Pfenning. ML allows programmers to use types to specify precisely the stages of computation in a program. The types also guide the compiler in generating target code that exploits the staging information through the use of run-time code generation. The target machine is currently a version of the Categorical Abstract Machine, called the CCAM, which we have extended with facilities for run-time code generation. This approach allows the programmer to express the staging that he wants directly to the compiler. It also provides a typed framework in which to verify the correctness of his staging intentions, and to discuss his staging decisions with other programmers. Finally, it supports in a natural way multiple stages of run-time specialization, so that dynamically generated code can be used in the generation of yet further specialized code. This paper presents an overview of the language, with several examples of programs that illustrate key concepts and programming techniques. Then, it discusses the CCAM and the compilation of ML programs into CCAM code. Finally, the results of some experiments are shown, to demonstrate the benefits of this style of run-time code generation for some applications.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Using integer sets for data-parallel program analysis and optimization

Using integer sets for data-parallel program analysis and op...

引用

proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Adve, Vikram Mellor-Crummey, John Rice Univ Houston United States

In this paper, we describe our experience with using an abstract integer-set framework to develop the Rice dHPF compiler, a compiler for High Performance Fortran. We present simple, yet general formulations of the major computation partitioning and communication analysis tasks as well as a number of important optimizations in terms of abstract operations on sets of integer tuples. This approach has made it possible to implement a comprehensive collection of advanced optimizations in dHPF, and to do so in the context of a more general computation partitioning model than previous compilers. One potential limitation of the approach is that the underlying class of integer set problems is fundamentally unable to represent HPF data distributions on a symbolic number of processors. We describe how we extend the approach to compile codes for a symbolic number of processors, without requiring any changes to the set formulations for the above optimizations. We show experimentally that the set representation is not a dominant factor in compile times on both small and large codes. Finally, we present preliminary performance measurements to show that the generated code achieves good speedups for a few benchmarks. Overall, we believe we are the first to demonstrate by implementation experience that it is practical to build a compiler for HPF using a general and powerful integer-set framework.

关键词： FORTRAN (programming language)

来源：评论

学校读者我要写书评

暂无评论

Improving performance by branch reordering 98

Improving performance by branch reordering

引用

proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Yang, Minghui Uh, Gang-Ryung Whalley, David B. Florida State Univ Tallahassee FL United States

ISBN: (纸本)9780897919876

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 reflect 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.

关键词： Computer systems programming

来源：评论

学校读者我要写书评

暂无评论

Scalable cross-module optimization

Scalable cross-module optimization

引用

proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Ayers, Andrew de Jong, Stuart Peyton, John Schooler, Richard Hewlett-Packard Massachusetts Language Lab Chelmsford United States

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 cross-module 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%.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

Type-based alias analysis 98

Type-based alias analysis

引用

proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Diwan, Amer McKinley, Kathryn S. Moss, J.Eliot B. Stanford Univ Stanford CA United States

ISBN: (纸本)9780897919876

This paper evaluates three alias analyses based on programming language types. The first analysis uses type compatibility to determine aliases. The second extends the first by using additional high-level information such as field names. The third extends the second with a flow-insensitive analysis. Although other researchers suggests using types to disambiguate memory references, none evaluates its effectiveness. We perform both static and dynamic evaluations of type-based alias analyses for Modula-3, a statically-typed type-safe language. The static analysis reveals that type compatibility alone yields a very imprecise alias analysis, but the other two analyses significantly improve alias precision. We use redundant load elimination (RLE) to demonstrate the effectiveness of the three alias algorithms in terms of the opportunities for optimization, the impact on simulated execution times, and to compute an upper bound on what a perfect alias analysis would yield. We show modest dynamic improvements for (RLE), and more surprisingly, that on average our alias analysis is within 2.5% of a perfect alias analysis with respect to RLE on 8 Modula-3 programs. These results illustrate that to explore thoroughly the effectiveness of alias analyses, researchers need static, dynamic, and upper-bound analysis. In addition, we show that for type-safe languages like Modula-3 and Java, a fast and simple alias analysis may be sufficient for many applications.

关键词： Computer systems programming

来源：评论

学校读者我要写书评

暂无评论

Garbage collection and local variable type-precision and liveness in JavaTM virtual machines

Garbage collection and local variable type-precision and liv...

引用

proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Agesen, Ole Detlefs, David Moss, J.Eliot B. Sun Microsystems Lab Chelmsford United States

Full precision in garbage collection implies retaining only those heap allocated objects that will actually be used in the future. Since full precision is not computable in general, garbage collectors use safe (i.e., conservative) approximations such as reachability from a set of root references. Ambiguous roots collectors (commonly called `conservative') can be overly conservative because they overestimate the root set, and thereby retain unexpectedly large amounts of garbage. We consider two more precise collection schemes for Java virtual machines (JVMs). One uses a type analysis to obtain a type-precise root set (only those variables that contain references);the other adds a live variable analysis to reduce the root set to only the live reference variables. Even with the Java programming language's strong typing, it turns out that the JVM specification has a feature that makes type-precise root sets difficult to compute. We explain the problem and ways in which it can be solved. Our experimental results include measurements of the costs of the type and liveness analyses at load time, of the incremental benefits at run time of the liveness analysis over the type analysis alone, and of various map sizes and counts. We find that the liveness analysis often produces little or no improvement in heap size, sometimes modest improvements, and occasionally the improvement is dramatic. While further study is in order, we conclude that the main benefit of the liveness analysis is preventing bad surprises.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Hardware/software co-design: VHDL and Ada 95 code migration and integrated analysis 98

Hardware/software co-design: VHDL and Ada 95 code migration ...

引用

1998 Annual acm SIGAda International conference on Ada, SIGAda 1998

作者： Mills, Mike Peterson, Greg Air Force Research Lab. Information Technology Division Wright-Patterson AFBOH United States

ISBN: (纸本)1581130333

Optimizing the design of complex weapons systems constitutes an important task in efficiently developing and deploying effective complex weapons systems. Often architectural tradeoffs between hardware and software implementation must be performed early in the design cycle, resulting in potentially inefficient systems or subsystems. As technologies and costs in hardware and software implementation change over time, the best partitioning of system functionality into hardware and software components will also change. Currently, recasting a component from hardware to software (or vice-versa) is a difficult and error-prone activity. This paper explores a new approach to ease the hardware software co-design and repartitioning activities by providing a mechanism to exchange software written in Ada 95 with behavioral VHDL.

关键词： Computer hardware description languages

来源：评论

学校读者我要写书评

暂无评论

MAP: A functional analysis and design method

Proceedings of the ACM SIGPLAN International Conference on F...

引用

proceedings of the acm sigplan International conference on Functional programming, ICFP 1998年 342-342页

作者： Russell, Dan Kingston Univ Surrey United Kingdom

MAP has been developed to address the need for an analysis and design method which directly supports software development using a functional language. MAP breaks down software development into a set of manageable and linked techniques which are combined to make a productive whole. In addition, it can be used as a natural communication medium which avoids the idiosyncracies of particular implementation languages, and through CASE tool support can act as an effective and efficient consistency checker.

关键词： Software engineering

来源：评论

学校读者我要写书评

暂无评论

Class to survey application programming topics

Class to survey application programming topics

引用

proceedings of the 1998 29th SIGCSE Technical Symposium on Computer Science Education, SIGCSE

作者： Drake, Janet M. Univ of Northern Iowa Cedar Falls United States

This paper describes a class that we developed at the University of Northern Iowa to address covering the topics suggested in acm/IEEE Computing Curricula 1991. All junior level students take this course, and thus are ensured of a minimum introduction to the topics of software engineering, database management, human computer interfaces, and computer ethics. This paper describes the course and lessons learned in teaching the course. One of the benefits of the course is that it introduces abstract modeling (entity-relationship model) and the model is used in a life cycle that includes analysis, design, implementation, and test. Students see how a model fits into software development and the benefits of modeling. The greatest challenge in the course is finding a coordinated text book that adequately covers all the topics in the course.

关键词： Computer science

来源：评论

学校读者我要写书评

暂无评论

Making the future safe for the past: adding genericity to the Java programming language 98

Making the future safe for the past: adding genericity to th...

引用

proceedings of the 13th acm sigplan conference on Object-oriented programming, systems, languages, and applications

作者： Gilad Bracha Martin Odersky David Stoutamire Philip Wadler Sun Microsystems University of South Australia Bell Labs Lucent Technologies

ISBN: (纸本)9781581130058

We present GJ, a design that extends the Java programming language with generic types and methods. These are both explained and implemented by translation into the unextended language. The translation closely mimics the way generics are emulated by programmers: it erases all type parameters, maps type variables to their bounds, and inserts casts where needed. Some subtleties of the translation are caused by the handling of *** increases expressiveness and safety: code utilizing generic libraries is no longer buried under a plethora of casts, and the corresponding casts inserted by the translation are guaranteed to not *** is designed to be fully backwards compatible with the current Java language, which simplifies the transition from non-generic to generic programming. In particular, one can retrofit existing library classes with generic interfaces without changing their *** implementation of GJ has been written in GJ, and is freely available on the web.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：