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

Classbox/J: Controlling the scope of change in Java

acm sigplan NOTICES 2005年第10期40卷 177-189页

作者： Bergel, A Ducasse, S Nierstrasz, O Univ Bern Software Composit Grp Bern Switzerland Univ Savoie Language & Software Evolut Grp LISTIC Chambery France

Unanticipated changes to complex software systems can introduce anomalies such as duplicated code, suboptimal inheritance relationships and a proliferation of run-tirne downcasts. Refactoring to eliminate these anomalies may not be an option, at least in certain stages of software evolution. Classboxes are modules that restrict the visibility of changes to selected clients only, thereby offering more freedom in the way unanticipated changes may be implemented, and thus reducing the need for convoluted design anomalies. In this paper we demonstrate how classboxes can be implemented in statically-typed languages like Java. We also present an extended case study of Swing, a Java GUI package built on top of AWT, and we document the ensuing anomalies that Swing introduces. We show how Classbox/J, a prototype implementation of classboxes for Java, is used to provide a cleaner implementation of Swing using local refinement rather than subclassing.

关键词： language design module package open-classes class extension

来源：评论

学校读者我要写书评

暂无评论

Compiling a High-Level language for GPUs 12

Compiling a High-Level Language for GPUs

引用

acm sigplan conference on programming language design and implementation

作者： Christophe Dubach Perry Cheng Rodric Rabbah David F. Bacon Stephen J. Fink University of Edinburgh IBM Research

ISBN: (纸本)9781450312059

languages such as OpenCL and CUDA offer a standard interface for general-purpose programming of GPUs. However, with these languages, programmers must explicitly manage numerous low-level details involving communication and synchronization. This burden makes programming GPUs difficult and error-prone, rendering these powerful devices inaccessible to most programmers. We desire a higher-level programming model that makes GPUs more accessible while also effectively exploiting their computational power. This paper presents features of Lime, a new Java-compatible language targeting heterogeneous systems, that allow an optimizing compiler to generate high quality GPU code. The key insight is that the language type system enforces isolation and immutability invariants that allow the compiler to optimize for a GPU without heroic compiler analysis. Our compiler attains GPU speedups between 75% and 140% of the performance of native OpenCL code.

关键词： design languages Performance GPU OpenCL Java Lime Streaming Map Reduce language Streaming GRAPPER PICK UP Graphics Processing Unit lime Reduce Java Java programming language compilers MAPPING(MATHEMATICAL) language form Computer personnel high level language(hll) Optimising compilers general purpose programming

来源：评论

学校读者我要写书评

暂无评论

Scalable certification framework for behavioral synthesis front-end 14

Scalable certification framework for behavioral synthesis fr...

引用

51st Annual design Automation conference, DAC 2014

作者： Yang, Zhenkun Hao, Kecheng Cong, Kai Lei, Li Ray, Sandip Xie, Fei Department of Computer Science Portland State University Portland OR 97207 United States Strategic CAD Labs Intel Corporation Hillsboro OR 97124 United States

ISBN: (纸本)9781479930173

Behavioral synthesis entails application of a sequence of transformations to compile a high-level description of a hardware design (e.g., in C/C++/SystemC) into a register-transfer level (RTL) implementation. In this paper, we present a scalable equivalence checking framework to validate the correctness of compiler transformations employed by behavioral synthesis front-end. Our approach makes use of dual-rail symbolic simulation of the input and output of a transformation, together with identication and inductive verication of their loop structures. We have evaluated our framework on transformations applied by an open source behavioral synthesis tool to designs from the CHStone benchmark. Our tool can automatically validate more than 75 percent of the total of 1008 compiler transformations applied. Copyright 2014 acm.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

programming by sketching for bit-streaming programs

引用

acm sigplan NOTICES 2005年第6期40卷 281-294页

作者： Solar-Lezama, A Rabbah, R Bodík, R Ebcioglu, K Univ Calif Berkeley Div Comp Sci Berkeley CA 94720 USA MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA IBM Corp TJ Watson Res Ctr Armonk NY 10504 USA

This paper introduces the concept of programming with sketches, an approach for the rapid development of high-performance applications. This approach allows a programmer to write clean and portable reference code, and then obtain a high-quality implementation by simply sketching the outlines of the desired implementation. Subsequently, a compiler automatically fills in the missing details while also ensuring that a completed sketch is faithful to the input reference code. In this paper, we develop StreamBit as a sketching methodology for the important class of bit-streaming programs (e.g., coding and cryptography). A sketch is a partial specification of the implementation, and as such, it affords several benefits to programmer in terms of productivity and code robustness. First, a sketch is easier to write compared to a complete implementation. Second, sketching allows the programmer to focus on exploiting algorithmic properties rather than on orchestrating low-level details. Third, a sketch-aware compiler rejects "buggy" sketches, thus improving reliability while allowing the programmer to quickly evaluate sophisticated implementation ideas. We evaluated the productivity and performance benefits of our programming methodology in a user-study, where a group of novice StreamBit programmers competed with a group of experienced C programmers on implementing a cipher. We learned that, given the same time budget, the ciphers developed in StreamBit ran 2.5 x faster than ciphers coded in C. We also produced implementations of DES and Serpent that were competitive with hand optimized implementations available in the public domain.

关键词： stream programming StreamIt synchronous dataflow sketching domain specific language domain specific compiler

来源：评论

学校读者我要写书评

暂无评论

7th European conference on Object-Oriented programming, ECOOP 1993

引用

7th European conference on Object-Oriented programming, ECOOP 1993

ISBN: (纸本)9783540571209

The proceedings contain 26 papers. The special focus in this conference is on Object-Oriented programming. The topics include: Active programming strategies in reuse;frameworks in the financial engineering domain an experience report;integrating independently-developed components in object-oriented languages;encapsulating plurality;object oriented interoperability;implementation of distributed trellis;a new definition of the subtype relation;attaching second-order types to methods in an object-oriented language;typed sets as a basis for object-oriented database schemas;the OSI managed-object model;nested mixin-methods in agora;solving the inheritance anomaly in concurrent object-oriented programming;type inference of self;predicate classes;a temporal object-oriented algebra;a timed calculus for distributed objects with clocks;a language framework for multi-object coordination;panda — supporting distributed programming in C++;transparent parallelisation through reuse: between a compiler and a library approach;design patterns: abstraction and reuse of object-oriented design;tangible specification of reactive object behavior;an agent perspective;designing an extensible distributed language with a meta-level architecture;a flexible metaclass generator and aims, means, and futures of object-oriented languages.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Higher-Order and Tuple-Based Massively-Parallel Prefix Sums

引用

acm sigplan NOTICES 2016年第6期51卷 539-552页

作者： Maleki, Sepideh Yang, Annie Burtscher, Martin Texas State Univ Dept Comp Sci San Marcos TX 78666 USA

Prefix sums are an important parallel primitive, especially in massively-parallel programs. This paper discusses two orthogonal generalizations thereof, which we call higher-order and tuple-based prefix sums. Moreover, it describes and evaluates SAM, a GPU-friendly algorithm for computing prefix sums and other scans that directly supports higher orders and tuple values. Its templated CUDA implementation unifies all of these computations in a single 100-statement kernel. SAM is communication-efficient in the sense that it minimizes main-memory accesses. When computing prefix sums of a million or more values, it outperforms Thrust and CUDPP on both a Titan X and a K40 GPU. On the Titan X, SAM reaches memory-copy speeds for large input sizes, which cannot be surpassed. SAM outperforms CUB, the currently fastest conventional prefix sum implementation, by up to a factor of 2.9 on eighth-order prefix sums and by up to a factor of 2.6 on eight-tuple prefix sums.

关键词： Algorithms Performance design Higher-order prefix sums tuple-based prefix sums carry propagation GPU programming

来源：评论

学校读者我要写书评

暂无评论

Effects of Ada on design problems in a discrete event simulator

Effects of Ada on design problems in a discrete event simula...

引用

conference on TRI-ADA 1990

作者： Railsback, Philip E. Rose, Louis C. Corrigan, Ann E. Logicon Incorporated 2100 Washington Boulevard Arlington VA 22204-5704 United States

ISBN: (纸本)0897914090

Overall, our experience using the Ada programming language proved to be a valuable one. We believe that using an alternate high level language would not have allowed us to maintain the tight schedule of the evolutionary development of ISAAC. Clearly, the software engineering orientation of Ada was key to the success of the ISAAC simulator. Our desired to maintain an object orientation during the design and implementation process proved useful but was a bit cumbersome at times. While there are several methods to emulate some form of inheritance in Ada, the lack of a controlled two way communication mechanism between objects is a significant restriction with Ada as it relates to object oriented methodologies. We were fortunate to have the event queue in the simulator available to allow an efficient implementation of the two way communications we required. The technique used for implementing the Task Manager's data structure followed a standard paradigm for implementing a data architecture documented in an Entity-Relation-Attribute form. This technique was successful, which suggests to us the possibility of directly compiling the extended E-R-A model (including the relation characteristics used for choosing implementation structures). Extending a language to support directly an abstract Entity-Relation model would eliminate the need for coding data structures and data management algorithms, greatly reduce development time, and will result in better designs by encouraging design at an abstract level. The use of generics in the component architecture was extremely valuable in support of the abstract data entities implementation as well as significantly reducing the overall integration testing effort Although our emphasis in this paper on the use of component architecture was concentrated on the use in the Maintenance Manager, many of these generics were used in the Operations and Resource Managers as well. It interesting that the major emphasis in the rationale for the f

关键词： Simulators

来源：评论

学校读者我要写书评

暂无评论

AtomCaml: First-class atomicity via rollback

引用

acm sigplan NOTICES 2005年第9期40卷 92-104页

作者： Ringenburg, MF Grossman, D Univ Washington Dept Comp Sci & Engn Seattle WA 98195 USA

We have designed, implemented, and evaluated AtomCaml, an extension to Objective Caml that provides a synchronization primitive for atomic (transactional) execution of code. A first-class primitive function of type (unit -> 'a) -> 'a evaluates its argument (which may call other functions, even external C functions) as though no other thread has interleaved execution. Our design ensures fair scheduling and obstruction-freedom. Our implementation extends the Objective Cam] bytecode compiler and run-time system to support atomicity. A logging-and-rollback approach lets us undo uncompleted atomic blocks upon thread pre-emption, and retry them when the thread is rescheduled. The mostly functional nature of the Caml language and the Objective Caml implementation's commitment to a uniprocessor execution model (i.e., threads are interleaved, not executed simultaneously) allow particularly efficient logging. We have evaluated the efficiency and ease-of-use of AtomCaml by writing libraries and microbenchmarks, writing a small application, and replacing all locking with atomicity in an existing, large multithreaded application. Our experience indicates the performance overhead is negligible, atomic helps avoid synchronization mistakes, and idioms such as condition variables adapt reasonably to the atomic approach.

关键词： languages atomicity transactions concurrent programming Objective Caml

来源：评论

学校读者我要写书评

暂无评论

Parametric polymorphism for software component architectures

引用

acm sigplan NOTICES 2005年第10期40卷 147-166页

作者： Oancea, CE Watt, SM Univ Western Ontario Dept Comp Sci London ON Canada

Parametric polymorphism has become a common feature of mainstream programming languages, but software component architectures have lagged behind and do not support it. We examine the problem of providing parametric polymorphism with components combined from different programming languages. We have investigated how to resolve different binding times and parametrization semantics in a range of representative languages and have identified a common ground that can be suitably mapped to different language bindings. We present a generic component architecture extension that provides support for parameterized components and that can be easily adapted to work oil top of various software component architectures in use today (e.g., CORBA, DCOM, JNI). We have implemented and tested this architecture on top Of CORBA. We also present Generic Interface Definition language (GIDL), an extension to CORBA-IDL supporting generic types and we describe language bindings for C++, Java and Aldor. We explain our implementation of GIDL, consisting of a GIDL to IDL compiler and tools for generating linkage code under the language bindings. We demonstrate how this architecture can be used to access C++'s STL, and Aldor's BasicMath libraries in a multi-language environment and discuss our mappings in the context of automatic library interface generation.

关键词： languages design antiunification generics parametric polymorphisrn software component architecture templates

来源：评论

学校读者我要写书评

暂无评论

Experience with CST: programming and implementation 89

Experience with CST: programming and implementation

引用

proceedings of the acm sigplan 1989 conference on programming language design and implementation

作者： W. Horwat A. A. Chien W. J. Dally Artificial Intelligence Laboratory and Laboratory for Computer Science Massachusetts Institute of Technology Cambridge Massachusetts

ISBN: (纸本)9780897913065

CST is a programming language based on Smalltalk-802 that supports concurrency using locks, asynchronous messages, and distributed objects. In this paper, we describe CST: the language and its implementation. Example programs and initial programming experience with CST are described. Our implementation of CST generates native code for the J-machine, a fine-grained concurrent computer. Some compiler optimizations developed in conjunction with that implementation are also described.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：