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

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

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Demo abstract: design and implementation of a low-cost arduino-based high-frequency AC waveform meter board for the raspberry Pi 4

Demo abstract: Design and implementation of a low-cost ardui...

引用

4th acm International conference on Systems for Energy-Efficient Built Environments, BuildSys 2017

作者： Quintana, Matias Lange, Henning Bergés, Mario Carnegie Mellon University PittsburghPA United States

ISBN: (纸本)9781450354769

This paper introduces a low-cost AC meter designed to continuously measure voltage and current waveforms at up to 14 kHz. The AC power meter, provided as open hardware, is designed using the same micro controller as the Arduino UNO1 with an In-system programming (ISP) interface, thus allowing the user to change the firmware to match their particular use case using Arduino libraries or standard C language. The suggested design is compatible with the Raspberry Pi 32, making it a suitable real-time measurement accessory for the single board computer. The platform features an 8 channel simultaneous sampling Analog-to-Digital Converter (ADC) which allows a high fidelity sampling without time offsets. Depending on how the user decides to combine current transformers (CTs) and AC-AC voltage adapters for the input channels, circuit breakers or appliances can be measured in either one phase or three phases. © 2017 Copyright held by the owner/author(s).

关键词： Firmware

来源：评论

学校读者我要写书评

暂无评论

Thread-modular shape analysis

引用

acm sigplan NOTICES 2007年第6期42卷 266-277页

作者： Gotsman, Alexey Berdine, Josh Cook, Byron Sagiv, Mooly Univ Cambridge Cambridge CB2 1TN England Microsoft Corp Redmond WA 98052 USA

We present the first shape analysis for multithreaded programs that avoids the explicit enumeration of execution-interleavings. Our approach is to automatically infer a resource invariant associated with each lock that describes the part of the heap protected by the lock. This allows us to use a sequential shape analysis on each thread. We show that resource invariants of a certain class can be characterized as least fixed points and computed via repeated applications of shape analysis only on each individual thread. Based on this approach, we have implemented a thread-modular shape analysis tool and applied it to concurrent heap-manipulating code from Windows device drivers.

关键词： abstract interpretation concurrent programming shape analysis static analysis

来源：评论

学校读者我要写书评

暂无评论

InPUT: The Intelligent Parameter Utilization Tool 12

InPUT: The Intelligent Parameter Utilization Tool

引用

14th International conference on Genetic and Evolutionary Computation conference (GECCO)

作者： Dobslaw, Felix Mid Sweden Univ Dept Informat Technol & Media Ostersund Sweden

ISBN: (纸本)9781450311786

Computer experiments are part of the daily business for many researchers within the area of computational intelligence. However, there is no standard for either human or computer readable documentation of computer experiments. Such a standard could considerably improve the collaboration between experimental researchers, given it is intuitive to use. In response to this deficiency the Intelligent Param eter Utilization Tool (InPUT ) is introduced. InPUT offers a general and programming language independent format for the definition of parameters and their ranges. It provides services to simplify the implementation of algorithms and can be used as a substitute for input mechanisms of existing frameworks. InPUT reduces code-complexity and increases the reusability of algorithm designs as well as the reproducibility of experiments. InPUT is available as open-source for Java and this will soon also be extended to C++, two of the predominant languages of choice for the development of evolutionary algorithms.

关键词： Intelligent Parameter Utilization Tool INPUT InFUT4j Computer Experiments Automated Algorithm design

来源：评论

学校读者我要写书评

暂无评论

DAOP-ADL: An architecture description language for dynamic component and aspect-based development

引用

2nd International conference on Generative programming and Component Engineering, GPCE 2003

作者： Pinto, MÓnica Fuentes, Lidia Troya, Jose MarÍa Dpto. de Lenguajes y Ciencias de la Computación University of Málaga Málaga Spain

ISBN: (纸本)3540201025

Architecture description languages deal with the description, analysis and reuse of software architectures. This paper describes DAOP-ADL, a component- and aspect-based language to specify the architecture of an application in terms of components, aspects and a set of plug-compatibility rules between them. With the aim of connecting the specification of the application architecture to the implementation, we describe our language using XML and XML Schemas. The DAOP-ADL language was designed to be interpreted by DAOP, our own dynamic component- and aspect-oriented platform. DAOP provides a composition mechanism that plugs aspects into components dynamically at runtime. The software architect will use the DAOP-ADL language at design time to describe the architecture of the application. Later this architectural information is loaded into the DAOP platform, which needs it to establish the dynamic connections between autonomous components and aspects. Therefore, the use of DAOP-ADL closes the gap between design and implementation of component- and aspect-based applications. © Springer-Verlag Berlin Heidelberg 2003.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：