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

2nd International conference on Software Engineering, ICSE 1976

作者： White, John R. Booth, Taylor L. Department of Electrical Engineering and Computer Science University of Connecticut StorrsCT United States

The software design process is discussed from an engineering point of view. Initially, a distinction is made between software design and program design. Software design is then described in terms of evolving a system architecture independently of implementation considerations. Computation structures are introduced as a means of modeling the dynamic behavior of a software architecture. Functional completeness, quality, machine independence, and performance completeness of a design are then used as criteria for engineering design decisions. Finally, the basic elements of a system to support the software design process are described. © 1976 IEEE Computer Society. All rights reserved.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

General Data Structure Expansion for Multi-threading 13

General Data Structure Expansion for Multi-threading

引用

acm sigplan conference on programming language design and implementation

作者： Hongtao Yu Hou-Jen Ko Zhiyuan Li Department of Computer Science Purdue University

ISBN: (纸本)9781450320146

Among techniques for parallelizing sequential codes, privatization is a common and significant transformation performed by both compilers and runtime parallelizing systems. Without privatization, repetitive updates to the same data structures often introduce spurious data dependencies that hide the inherent parallelism. Unfortunately, it remains a significant challenge to compilers to automatically privatize dynamic and recursive data structures which appear frequently in real applications written in languages such as C/C++. This is because such languages lack a naming mechanism to define the address range of a pointer-based data structure, in contrast to arrays with explicitly declared bounds. In this paper we present a novel solution to this difficult problem by expanding general data structures such that memory accesses issued from different threads to contentious data structures are directed to different data fields. Based on compile-time type checking and a data dependence graph, this aggressive extension to the traditional scalar and array expansion isolates the address ranges among different threads, without struggling with privatization based on thread-private stacks, such that the targeted loop can be effectively parallelized. With this method fully implemented in GCC, experiments are conducted on a set of programs from well-known benchmark suites such as Mibench, MediaBench II and SPECint. Results show that the new approach can lead to a high speedup when executing the transformed code on multiple cores.

关键词： Parallelization Privatization Multithreading Algorithms languages Performance Privatisation Multithreading Data structures language parallelization data dependency compilers algorithms type checking

来源：评论

学校读者我要写书评

暂无评论

An expressive aspect language for system applications with Arachne 05

An expressive aspect language for system applications with A...

引用

AOSD 2005: 4th International conference on Aspect-Oriented Software Development

作者： Douence, Rémi Fritz, Thomas Loriant, Nicolas Menaud, Jean-Marc Ségura-Devillechaise, Marc Südholt, Mario OBASCO Project E ´Cole des Mines de Mantes INRIA 4 rue Alfred Kastler 44307 Nantes Cedex 3 France

ISBN: (纸本)1595930434

C applications, in particular those using operating system level services, frequently comprise multiple crosscutting concerns: network protocols and security are typical examples of such concerns. While these concerns can partially be addressed during design and implementation of an application, they frequently become an issue at runtime, e.g., to avoid server downtime. A deployed network protocol might not be efficient enough and may thus need to be replaced. Buffer overflows might be discovered that imply critical breaches in the security model of an application. A prefetching strategy may be required to enhance performance. While aspect-oriented programming seems attractive in this context, none of the current aspect systems is expressive and efficient enough to address such concerns. This paper presents a new aspect system to provide a solution to this problem. While efficiency considerations have played an important part in the design of the aspect language, the language allows aspects to be expressed more concisely than previous approaches. In particular, it allows aspect programmers to quantify over sequences of execution points as well as over accesses through variable aliases. We show how the former can be used to modularize the replacement of network protocols and the latter to prevent buffer overflows. We also present an implementation of the language as an extension of Arachne, a dynamic weaver for C applications. Finally, we present performance evaluations supporting that Arachne is fast enough to extend high performance applications, such as the Squid web cache. Copyright 2005 acm.

关键词： Software engineering

来源：评论

学校读者我要写书评

暂无评论

Crosscutting techniques in program specification and analysis 05

Crosscutting techniques in program specification and analysi...

引用

AOSD 2005: 4th International conference on Aspect-Oriented Software Development

作者： Lam, Patrick Kupcak, Viktor Rinard, Martin Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge MA 02139 United States

ISBN: (纸本)1595930434

We present three aspect-oriented constructs (formats, scopes, and defaults) that, in combination with a specification language based on abstract sets of objects, enable the modular application of multiple arbitrarily precise (and therefore arbitrarily unscalable) analyses to scalably verify data structure consistency properties in sizable programs. Formats use a form of field introduction to group together the declarations of all of the fields that together comprise a given data structure. Scopes and defaults enable the developer to state certain data structure consistency properties once in a single specification construct that cuts across the preconditions and postconditions of the procedures in the system. Standard approaches, in contrast, scatter and duplicate such properties across the preconditions and postconditions. We have implemented a prototype implementation, specification, analysis, and verification system based on these constructs and used this system to successfully verify a range of data structure consistency properties in several programs. Most previous research in the field of aspect-oriented programming has focused on the use of aspect-oriented concepts in design and implementation. Our experience indicates that aspect-oriented concepts can also be extremely useful for specification, analysis, and verification. Copyright 2005 acm.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

AspectJML: Modular specification and runtime checking for crosscutting contracts 14

AspectJML: Modular specification and runtime checking for cr...

引用

13th International conference on Modularity, MODULARITY 2014 (Formerly AOSD)

作者： Rebêlo, Henrique Leavens, Gary T. Bagherzadeh, Mehdi Rajan, Hridesh Lima, Ricardo Zimmerman, Daniel M. Cornélio, Marcio Thüm, Thomas Universidade Federal de Pernambuco PE Brazil University of Central Florida Orlando FL United States Iowa State University Ames IA United States Harvey Mudd College Claremont CA United States University of Magdeburg Germany

ISBN: (纸本)9781450327725

Aspect-oriented programming (AOP) is a popular technique for modularizing crosscutting concerns. In this context, researchers have found that the realization of design by contract (DbC) is cross-cutting and fares better when modularized by AOP. However, previous efforts aimed at supporting crosscutting contract modularity might actually compromise the main DbC principles. For example, in AspectJ-style, reasoning about the correctness of a method call may require a whole-program analysis to determine what advice applies and what that advice does relative to DbC implementation and checking. Also, when contracts are separated from classes a programmer may not know about them and may break them inadvertently. In this paper we solve these problems with AspectJML, a new specification language that supports crosscutting contracts for Java code. We also show how AspectJML supports the main DbC principles of modular reasoning and contracts as documentation. Copyright © 2014 acm. Copyright © 2014 acm.

关键词： Aspect oriented programming

来源：评论

学校读者我要写书评

暂无评论

designing Dexter-based cooperative hypermedia systems 93

Designing Dexter-based cooperative hypermedia systems

引用

proceedings of the 5th acm conference on Hypertext

作者： Gronbaek, Kaj Hem, Jens A. Madsen, Ole L. Sloth, Lennert Aarhus Univ Aarhus Denmark

ISBN: (纸本)0897916247

This paper discusses issues for the design of a Dexter-based cooperative hypermedia architecture and a specific system, DeVise Hypermedia (DHM), developed from this architecture. The Dexter Hypertext Reference Model (Hala90) was used as basis for designing the architecture. The Dexter model provides a general and solid foundation for designing a general hypermedia architecture. It introduces central concepts and proposes a layering of the architecture. However, to handle cooperative work aspects, such as sharing material and cooperative authoring, we have to go beyond the Dexter model concepts. To deal with such aspects we have extended our implementation of the Dexter concepts with support for long-term transactions, locking and event notification as called for by Halasz. The result is a platform independent architecture for developing cooperative hypermedia systems. The architecture consists of a portable kernel that constitutes and object oriented framework for developing Dexter compliant hypermedia systems. It is client/server architecture including an object oriented database (OODB) to store the objects implementing the Dexter Storage Layer. We use a general OODB being co-developed to support long term transactions, flexible locking, and event notification. The transaction and locking mechanism support several modes of cooperation on shared hypermedia materials, and the notification mechanism supports the users in maintaining awareness of each others' activity. The portable kernel was used to implement the DHM system on two quite different platforms: UNIX/X-windows and Apple Macintosh.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Shangri-la: Achieving high performance from compiled network applications while enabling ease of programming

引用

acm sigplan NOTICES 2005年第6期40卷 224-236页

作者： Chen, MK Li, XF Lian, RQ Lin, JH Liu, LX Liu, T Ju, R Intel Corp Microproc Technol Labs Santa Clara CA 95051 USA Intel China Res Ctr Ltd Beijing Peoples R China Chinese Acad Sci Inst Comp Technol Beijing Peoples R China

programming network processors is challenging. To sustain high line rates, network processors have extremely tight memory access and instruction budgets. Achieving desired performance has traditionally required hand-coded assembly. Researchers have recently proposed high-level programming languages for packet processing, but the challenges of compiling these languages into code that is competitive with hand-tuned assembly remain unanswered. This paper describes the Shangri-La compiler, which accepts a packet program written in a C-like high-level language and applies scalar and specialized optimizations to generate a highly optimized binary. Hot code paths identified by profiling are mapped across processing elements to maximize processor utilization. Since our compilation target has no hardware caches, software-controlled caches are generated for frequently accessed application data structures. Packet handling optimizations significantly reduce per-packet memory access and instruction counts. Finally, a custom stack model maps stack frames to the fastest levels of the target processor's heterogeneous memory hierarchy. Binaries generated by the compiler were evaluated on the Intel IXP2400 network processor with eight packet processing cores and eight threads per core. Our results show the importance of both traditional and specialized optimization techniques for achieving the maximum forwarding rates on three network applications, L3-Switch, MPLS and Firewall.

关键词： packet processing network processors chip multiprocessors throughput-oriented computing program partitioning dataflow programming

来源：评论

学校读者我要写书评

暂无评论

Message-driven relaxed consistency in a software distributed shared memory 1

Message-driven relaxed consistency in a software distributed...

引用

1st USENIX conference on Operating Systems design and implementation, OSDI 1994

作者： Koch, Povl T. Fowler, Robert J. Jul, Eric Universitetsparken 1 Copenhagen2100 Denmark

Message-passing and distributed shared memory have their respective advantages and disadvantages in distributed parallel programming. We approach the problem of integrating both mechanisms into a single system by proposing a new message-driven coherency mechanism. Messages carrying explicit causality annotations are exchanged to trigger memory coherency actions. By adding annotations to standard message-based protocols, it is easy to construct efficient implementations of common synchronization and communication mechanisms. Because these are user-level messages, the set of available primitives is extended easily with language- or application-specific mechanisms. CarlOS, an experimental prototype for evaluating this approach, is derived from the lazy release consistent memory of TreadMarks. We describe the message-driven coherency memory model used in CarlOS, and we examine the performance of several applications.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Enforcing isolation and ordering in STM

引用

acm sigplan NOTICES 2007年第6期42卷 78-88页

作者： Shpeisman, Tatiana Menon, Vijay Adl-Tabatabai, Ali-Reza Balensiefer, Steven Grossman, Dan Hudson, Richard L. Moore, Katherine F. Saha, Bratin Intel Corp Programming Syst Lab Santa Clara CA 95054 USA Univ Washington Dept Comp Sci & Engn Seattle WA 98195 USA

Transactional memory provides a new concurrency control mechanism that avoids many of the pitfalls of lock-based synchronization. High-performance software transactional memory (STM) implementations thus far provide weak atomicity: Accessing shared data both inside and outside a transaction can result in unexpected, implementation-dependent behavior. To guarantee isolation and consistent ordering in such a system, programmers are expected to enclose all shared-memory accesses inside transactions. A system that provides strong atomicity guarantees isolation even in the presence of threads that access shared data outside transactions. A strongly-atomic system also orders transactions with conflicting non-transactional memory operations in a consistent manner. In this paper, we discuss some surprising pitfalls of weak atomicity, and we present an STM system that avoids these problems via strong atomicity. We demonstrate how to implement non-transactional data accesses via efficient read and write barriers, and we present compiler optimizations that further reduce the overheads of these barriers. We introduce a dynamic escape analysis that differentiates private and public data at runtime to make barriers cheaper and a static not-accessed-in-transaction analysis that removes many barriers completely. Our results on a set of Java programs show that strong atomicity can be implemented efficiently in a high-performance STM system.

关键词： algorithms measurement performance design experimentation languages transactional memory strong atomicity weak atomicity isolation ordering escape analysis compiler optimizations code generation virtual machines

来源：评论

学校读者我要写书评

暂无评论

Customization: optimizing compiler technology for SELF, a dynamically-typed object-oriented programming language 89

Customization: optimizing compiler technology for SELF, a dy...

引用

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

作者： C. Chambers D. Ungar Stanford University

ISBN: (纸本)9780897913065

Dynamically-typed object-oriented languages please programmers, but their lack of static type information penalizes performance. Our new implementation techniques extract static type information from declaration-free programs. Our system compiles several copies of a given procedure, each customized for one receiver type, so that the type of the receiver is bound at compile time. The compiler predicts types that are statically unknown but likely, and inserts run-time type tests to verify its predictions. It splits calls, compiling a copy on each control path, optimized to the specific types on that path. Coupling these new techniques with compile-time message lookup, aggressive procedure inlining, and traditional optimizations has doubled the performance of dynamically-typed object-oriented languages.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：