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

A NEW STORAGE SCHEME FOR AN EFFICIENT IMPLEMENTATION OF THE SPARSE MATRIX-VECTOR PRODUCT

PARALLEL COMPUTING 1989年第3期12卷 327-333页

作者： FERNANDES, P GIRDINIO, P DIPARTIMENTO INGN ELETTR I-16145 GENOAITALY

The most critical point in the implementation on a vector computer of iterative methods to solve sparse linear algebraic systems is the sparse matrix-vector product. Therefor we have compared its performance under three different sparse matrix storage schemes found in literature. These schemes have been tested on a FPS M64/330 using matrices similar to those arising in finite element or finite difference discretizations. The results are reported and discussed. On the basis of them a new storage scheme is proposed and tested in similar situations. The obtained performance is never worse and often much better than those of the other schemes we have analyzed.

关键词： Linear algebra vector computer programming techniques performance measurements

来源：评论

学校读者我要写书评

暂无评论

The Synthesizer Generator Reference Manual 3

引用

丛书名： Monographs in Computer Science

1989年

作者： Thomas W. Reps Tim Teitelbaum

ISBN: (数字)9781461396338

ISBN: (纸本)9780387969107

The Synthesizer Generator is a system for automating the implementation of language-based editing environments. The editor designer prepares a specification that includes rules defining a language's context-free abstract syn tax, context-sensitive relationships, display format, and concrete input syntax. From this specification, the Synthesizer Generator creates a display editor for manipulating objects according to these rules [Reps84]. This volume, The Synthesizer Generator Reference Manual, is intended as the defining document of the system. A companion volume, The Synthesizer Gen erator: A System for Constructing Language-Based Editors [Reps88], provides a more tutorial description of the system; it contains numerous examples that illustrate the specification and use of generated editors, as well as chapters that explain important algorithms of the implementation. The Synthesizer Generator is a generalization of our earlier system, the Cor nell Program Synthesizer [Teitelbaum81], which was a programming environ ment for a specific small dialect of PL/I. It featured a display-oriented, syntax directed editor, an incremental compiler, an execution supervisor supporting source-level debugging, and a file system containing syntactically typed pro gram fragments. Whereas PL/I was built into the Cornell Program Synthesizer, the Synthesizer Generator accepts a formal language definition as input. Although originally conceived as a tool for creating Synthesizer-like environments for arbitrary pro gramming languages, the Synthesizer Generator is more broadly useful. Any textual language with a hierarchical phrase structure grammar is a candidate. vi Preface Interactive theorem proving for formal mathematics and logic, for example, has emerged as a particularlysuitable application.

关键词： programming Languages, Compilers, Interpreters Software Engineering programming techniques

来源：评论

学校读者我要写书评

暂无评论

Algorithm Synthesis: A Comparative Study 1

引用

1989年

作者： D. M. Steier A. P. Anderson

ISBN: (数字)9781461388777

ISBN: (纸本)9780387969602

In early 1986, one of us (D.M.S.) was constructing an artificial intelligence system to design algorithms, and the other (A.P.A.) was getting started in program transformations research. We shared an office, and exchanged a few papers on the systematic development of algorithms from specifications. Gradually we realized that we were trying to solve some of the same problems. And so, despite radical differences between ourselves in research approaches, we set out together to see what we could learn from these papers. That's how this book started: a couple of graduate students trying to cope with The Literature. At first, there was just a list of papers. One of us (D.M.S.) tried to cast the papers in a uniform framework by describing the problem spaces searched, an approach used in artificial intelligence for understanding many tasks. The generalized problem space descriptions, though useful, seemed to abstract too much, so we decided to compare papers by different authors dealing with the same algorithm. These comparisons proved crucial: for then we began to see similar key design choices for each algorithm.

关键词： Software Engineering/programming and Operating Systems programming techniques Artificial Intelligence Algorithm Analysis and Problem Complexity Software Engineering

来源：评论

学校读者我要写书评

暂无评论

programming IN VS-FORTRAN ON THE IBM-3090 FOR MAXIMUM VECTOR PERFORMANCE

引用

COMPUTER 1988年第6期21卷 65-76页

作者： LIU, B STROTHER, N IBM CORP CTR SCIPALO ALTOCA 94304

programming techniques necessary for high performance on the 3090 Vector Facilities are illustrated, showing that VS Fortran programs can achieve near-maximum execution rates. Relevant features of the 3090 architecture are reviewed, stressing the need to make efficient use of a hierarchical storage system and take advantage of the compound vector instructions. The key programming techniques for managing the storage hierarchy are loop sectioning, loop distribution, and data compaction. Vector register, cache reuse, and virtual memory, storage format, and page reuse are shown to lead to efficient use of the vector registers, the high speed cache, and the virtual memory system, respectively. The multiply-and-add compound instruction is discussed

关键词： 3090 architecture IBM 3090 IBM computers VS Fortran cache reuse data compaction hierarchical storage system high speed cache loop distribution loop sectioning maximum vector performance multiply-and-add compound instruction page reuse parallel architectures parallel machines parallel programming programming techniques storage allocation storage format storage hierarchy virtual memory

来源：评论

学校读者我要写书评

暂无评论

AN OPERATOR APPROACH TO INTERACTIVE DATA-PROCESSING .1. THE SYSTEM

引用

COMPUTER METHODS AND PROGRAMS IN BIOMEDICINE 1988年第2期27卷 121-135页

作者： LOOF, Y Department of Clinical Neurophysiology Region Hospital Orebro Sweden.

A computer software system for interactive data processing is described. Data are transferred between functions (''operators''). Execution flow is designed in a semi-graphical language. Data are composed of arbitrary data types in sequences of any length. The system works as an interpreter and the user may define or modify its current operation without delay. Lucidity is increased by the possibility of building complex functions (''macros'') from simpler ones. Once such a construction has been made, the functions included can be made transparent to the user. Portability is emphasized by using only standard PASCAL. To promote flexibility, entirely new procedures and data types can be introduced. Both short- and long-term solutions are thus supported.

关键词： Data processing Data structures Human-computer interfacing PASCAL programming techniques Visual programming (computer graphics)

来源：评论

学校读者我要写书评

暂无评论

Algorithms and Order 1

引用

丛书名： Nato Science Series C:

1988年

作者： Ivan Rival

ISBN: (数字)9789400926394

ISBN: (纸本)9780792300076;9789401076913

This volume contains the texts of the principal survey papers presented at ALGORITHMS -and ORDER, held· at Ottawa, Canada from June 1 to June 12, 1987. The conference was supported by grants from the N.A.T.O. Advanced Study Institute programme, the University of Ottawa, and the Natural Sciences and Engineering Research Council of Canada. We are grateful for this considerable support. Over fifty years ago, the Symposium on Lattice Theory, in Charlottesville, U.S.A., proclaimed the vitality of ordered sets. Only twenty years later the Symposium on Partially Ordered Sets and Lattice Theory, held at Monterey, U.S.A., had solved many of the problems that had been originally posed. In 1981, the Symposium on Ordered Sets held at Banff, Canada, continued this tradition. It was marked by a landmark volume containing twenty-three articles on almost all current topics in the theory of ordered sets and its applications. Three years after, Graphs and Orders, also held at Banff, Canada, aimed to document the role of graphs in the theory of ordered sets and its applications. Because of its special place in the landscape of the mathematical sciences order is especially sensitive to new trends and developments. Today, the most important current in the theory and application of order springs from theoretical computer seience. Two themes of computer science lead the way. The first is data structure. Order is common to data structures.

关键词： programming techniques Neurology Pediatrics Combinatorics

来源：评论

学校读者我要写书评

暂无评论

INTELLIGENT HELP SYSTEMS

引用

INFORMATION AND SOFTWARE TECHNOLOGY 1987年第3期29卷 115-121页

作者： ERLANDSEN, J HOLM, J Computer Resources International A/S Vesterbrogade IA DK-1620 Copenhagen V Denmark

Data processing systems are becoming more complex, integrated, and powerful and have a higher degree of user control. This requires greater knowledge and experience, leading to a growing interest in documentation, user-friendly systems, and training. The EuroHelp project studies ways to improve support facilities and develops tools to aid in maximizing the effect of user support. Intelligent help systems (IHS) help a user build a correct and sufficient conceptual model of a software application using a behavior similar to that of a human teacher. The IHS must have knowledge of the application and must monitor the interaction of the user and application. In addition, the IHS should have a user model and know how to express itself. A first version of such an intelligent help system consists of a: 1. performance monitor, which deals with non-optimal performance and knowledge, 2. question monitor for the user to communicate with the system, and 3. an utterance generator, which produces the text strings.

关键词： data processing man-machine interface programming techniques

来源：评论

学校读者我要写书评

暂无评论

ERROR RECOVERY IN ASYNCHRONOUS SYSTEMS

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1986年第8期12卷 811-826页

作者： CAMPBELL, RH RANDELL, B UNIV NEWCASTLE UPON TYNE COMP LABNEWCASTLE TYNE NE1 7RUTYNE & WEARENGLAND

In fault-tolerant software systems, backward error recovery is meant to restore a system state that took place before the manifestation of the fault. Forward error recovery is meant to correct or isolate specific errors and is accomplished in the system state containing the errors. The organization and control of error recovery in asynchronous systems is quite complex, but it is possible to limit this complexity by suitable system structuring aids. Methods for structuring backward error recovery are relatively well understood. Here, techniques are proposed for structuring forward error recovery measures in asynchronous systems and recent ideas of atomic actions (transactions) are generalized so as to support fault-tolerant interactions between processes. An automatic resolution mechanism for exceptions in atomic actions is described that enables users to separate their recovery schemes from the details of the underlying algorithms.

关键词： Fault Tolerance Fault Tolerant Systems Context Protocols Atomic Measurements Software Computers Software Reliability Asynchronous Systems Atomic Actions Error Recovery Exception Mechanism programming techniques Software Fault Tolerance

来源：评论

学校读者我要写书评

暂无评论

AI TOOLS FOR DP - programming UNDER UNCERTAINTY

引用

DATA PROCESSING 1985年第4期27卷 24-27页

作者： CATTON, D Artificial Intelligence Ltd Intelligence House 58-78 Merton Rd Watford Herts WD1 7BY UK

Conventional methods for solving computing problems may not work for today's tasks. The methods employed in AI programming are more flexible, as they are designed for programming under uncertainty. For example, programming in AI languages means that programmers can defer commitment to a design decision until run time if necessary. The concept of embedded languages will also have attractions for programmers outside the realms of AI. Also available in AI development systems are highly sophisticated graphics interfaces. These and other tools can be used by programmers to great effect in many areas of computing.

关键词： data processing artificial intelligence programming techniques

来源：评论

学校读者我要写书评

暂无评论

A GENERAL CHARACTER TO INTEGER CONVERSION METHOD

引用

SOFTWARE-PRACTICE & EXPERIENCE 1985年第8期15卷 761-766页

作者： PARKER, JR Department of Computer Science University of Calgary 2500 University Drive N.W. Calgary Alberta Canada T2N 1N4

Most programs which involve character to integer conversion fail to detect integer overflow correctly. This paper describes some of the pitfalls of not recognizing overflow, and presents a correct method for doing so ... 详细信息

关键词： programming techniques Type conversion

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：