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

An integrated approach to solving mechanical problems on parallel computers

ADVANCES IN ENGINEERING software 2000年第12期31卷 885-899页

作者： Cognard, JY thomas, F Verpeaux, P ENS Cachan Antenne De Bretagne Bruz France IBM France EMEA PSSC Montpellier France CEA Saclay DMT SEMT LAMS F-91191 Gif Sur Yvette France

Possibilities of a programming environment that integrates the specificity of the different types of parallel computers are presented in the framework of computational structural mechanics. An extension of the development environment of the Finite Element code CASTEM 2000 has been realized to offer the user a global vision on all objects of the parallel application. To facilitate the implementation of parallel applications, this system hides data transfers between processors and allows a direct reuse of modules of the original sequential code. It is an object-based shared virtual memory system which allows a parallelism by data distribution (for non-structured data) or by control distribution: it is therefore well suited to "mechanic" parallelism. To validate this programming environment, domain decomposition techniques well suited to parallel computation have been used. (C) 2000 Civil-Comp Ltd. and Elsevier science Ltd. All rights reserved.

关键词： finite element method domain decomposition techniques parallel computation

来源：评论

学校读者我要写书评

暂无评论

Hierarchical graph transformation 1

引用

3rd international conference on foundations of software science and computation structures, FOSSACS 2000, Held as Part of the Joint European conferences on theory and Practice of software, ETAPS 2000

作者： Drewes, Frank Hoffmann, Berthold Plump, Detlef Fachbereich Mathematik/Informatik Universität Bremen Postfach 33 04 40 D-28334 Bremen Germany Department of Computing and Electrical Engineering Heriot-Watt University Edinburgh EH14 4AS United Kingdom

ISBN: (数字)9783540464327

ISBN: (纸本)3540672575

We present an approach for the rule-based transformation of hierarchically structured (hyper)graphs. In these graphs, distinguished hyperedges contain graphs that can be hierarchical again. Our framework extends the double-pushout approach from flat to hierarchical graphs. In particular, we show how to construct recursively pushouts and pushout complements of hierarchical graphs and graph morphisms. To further enhance the expressiveness of the approach, we also introduce rule schemata with variables which allow to copy and to remove hierarchical subgraphs. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Push vs. pull: data movement for linked data structures 00

Push vs. pull: data movement for linked data structures

引用

Proceedings of the 14th international conference on Supercomputing

作者： Chia-Lin Yang Alvin R. Lebeck Department of Computer Science Duke University Durham NC

ISBN: (纸本)9781581132700

As the performance gap between the CPU and main memory continues to grow, techniques to hide memory latency are essential to deliver a high performance computer system. Prefetching can often overlap memory latency with computation for array-based numeric applications. However, prefetching for pointer-intensive applications still remains a challenging problem. Prefetching linked data structures (LDS) is difficult because the address sequence of LDS traversal does not present the same arithmetic regularity as array-based applications and the data dependence of pointer dereferences can serialize the address generation *** this paper, we propose a cooperative hardware/software mechanism to reduce memory access latencies for linked data structures. Instead of relying on the past address history to predict future accesses, we identify the load instructions that traverse the LDS, and execute them ahead of the actual computation. To overcome the serial nature of the LDS address generation, we attach a prefetch controller to each level of the memory hierarchy and push, rather than pull, data to the CPU. Our simulations, using four pointer-intensive applications, show that the push model can achieve between 4% and 30% larger reductions in execution time compared to the pull model.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fault tolerance by transparent replication for distributed Ada 95 4th

引用

4th international conference on Reliable software Technologies (Ada-Europe'99)

作者： Wolf, T Strohmeier, A Swiss Fed Inst Technol Software Engn Lab CH-1015 Lausanne Switzerland

ISBN: (纸本)3540660933

this paper presents the foundations of RAPIDS ("Replicated Ada Partitions In Distributed Systems"), an implementation of the Distributed Systems Annex E incorporating the transparent replication of partitions in distributed Ada 95 applications. RAPIDS is a replication manager for semi-active replication based on a piecewise deterministic computation model. It guarantees replica consistency for arbitrary Ada 95 partitions despite the inherent non-determinism of multitasking, offering k-resilient partitions. the RAPIDS prototype is implemented for the GNAT compiler and evolved from its PCS, Garlic.

关键词： distributed systems fault tolerance non-determinism piecewise determinism replica consistency semi-active replication

来源：评论

学校读者我要写书评

暂无评论

international Symposium on Design and Implementation of Symbolic computation Systems, DISCO 1996

International Symposium on Design and Implementation of Symb...

引用

4th international Symposium on Design and Implementation of Symbolic computation Systems, DISCO 1996

ISBN: (纸本)3540616977

the proceedings contain 35 papers. the special focus in this conference is on Design and Implementation of Symbolic computation Systems. the topics include: Problem-oriented applications of automated theorem proving;a strongly-typed embeddable computer algebra library;a general framework for implementing calculi and strategies;equality elimination for the tableau method;towards lean proof checking;high performance equational theorem proving;a reflective language based on conditional term rewriting;term rewriting systems;generative geometric modeling in a functional environment;exploiting SML for experimenting with algebraic algorithms;conditional categories and domains;parameterizing object specifications;analyzing the dynamics of a Z specification;integer and rational arithmetic on maspar;parallel 3-primes FFT algorithm;a master-slave approach to parallel term rewriting on a hierarchical multiprocessor;concepts and applications;document-centered presentation of computing software;animating a non-executable formal specification with a distributed symbolic language;uniform representation of basic algebraic structures in computer algebra;integrating computer algebra with proof planning;structures for symbolic mathematical reasoning and computation;an approach to class reasoning in symbolic computation;an intelligent interface to numerical routines;computer algebra and the world wide web;software architectures for computer algebra;a deductive database for mathematical formulas;a system for computer aided constructive algebraic geometry;making systems communicate and cooperate;a database for number fields;compiling residuation for a multiparadigm symbolic programming language and pluggability issues in the multi protocol.

关键词：

来源：评论

学校读者我要写书评

暂无评论

4th international conference on Algebraic Methodology and software Technology, AMAST 1995

引用

4th international conference on Algebraic Methodology and software Technology, AMAST 1995

ISBN: (纸本)3540600434

the proceedings contain 42 papers. the special focus in this conference is on Algebraic and Logical foundations. the topics include: Equational logic as a tool;teaching mathematics to software engineers;the role of education and training in the industrial application of formal methods;information algebras;verification of logic programs with delay declarations;an introduction to category-based equational logic;knowledge-based computation;order-sorted algebraic specifications with higher-order functions;proving the correctness of behavioural implementations;detecting isomorphisms of modular specifications with diagrams;higher-order narrowing with convergent systems context-free event domains are recognizable;encoding natural semantics in Coq;mongruences and Co free coaigebras;semantic typing for parametric algebraic specifications verification in continuous time by discrete reasoning;dynamic matrices and the cost analysis of concurrent programs;petri nets, traces, and local model checking;an algebraic framework for developing and maintaining real-time systems;logical foundations for compositional verification and development of concurrent programs in UNITY;CPO models for infinite term rewriting;completeness results for two-sorted metric temporal logics;on mechanizing proofs within a complete proof system for unity;automated reasoning about parallel algorithms using powerlists;representing, verifying and applying software development steps using the PVS system;an algebraic development technique for information systems;a framework for machine-assisted user inferface verification and specification of the unix file system.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Data structure and algorithms for new hardware technology 4th

Data structure and algorithms for new hardware technology

引用

4th international conference on foundations of Data Organization and Algorithms, FODO 1993

作者： Kambayashi, Yahiko Takakura, Hiroki Meki, Shintaro Faculty of Engineering Kyoto University Sakyo Kyoto606-01 Japan Faculty of Computer Science Okayama Prefecture University SojaOkayama719-11 Japan

ISBN: (纸本)9783540573012

New applications and new hardware/software technology are major factors to drive database research to new directions. In this paper we will discuss effects of up-to-date hardware technology to data structure and database algorithms. Historically in database file organization, utilization of sequential access and clustering of data are two important techniques to improve processing efficiency. Flash memory, which is believed to replace conventional disks for mobile application etc., can sequentially access only small amount of data compared with disks, and data clustering will not contribute to improve system performance. On the other hand, recently developed high-speed RAM contains cache memory which contributes to speed-up sequential access. We may be able to utilize special-purpose memory to improve database performance, such as content addressable memory and dual-port RAM. Most research on improvement of database performance using hardware was to develop hardware for relational database operations. Advanced flexible logic chips such as FPGA(Field Programmable Gate Array) can realize a circuit consisting of over 10, 000 gates and connections in the circuit can be changed during system operation by modifying the contents of control SRAMs. We may be able to improve system performance by using FPGAs to realize bottle-neck portions of the database software. Such techniques can be applied especially to active and real-time database systems. Pipe-line processing is a special case of parallel processing and recently pipe-line processors for workstations have been developed. Although pipe-line processing is rather restrictive, it can be combined with concurrency control mechanisms rather easily. Optimization for pipe-line processing is also simpler than that for parallel/distributed systems. Use of pipe-line processors for database operations is also an important topic. © 1993, Springer Verlag. All rights reserved.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

theory and Applications of Models of computation 1

引用

丛书名： Lecture Notes in Computer science

1000年

作者： Manindra Agrawal S. Barry Cooper Angsheng Li

ISBN: (数字)9783642299520

ISBN: (纸本)9783642299513

this book constitutes the refereed proceedings of the 9th international conference on theory and Applications of Models of computation, TAMC 2012, held in Beijing, China, in May 2012. the conference was combined with the Turing Lectures 2012, dedicated to celebrating Alan Turing’s unique impact on mathematics, computing, computer science, informatics, morphogenesis, philosophy, and the wider scientific world. Eight Turing Lectures were given at the TAMC 2012. the 40 revised full papers presented together with invited talks were carefully reviewed and selected from 86 submissions. the papers address 4 special sessions at TAMC 2012 which were algorithms and information in networks, complexity and cryptography, models of computing and networking, programming and verification.

关键词： theory of computation Mathematics of Computing Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Data structures and Information theory Mathematical Logic and Formal Languages

来源：评论

学校读者我要写书评

暂无评论

TAPSOFT '91 1

引用

丛书名： Lecture Notes in Computer science

1000年

ISBN: (数字)9783540465638

ISBN: (纸本)9783540539827

is the Fourth international Joint conference on theory and Practice of software Development. It was held in Brighton, April 8-12, 1991, and was organized by the Department of Computing, Imperial College, London. the proceedings of;are organized into three parts: - Colloquium on Trees in Algebra and Programming (CAAP); - Advances in Distributed Computing (ADC); - Colloquium on Combining Paradigms for software Development (CCPSD). the first part (CAAP) is contained in Vol. 1, the other two parts constitute Vol. 2.;focuses on the following topics: - Logical, algebraic and combinatorial properties of discrete structures (strings, trees, graphs, etc.), including the theory of formal languages considered in the broad sense as that of sets of discrete structures and the theory of rewriting systems over them. - Application of discrete structures in computer science: syntax and semantics of programming languages, operational semantics, logic programming, algorithms and data structures, complexity of algorithms and implementation aspects, proof techniques for nonnumerical algorithms, formal specifications, and visualization of structured objects. the;talks by distinguished invited speakers survey current developments in distributed computing, including the integration of different paradigms for concurrency, algebraic, logical and operational foundations, and applications to software engineering and formal methods. the;papers address aspects of the trend in software engineering towards unification and synthesis combining theory and practice, and merging hitherto diverse approaches.

关键词： theory of computation Applications of Mathematics software Engineering Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Mathematical Logic and Formal Languages

来源：评论

学校读者我要写书评

暂无评论

Fundamentals of software Engineering 1

引用

丛书名： Lecture Notes in Computer science

1000年

作者： Hossein Hojjat Erika Ábrahám

this book constitutes the thoroughly refereed post-conference proceedings of the 10th international conference on Fundamentals of software Engineering, FSEN 2023, held Tehran, Iran in May 4-5, 2023.

ISBN: (数字)9783031424410

ISBN: (纸本)9783031424403

this book constitutes the thoroughly refereed post-conference proceedings of the 10th international conference on Fundamentals of software Engineering, FSEN 2023, held Tehran, Iran in May 4-5, 2023.

关键词： software Engineering/Programming and Operating Systems Control structures and Microprogramming Computer Communication Networks theory of computation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：