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

PartialRC: A Partial Recomputing Method for Efficient Fault Recovery on GPGPUs

Journal of Computer Science & Technology 2012年第2期27卷 240-255页

作者：徐新海杨学军薛京灵林宇斐林一松 National Laboratory for Parallel and Distributed Processing School of ComputerNational University of Defense Technology Programming Languages and Compilers Group School of Computer Science and Engineering University of New South Wales

GPGPUs are increasingly being used to as performance accelerators for HPC （High Performance Computing） applications in CPU/GPU heterogeneous computing systems, including TianHe-1A, the world＇s fastest supercomputer in the TOP500 list, built at NUDT （National University of Defense Technology） last year. However, despite their performance advantages, GPGPUs do not provide built-in fault-tolerant mechanisms to offer reliability guarantees required by many HPC applications. By analyzing the SIMT （single-instruction, multiple-thread） characteristics of programs running on GPGPUs, we have developed PartialRC, a new checkpoint-based compiler-directed partial recomputing method, for achieving efficient fault recovery by leveraging the phenomenal computing power of GPGPUs. In this paper, we introduce our PartialRC method that recovers from errors detected in a code region by partially re-computing the region, describe a checkpoint-based faulttolerance framework developed on PartialRC, and discuss an implementation on the CUDA platform. Validation using a range of representative CUDA programs on NVIDIA GPGPUs against FullRC （a traditional full-recomputing Checkpoint-Rollback-Restart fault recovery method for CPUs） shows that PartialRC reduces significantly the fault recovery overheads incurred by FullRC, by 73.5% when errors occur earlier during execution and 74.6% when errors occur later on average. In addition, PartialRC also reduces error detection overheads incurred by FullRC during fault recovery while incurring negligible performance overheads when no fault happens.

关键词： GPGPU partial recomputing fault tolerance CUDA checkpointing

来源：评论

学校读者我要写书评

暂无评论

AN EFFICIENT COMPUTATION OF RIGHT CONTEXT FOR LR-BASED ERROR REPAIR

引用

INFORMATION PROCESSING LETTERS 1994年第2期49卷 63-71页

作者： JUNG, MS CHOE, KM HAN, T Programming Languages Laboratory Department of Computer Science Korea Advanced Institute of Science and Technology 373-1 Kusong-Dong Yusong-Gu Taejon 305-701 South Korea

The left context in LR-based parsing is the sequence of states in the parsing stack. The right context is the vocabulary strings to appear for a given left context. We propose an efficient method of computing right context for LR-based syntax error repair. The efficiency of our method is achieved from removing some redundancies in the method of previous work.

关键词： COMPILERS LR PARSING SYNTAX ERROR REPAIR KERNEL ITEM RIGHT CONTEXT

来源：评论

学校读者我要写书评

暂无评论

STATIC FILTERING ON STRATIFIED PROGRAMS

引用

INFORMATION PROCESSING LETTERS 1993年第5期47卷 237-244页

作者： CHANG, BM CHOE, KM HAN, TS Programming Languages Laboratory Department of Computer Science Korea Advanced Institute of Science and Technology 373-1 Kusong-dong Yusung-ku Taejon 305-701 South Korea

We extend static filtering in [8], a query optimization strategy based on seminaive evaluation on system graphs, so that it can efficiently handle stratified programs without extra overhead. The computation of static filters is formalized as a transformation so that the least fixed point of the transformation can be the static filters. The static filtering on stratified programs is shown to be complete with respect to the iterated fixed point semantics.

关键词： APPLICATIVE (LOGIC) programming STRATIFIED PROGRAMS QUERY OPTIMIZATION STATIC FILTERING SYSTEM GRAPHS

来源：评论

学校读者我要写书评

暂无评论

SYNTACTIC ERROR REPAIR USING REPAIR PATTERNS

引用

INFORMATION PROCESSING LETTERS 1993年第4期47卷 189-196页

作者： YUN, IS CHOE, KM HAN, T Programming Languages Laboratory Department of Computer Science Korea Advanced Institute of Science and Technology 373-1 Kusong-Dong Yusung-Cu Taejon 305-701 South Korea

A syntactic error repair model is proposed, and is defined as a partial function from strings to sentences. The replacement of a substring of a string with a substring of a sentence is described by a repair pattern, which is roughly a pair of strings of grammar symbols. The model can be efficient with some restriction on repair patterns. An LR-based implementation of the model is discussed.

关键词： COMPILERS SYNTACTIC ERROR RECOVERY SYNTACTIC ERROR REPAIR MODEL REPAIR PATTERN

来源：评论

学校读者我要写书评

暂无评论

YET ANOTHER EFFICIENT BACKWARD EXECUTION ALGORITHM IN THE AND OR PROCESS MODEL

引用

INFORMATION PROCESSING LETTERS 1991年第4期40卷 201-211页

作者： KIM, DH CHOE, KM Programming Languages Laboratory Department of Computer Science Korea Advanced Institute of Science and Technology 371-1 Kusong-Dong Yusang-Gu Taejon 305-701 South Korea

An efficient backward execution algorithm in the AND/OR Process Model for parallel evaluation of logic programs is proposed. The efficiency of the algorithm is achieved by means of information acquired during execution of clauses. The algorithm is considered to be efficient in the sense that it issues fewer number of cancel messages and avoids unnecessary resetting operations. Furthermore, it performs independent redoing and resetting more concurrently than other related works.

关键词： APPLICATIVE (LOGIC) programming PARALLEL EVALUATION OF LOGIC PROGRAMS AND OR PROCESS MODEL AND PARALLELISM BACKWARD EXECUTION ALGORITHM MULTIPLE FAILURE SELECTIVE RESETTING

来源：评论

学校读者我要写书评

暂无评论

PARBLO:Page-Allocation-Based DRAM Row Buffer Locality Optimization

引用

Journal of Computer Science & Technology 2009年第6期24卷 1086-1097页

作者：米伟冯晓兵贾耀仓陈莉薛京灵 Key Laboratory of Computer System and Architecture Institution of Computing Technology Chinese Academy of Sciences Graduate University of Chinese Academy of Sciences Programming Languages and Compilers Group School of Computer Science and Engineering University of New South Wales

DRAM row buffer conflicts can increase memory access latency significantly. This paper presents a new pageallocation-based optimization that works seamlessly together with some existing hardware and software optimizations to eliminate significantly more row buffer conflicts. Validation in simulation using a set of selected scientific and engineering benchmarks against a few representative memory controller optimizations shows that our method can reduce row buffer miss rates by up to 76% （with an average of 37.4%）. This reduction in row buffer miss rates will be translated into performance speedups by up to 15% （with an average of 5%）.

关键词： DRAM row buffer page allocation locality optimization

来源：评论

学校读者我要写书评

暂无评论

Rewriting for Monoidal Closed Categories 7

Rewriting for Monoidal Closed Categories

引用

7th International Conference on Formal Structures for Computation and Deduction, FSCD 2022

作者： Alvarez-Picallo, Mario Ghica, Dan Sprunger, David Zanasi, Fabio Programming Languages Laboratory Huawei Research Centre United Kingdom Department of Computer Science University of Birmingham United Kingdom Programming Languages Laboratory Huawei Research Centre Reading United Kingdom Department of Computer Science University College London United Kingdom

ISBN: (纸本)9783959772334

This paper develops a formal string diagram language for monoidal closed categories. Previous work has shown that string diagrams for freely generated symmetric monoidal categories can be viewed as hypergraphs with interfaces, and the axioms of these categories can be realized by rewriting systems. This work proposes hierarchical hypergraphs as a suitable formalization of string diagrams for monoidal closed categories. We then show double pushout rewriting captures the axioms of these closed categories. © Mario Alvarez-Picallo, Dan Ghica, David Sprunger, and Fabio Zanasi

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

ITKBoard: A visual dataflow language for biomedical image processing

ITKBoard: A visual dataflow language for biomedical image pr...

引用

2nd International Conference on Software and Data Technologies

作者： Le, Hoang D. K. Li, Rongxin Ourselin, Sebastien Potter, John M. BioMedIA Autonomous Systems Laboratory Australia Programming Languages and Compilers Group School of Computer Science and Engineering University of New South Wales Sydney Australia

ISBN: (纸本)9789898111050

Experimenters in biomedical image processing rely on software libraries to provide a large number of standard filtering and image handling algorithms. The Insight Toolkit (ITK) is an open-source library that provides a complete framework for a range of image processing tasks, and is specifically aimed at segmentation and registration tasks for both two and three dimensional images. This paper describes a visual dataflow language, ITKBoard, designed to simplify building, and more significantly, experimenting with ITK applications. The ease with which image processing experiments can be interactively modified and controlled is an important aspect of the design. The experimenter can focus on the image processing task at hand, rather than worry about the underlying software. ITKBoard incorporates composite and parameterised components, and control constructs, and relies on a novel hybrid dataflow model, combining aspects of both demand and data-driven execution.

关键词： dataflow programming visual programming languages image processing software ITK ITKBoard

来源：评论

学校读者我要写书评

暂无评论

WIP: An Engaging Undergraduate Intro to Model Checking in Software Engineering Using TLA+ 54

WIP: An Engaging Undergraduate Intro to Model Checking in So...

引用

54th IEEE Frontiers in Education Conference, FIE 2024

作者： Läufer, Konstantin Mertin, Gunda Thiruvathukal, George K. Loyola University Software and Systems Laboratory Department of Computer Science Chicago United States Institute for Software Engineering and Programming Languages University of Lübeck Germany

ISBN: (纸本)9798350351507

Background: In this Innovative Practice Work in Progress, we present our initial efforts to integrate formal methods, with a focus on model-checking specifications written in Temporal Logic of Actions (TLA+), into computer science education, targeting undergraduate juniors/seniors and graduate students. Many safety-critical systems and services crucially depend on correct and reliable behavior. Formal methods can play a key role in ensuring correct and safe system behavior, yet remain underutilized in educational and industry contexts. Aims: We aim to (1) qualitatively assess the state of formal methods in computer science programs, (2) construct level-appropriate examples that could be included midway into one's undergraduate studies, (3) demonstrate how to address successive 'failuresy' through progressively stringent safety and liveness requirements, and (4) establish an ongoing framework for assessing interest and relevance among students. Methods: We detail our pedagogical strategy for embedding TLA+ into an intermediate course on formal methods at our institution. After starting with a refresher on mathematical logic, students specify the rules of simple puzzles in TLA+ and use its included model checker (known as TLC) to find a solution. We gradually escalate to more complex, dynamic, event-driven systems, such as the control logic of a microwave oven, where students will study safety and liveness requirements. We subsequently discuss explicit concurrency, along with thread safety and deadlock avoidance, by modeling bounded counters and buffers. Results: Our initial findings suggest that through careful curricular design and choice of examples and tools, it is possible to inspire and cultivate a new generation of software engineers proficient in formal methods. Conclusions: Our initial efforts suggest that 84% of our students had a positive experience in our formal methods course. Our future plans include a longitudinal analysis within our own institution and

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Circular Queue Method for Iterative Stencil Computations on GPUs

引用

Journal of Computer Science & Technology 2012年第1期27卷 57-74页

作者： Yang Yang Hui-Min Cui Xiao-Bing Feng Jing-Ling Xue State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of Sciences Beijing 100190China Graduate University of Chinese Academy of Sciences Beijing 100190China Programming Languages and Compilers Group School of Computer Science and Engineering University of New South WalesSydneyNSW 2052Australia

In this paper, we present a hybrid circular queue method that can significantly boost the performance of stencil computations on GPU by carefully balancing usage of registers and shared-memory. Unlike earlier methods that rely on circular queues predominantly implemented using indirectly addressable shared memory, our hybrid method exploits a new reuse pattern spanning across the multiple time steps in stencil computations so that circular queues can be implemented by both shared memory and registers effectively in a balanced manner. We describe a framework that automatically finds the best placement of data in registers and shared memory in order to maximize the performance of stencil computations. Validation using four different types of stencils on three different GPU platforms shows that our hybrid method achieves speedups up to 2.93X over methods that use circular queues implemented with shared-memory only.

关键词： stencil computation circular queue GPU occupancy register

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：