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

23rd acm conference on Object-Oriented programming Systems, languages, and Applications, OOPSLA 2008

作者： Ni, Yang Welc, Adam Adl-Tabatabai, Ali-Reza Bach, Moshe Berkowits, Sion Cownie, James Geva, Robert Kozhukow, Sergey Narayanaswamy, Ravi Olivier, Jeffrey Preis, Serguei Saha, Bratin Tal, Ady Tian, Xinmin Intel Corporation Santa Clara CA USA Intel Corporation Haifa Israel Intel Corporation Glasgow United Kingdom Intel Corporation Novosibirsk Russian Fed. Intel Corporation Champaign IL USA Intel Coporation Novosibirsk Russian Fed.

ISBN: (纸本)9781605582153

This paper presents a software transactional memory system that introduces first-class C++ language constructs for transactional programming. We describe new C++ language extensions, a production-quality optimizing C++ compiler that translates and optimizes these extensions, and a high-performance STM runtime library. The transactional language constructs support C++ language features including classes, inheritance, virtual functions, exception handling, and templates. The compiler automatically instruments the program for transactional execution and optimizes TM overheads. The runtime library implements multiple execution modes and implements a novel STM algorithm that supports both optimistic and pessimistic concurrency control. The runtime switches a transaction's execution mode dynamically to improve performance and to handle calls to precompiled functions and I/O libraries. We present experimental results on 8 cores (two quad-core CPUs) running a set of 20 non-trivial parallel programs. Our measurements show that our system scales well as the numbers of cores increases and that our compiler and runtime optimizations improve scalability. Copyright © 2008 acm.

关键词： Concurrency control

来源：评论

学校读者我要写书评

暂无评论

Rematerialization

Rematerialization

引用

acm sigplan '92 conference on programming language design and implementation, PLDI 1992

作者： Briggs, Preston Cooper, Keith D. Torczon, Linda Rice Univ Houston TX United States

ISBN: (纸本)0897914759

This paper examines a problem that arises during global register allocation - rematerialization. If a value cannot be kept in a register, the allocator should recognize when it is cheaper to recompute the value (rematerialize it) than to store and reload it. Chaitin's original graph-coloring allocator handled simple instances of this problem correctly. This paper details a general solution to the problem and presents experimental evidence that shows its importance. Our approach is to tag individual values in the procedure's SSA graph with information specifying how it should be spilled. We use a variant of Wegman and Zadeck's sparse simple constant algorithm to propagate tags throughout the graph. The allocator then splits live ranges into values with different tags. This isolates those values that can be easily rematerialized from values that require general spilling. We modify the base allocator to use this information when estimating spill costs and introducing spill code. Our presentation focuses on rematerialization in the context of Chaitin's allocator;however, the problem arises in any global allocator. We believe that our approach will work in other allocators - while the details of implementation will vary, the key insights should carry over directly.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

language support for connector abstractions 17th

引用

17th European conference on Object-Oriented programming (ECOOP 2003)

作者： Aldrich, J Sazawal, V Chambers, C Notkin, D Univ Washington Dept Comp Sci & Engn Seattle WA 98195 USA

ISBN: (纸本)3540405313

Software connectors are increasingly recognized as an important consideration in the design and implementation of object-oriented software systems. Connectors can be used to communicate across a distributed system, coordinate the activities of several objects, or adapt one object's interface to the interface of another. Mainstream object-oriented languages, however, do not provide explicit support for connectors. As a result, connection code is intermingled with application code, making it difficult to understand, evolve, and reuse connection mechanisms. In this paper, we add language support for user-defined connectors to the ArchJava language. Our design enables a wide range of connector abstractions, including caches, events, streams, and remote method calls. Developers can describe both the run-time semantics of connectors and the typechecking semantics. The connector abstraction supported by ArchJava cleanly separates reusable connection code from application logic, making the semantics of connections more explicit and allowing engineers to easily change the connection mechanisms used in a program. We evaluate the expressiveness and the engineering benefits of our design in a case study applying ArchJava to the PlantCare ubiquitous computing application.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Theory of type qualifiers

Proceedings of the ACM SIGPLAN Conference on Programming Lan...

引用

Proceedings of the acm sigplan conference on programming language design and implementation (PLDI) 1999年 192-203页

作者： Foster, Jeffrey S. Fahndrich, Manuel Aiken, Alexander Univ of California Berkeley United States

We describe a framework for adding type qualifiers to a language. Type qualifiers encode a simple but highly useful form of subtyping. Our framework extends standard type rules to model the flow of qualifiers through a program, where each qualifier or set of qualifiers comes with additional rules that capture its semantics. Our framework allows types to be polymorphic in the type qualifiers. We present a const-inference system for C as an example application of the framework. We show that for a set of real C programs, many more consts can be used than are actually present in the original code.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Abstractions for recursive pointer data structures. Improving the analysis and transformation of imperative programs

Abstractions for recursive pointer data structures. Improvin...

引用

acm sigplan '92 conference on programming language design and implementation, PLDI 1992

作者： Hendren, Laurie J. Hummel, Joseph Nicolau, Alexandru McGill Univ

ISBN: (纸本)0897914759

Even though impressive progress has been made in the area of optimizing and parallelizing programs with arrays, the application of similar techniques to programs with pointer data structures has remained difficult. In this paper we introduce a new approach that leads to improved analysis and transformation of programs with recursively-defined pointer data structures. Our approach is based on a mechanism for the Abstract Description of Data Structures (ADDS), which makes explicit the important properties, such as dimensionality, of pointer data structures. Numerous examples demonstrate that ADDS definitions are both natural to specify and flexible enough to describe complex, cyclic pointer data structures. We discuss how an abstract data structure description can improve program analysis by presenting an analysis approach that combines an alias analysis technique, path matrix analysis, with information available from an ADDS declaration. Given this improved alias analysis technique, we provide a concrete example of applying a software pipelining transformation to loops involving pointer data structures.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Essential language support for generic programming

引用

acm sigplan NOTICES 2005年第6期40卷 73-84页

作者： Siek, J Lumsdaine, A Indiana Univ Open Syst Lab Bloomington IN 47405 USA

Concepts are an essential language feature for generic programming in the large. Concepts allow for succinct expression of constraints on type parameters of generic algorithms, enable systematic organization of problem domain abstractions, and make generic algorithms easier to use. In this paper we present the design of a type system and semantics for concepts that is suitable for non-type-inferencing languages. Our design shares much in common with the type classes of Haskell, though our primary influence is from best practices in the C++ community, where concepts are used to document type requirements for templates in generic libraries. Concepts include a novel combination of associated types and same-type constraints that do not appear in type classes, but that are similar to nested types and type sharing in ML.

关键词： generic programming polymorphism C++ standard ML Haskell

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the Strathclyde ALGOL 68 conference 1977

Proceedings of the Strathclyde ALGOL 68 Conference 1977

引用

Strathclyde ALGOL 68 conference 1977

The proceedings contain 25 papers. The topics discussed include: derivatives without tears in Algol 68;'run-time profiling of Algol 68-R programs using DIDYMUS and SCAMP';quantifying the test effectiveness of Algol 68 progra;some remarks on new instances and garbage collection;LL versus LR parsing with illustrations from ALGOL 68;Algol 68 as an implementation language for portable interpreters;description of dynamic manipulation of ALGOL68 values using a generative grammar;towards a machine-independent transput section;towards the design of a super-language of ALGOL 68 for the standard prelude (excerpt);and some problems concerning the automatic translation of Fortran to Algol 68.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Pointer analysis for multithreaded programs

Proceedings of the ACM SIGPLAN Conference on Programming Lan...

引用

Proceedings of the acm sigplan conference on programming language design and implementation (PLDI) 1999年 77-90页

作者： Rugina, Radu Rinard, Martin Massachusetts Inst of Technology Cambridge MA United States

This paper presents a novel interprocedural, flow-sensitive, and context-sensitive pointer analysis algorithm for multi-threaded programs that may concurrently update shared pointers. For each pointer and each program point, the algorithm computes a conservative approximation of the memory locations to which that pointer may point. The algorithm correctly handles a full range of constructs in multi-threaded programs, including recursive functions, function pointers, structures, arrays, nested structures and arrays, pointer arithmetic, casts between pointer variables of different types, heap and stack allocated memory, shared global variables, and thread-private global variables. We have implemented the algorithm in the SUIF compiler system and used the implementation to analyze a sizable set of multithreaded programs written in the Cilk multi-threaded programming language. Our experimental results show that the analysis has good precision and converges quickly for our set of Cilk programs.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Understanding the propagation of hard errors to software and implications for resilient system design

Understanding the propagation of hard errors to software and...

引用

13th International conference on Architectural Support for programming languages and Operating Systems

作者： Li, Man-Lap Ramachandran, Pradeep Sahoo, Swarup K. Adve, Sarita V. Adve, Vikram S. Zhou, Yuanyuan Univ Illinois Dept Comp Sci Urbana IL 61801 USA

ISBN: (纸本)9781595939586

With continued CMOS scaling, future shipped hardware will be increasingly vulnerable to in-the-field faults. To be broadly deployable, the hardware reliability solution must incur low overheads, precluding use of expensive redundancy. We explore a cooperative hardware-software solution that watches for anomalous software behavior to indicate the presence of hardware faults. Fundamental to such a solution is a characterization of how hardware faults in different micro architectural structures of a modern processor propagate through the application and OS. This paper aims to provide such a characterization, resulting in identifying low-cost detection methods and providing guidelines for implementation of the recovery and diagnosis components of such a reliability solution. We focus on hard faults because they are increasingly important and have different system implications than the much studied transients. We achieve our goals through fault injection experiments with a micro architecture-level full system timing simulator. Our main results are: (1) we are able to detect 95% of the unmasked faults in 7 out of 8 studied micro architectural structures with simple detectors that incur zero to little hardware overhead;(2) over 86% of these detections are within latencies that existing hardware checkpointing schemes can handle, while others require software checkpointing;and (3) a surprisingly large fraction of the detected faults corrupt OS state, but almost all of these are detected with latencies short enough to use hardware checkpointing, thereby enabling OS recovery in virtually all such cases.

关键词： reliability experimentation design error detection architecture permanent fault fault injection

来源：评论

学校读者我要写书评

暂无评论

design of a class mechanism for MOBY

Proceedings of the ACM SIGPLAN Conference on Programming Lan...

引用

Proceedings of the acm sigplan conference on programming language design and implementation (PLDI) 1999年 37-49页

作者： Fisher, Kathleen Reppy, John AT&T Lab United States

Typical class-based languages, such as C++ and JAVA, provide complex class mechanisms but only weak module systems. In fact, classes in these languages incorporate many of the features found in richer module mechanisms. In this paper, we describe an alternative approach to designing a language that has both classes and modules. In our design, we rely on a rich ML-style module system to provide features such as visibility control and parameterization, while providing a minimal class mechanism that includes only those features needed to support inheritance. Programmers can then use the combination of modules and classes to implement the full range of class-based features and idioms. Our approach has the advantage that it provides a full-featured module system (useful in its own right), while keeping the class mechanism quite simple. We have incorporated this design in MOBY, which is an ML-style language that supports class-based object-oriented programming. In this paper, we describe our design via a series of simple examples, show how various class-based features and idioms are realized in MOBY, compare our design with others, and sketch its formal semantics.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：