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

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

acm sigplan NOTICES 2008年第3期43卷 265-276页

作者： 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

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

来源：评论

学校读者我要写书评

暂无评论

On embedding a microarchitectural design language within Haskell 99

On embedding a microarchitectural design language within Has...

引用

Proceedings of the fourth acm sigplan international conference on Functional programming

作者： John Launchbury Jeffrey R. Lewis Byron Cook Oregon Graduate Institute of Science & Technology

ISBN: (纸本)9781581131116

Based on our experience with modelling and verifying microarchitectural designs within Haskell, this paper examines our use of Haskell as host for an embedded language. In particular, we highlight our use of Haskell's lazy lists, type classes, lazy state monad, and unsafe Perform I0, and point to several areas where Haskell could be improved in the future. We end with an example of a benefit gained by bringing the functional perspective to microarchitectural modelling.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Practical program analysis using general purpose logic programming systems—a case study 96

Practical program analysis using general purpose logic progr...

引用

Proceedings of the acm sigplan 1996 conference on programming language design and implementation

作者： Steven Dawson C. R. Ramakrishnan David S. Warren SRI International 333 Ravenswood Ave. Menlo Park CA and Department of Computer Science SUNY at Stony Brook Stony Brook NY Department of Computer Science SUNY at Stony Brook Stony Brook NY

ISBN: (纸本)9780897917957

Many analysis problems can be cast in the form of evaluating minimal models of a logic program. Although such formulations are appealing due to their simplicity and declarativeness, they have not been widely used in practice because, either existing logic programming systems do not guarantee completeness, or those that do have been viewed as too inefficient for integration into a compiler. The objective of this paper is to re-examine this issue in the context of recent advances in implementation technologies of logic programming *** find that such declarative formulations can indeed be used in practical systems, when combined with the appropriate tool for evaluation. We use existing formulations of analysis problems --- groundness analysis of logic programs, and strictness analysis of functional programs --- in this case study, and the XSB system, a table-based logic programming system, as the evaluation tool of choice. We give experimental evidence that the resultant groundness and strictness analysis systems are practical in terms of both time and space. In terms of implementation effort, the analyzers took less than 2 man-weeks (in total), to develop, optimize and evaluate. The analyzer itself consists of about 100 lines of tabled Prolog code and the entire system, including the components to read and preprocess input programs and to collect the analysis results, consists of about 500 lines of code.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Compiler support for garbage collection in a statically typed language 92

Compiler support for garbage collection in a statically type...

引用

Proceedings of the acm sigplan 1992 conference on programming language design and implementation

作者： Amer Diwan Eliot Moss Richard Hudson

ISBN: (纸本)9780897914758

We consider the problem of supporting compacting garbage collection in the presence of modern compiler optimizations. Since our collector may move any heap object, it must accurately locate, follow, and update all pointers and values derived from pointers. To assist the collector, we extend the compiler to emit tables describing live pointers, and values derived from pointers, at each program location where collection may occur. Significant results include identification of a number of problems posed by optimizations, solutions to those problems, a working compiler, and experimental data concerning table sizes, table compression, and time overhead of decoding tables during collection. While gc support can affect the code produced, our sample programs show no significant changes, the table sizes are a modest fraction of the size of the optimized code, and stack tracing is a small fraction of total gc time. Since the compiler enhancements are also modest, we conclude that the approach is practical.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Building block shaders

引用

Computer Graphics (acm) 1990年第4期24卷 283-288页

作者： Abram, Gregory D. Whitted, Turner Numerical Design Ltd Chapel Hill United States

This paper describes an implementation of Cook's 'shade trees' in which shaders are described as networks of modules, building blocks, whose connections can be defined interactively. The high level interface to the shaders is a graphical editor which permits users to construct complex shaders by connecting shading elements in a network, in effect a graphical shading language. A low level interface to the shaders is also provided. In the low level interface, shading elements are programmed in a standard programming language and compiled into modules which can linked either at run time or compile time. Each link in the shading network represents a subroutine call. In essence, execution of the network is analogous to the execution of an interpreted language.

关键词： Computer Graphics

来源：评论

学校读者我要写书评

暂无评论

A provable time and space efficient implementation of NESL 96

A provable time and space efficient implementation of NESL

引用

Proceedings of the first acm sigplan international conference on Functional programming

作者： Guy E. Blelloch John Greiner Carnegie Mellon University

ISBN: (纸本)9780897917704

In this paper we prove time and space bounds for the implementation of the programming language NESL on various parallel machine models. NESL is a sugared typed λ-calculus with a set of array primitives and an explicit parallel map over arrays. Our results extend previous work on provable implementation bounds for functional languages by considering space and by including arrays. For modeling the cost of NESL we augment a standard call-by-value operational semantics to return two cost measures: a DAG representing the sequential dependence in the computation, and a measure of the space taken by a sequential implementation. We show that a NESL program with w work (nodes in the DAG), d depth (levels in the DAG), and s sequential space can be implemented on a p processor butterfly network, hypercube, or CRCW PRAM using O(w/p + d log p) time and O(s + dp log p) reachable space.1 For programs with sufficient parallelism these bounds are optimal in that they give linear speedup and use space within a constant factor of the sequential space.

关键词：

来源：评论

学校读者我要写书评

暂无评论

distributed Objects 99

distributed Objects

引用

1999 International conference on Softeare Engineering

作者： Wolfgang Emmerich Neil Roodyn Dept. of Computer Science University College London London WC1E 6BT UK Cognitech Ltd. City Cloisters 188-194 Old Street London EC1V 9FR UK

ISBN: (纸本)9781581130744

This tutorial motivates the need for, and discusses the principles of object-oriented distribution middleware. We will give an overview how these principles are supported by the major incarnations of object-oriented middleware, the Object Management Group's Common Object Request Broker Architecture (CORBA), Microsoft's Distributed component Object Model (DCOM) and Java's Remote Method Invocation (RMI). We will discuss common design problems that occur when building applications using distriubted objects and present techniques for their solution.

关键词： design problems Common object request broker architecture Distributed Component Object Model BUILDING APPLICATION Principle-Based Ethics object orientation Middleware

来源：评论

学校读者我要写书评

暂无评论

Understanding prediction-based partial redundant threading for low-overhead, high-coverage fault tolerance

Understanding prediction-based partial redundant threading f...

引用

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

作者： Reddy, Vimal K. Parthasarathy, Sailashri Rotenberg, Eric N Carolina State Univ Dept Elect & Comp Engn Raleigh NC 27695 USA Intel Corp Architecture Modeling Infrastruct Grp Hudson MA 01749 USA

Redundant threading architectures duplicate all instructions to detect and possibly recover from transient faults. Several lighter weight Partial Redundant Threading (PRT) architectures have been proposed recently. (i) Opportunistic Fault Tolerance duplicates instructions only during periods of poor single-thread performance. (ii) ReStore does not explicitly duplicate instructions and instead exploits mispredictions among highly confident branch predictions as symptoms of faults. (iii) Slipstream creates a reduced alternate thread by replacing many instructions with highly confident predictions. We explore PRT as a possible direction for achieving the fault tolerance of full duplication with the performance of single-thread execution. Opportunistic and ReStore yield partial coverage since they are restricted to using only partial duplication or only confident predictions, respectively. Previous analysis of Slipstream fault tolerance was cursory and concluded that only duplicated instructions are covered. In this paper, we attempt to better understand Slipstream's fault tolerance, conjecturing that the mixture of partial duplication and confident predictions actually closely approximates the coverage of full duplication. A thorough dissection of prediction scenarios confirms that faults in nearly 100% of instructions are detectable. Fewer than 0.1% of faulty instructions are not detectable due to coincident faults and mispredictions. Next we show that the current recovery implementation fails to leverage excellent detection capability, since recovery sometimes initiates belatedly, after already retiring a detected faulty instruction. We propose and evaluate a suite of simple microarchitectural alterations to recovery and checking. Using the best alterations, Slipstream can recover from faults in 99% of instructions, compared to only 78% of instructions without alterations. Both results are much higher than predicted by past research, which claims coverage for only du

关键词： design performance reliability simultaneous multithreading (SMT) chip multiprocessor (CMP) slipstream processor transient faults time redundancy redundant multithreading branch prediction value prediction

来源：评论

学校读者我要写书评

暂无评论

Architectural Framework Modelingin Telecommunication Domain 99

Architectural Framework Modelingin Telecommunication Domain

引用

1999 International conference on Softeare Engineering

作者： Giulio Fregonese Alessandro Zorer Giovanni Cortese Research & Technology Dept. Sodalia SpA Via V. Zambra 1 Trento TN 38100 Italy Research & Technology Dept. Sodalia SpA Via V. Zambra 1 Trento TN 38100 Italy

ISBN: (纸本)9781581130744

Architectural frameworks have shown to increase the design reusability in large-scale object-oriented systems. Drawing on experience in complex software systems development in telecommunication domain, we present concepts and techniques for domain partitioning and architectural framework modeling and layering. In particular, we discuss how a component-based approach, architectural modeling styles, and the systematic usage of architectual and design patterns provide a common framework for product-line development. Two application frameworks based on this model are presented as case studies.

关键词： Software Architecture Network Traffic Data Analysis Network and Service Management Domain Analysis Distributed Systems Software Reuse Architectural Patterns design Patterns Object-Oriented Framework

来源：评论

学校读者我要写书评

暂无评论

Adding trace matching with free variables to AspectJ 05

Adding trace matching with free variables to AspectJ

引用

Proceedings of the 20th annual acm sigplan conference on Object-oriented programming, systems, languages, and applications

作者： Chris Allan Pavel Avgustinov Aske Simon Christensen Laurie Hendren Sascha Kuzins Ondřej Lhoták Oege de Moor Damien Sereni Ganesh Sittampalam Julian Tibble University of Oxford United Kingdom University of Aarhus Denmark McGill University Montreal Canada

ISBN: (纸本)9781595930316

An aspect observes the execution of a base program; when certain actions occur, the aspect runs some extra code of its own. In the AspectJ language, the observations that an aspect can make are confined to the current action: it is not possible to directly observe the history of a ***, there have been several interesting proposals for new history-based language features, most notably by Douence et al. and by Walker and Viggers. In this paper, we present a new history-based language feature called tracematches that enables the programmer to trigger the execution of extra code by specifying a regular pattern of events in a computation trace. We have fully designed and implemented tracematches as a seamless extension of AspectJ.A key innovation in our tracematch approach is the introduction of free variables in the matching patterns. This enhancement enables a whole new class of applications in which events can be matched not only by the event kind, but also by the values associated with the free variables. We provide several examples of applications enabled by this *** introducing and motivating the idea of tracematches via examples, we present a detailed semantics of our language design, and we derive an implementation from that semantics. The implementation has been realised as an extension of the abc compiler for AspectJ.

关键词： program monitoring aspect-oriented programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：