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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Datalog Redux: Experience and Conjecture 10

Datalog Redux: Experience and Conjecture

引用

29th ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

作者： Hellerstein, Joseph M. UC Berkeley EECS Comp Sci Div Berkeley CA 94720 USA

ISBN: (纸本)9781450300339

There is growing urgency in computer science circles regarding an impending crisis in parallel programming. Emerging computing platforms, from multicore processors to cloud computing, predicate their performance growth on the development of software to harness parallelism. For the first time in the history of computing, the progress of Moore's Law depends on the productivity of software engineers. Unfortunately, parallel and distributed programming today is challenging even for the best programmers, and simply unworkable for the majority. There has never been a more urgent need for breakthroughs in programming models and languages. While parallel programming in general is considered very difficult, data parallelism has been very successful. The relational algebra parallelizes easily over large datasets, and SQL programmers have long reaped the benefits of parallelism without modifications to their code. This point has been rediscovered and amplified via recent enthusiasm for Map Reduce programming and "Big Data", which have turned data parallelism into common culture across computing. As a result, it is increasingly attractive to tackle the challenge of parallel programming on the firm common ground of data parallelism: start with an easy-to-parallelize - kernel relational algebra and extend it to general-purpose computation. This approach has clear precedents in database theory, where it has long been known that classical relational languages have natural Turing-complete extensions. At the same time that this crisis has been evolving, variants of Datalog have been seen cropping up in a wide range of practical settings, from security to robotics to compiler analysis. Over the past seven years, we have been exploring the use of Datalog-inspired languages in a variety of systems.projects, with a focus on inherently parallel tasks in networking and distributed systems. The experience has been largely positive: we have demonstrated full-featured Datalog-based system imp

关键词： Datalog distributed systems Cloud Computing Parallelism Overlog BOOM Dedalus Bloom

来源：评论

学校读者我要写书评

暂无评论

Integrated distributed application management under multi-ORB-vendor environment

Integrated distributed application management under multi-OR...

引用

International symposium on Autonomous Decentralized systems.(ISADAS)

作者： H. Tanaka H. Kobayashi I. Ishii NTT Multimedia Network Laboratories Japan

A mechanism is proposed for managing distributed applications (DAPs) in environment having multiple object request brokers (ORBs). The mechanism ensures the normal-state functioning of DAPs composed of servers. It facilitates DAP management including fault, performance, and configuration management throughout the DAP lifecycle. The mechanism includes three kinds of key components. The first is a domain manager which is responsible for fault and configuration management of DAPs. The second is a server manager, which is responsible for fault and configuration management for servers that make up DAPs. The third is a monitor that manages the performance and normal/abnormal state of servers. The common interface for monitors functioning on different kinds of DAP platforms facilitates managing DAPs over multiple ORBs. The prototype of the proposed mechanism functions properly and performs well when used with a CORBA-2.0-compliant ORE.

关键词： Environmental management Digital audio players Web server Electrical capacitance tomography Prototypes Monitoring Application software Telecommunication network reliability software prototyping Telecommunication services

来源：评论

学校读者我要写书评

暂无评论

Fault tolerant distributed information systems

Fault tolerant distributed information systems

引用

International symposium on software reliability Engineering (ISSRE)

作者： J.C. Knight M.C. Elder Department of Computer Science University of Virginia Charlottesville VA USA

ISBN: (纸本)0769513069

Critical infrastructures provide services upon which society depends heavily; these applications are themselves dependent on distributed information systems.for all aspects of their operation and so survivability of the information systems.is an important issue. Fault tolerance is a mechanism by which survivability can be achieved in these information systems. We outline a specification-based approach to fault tolerance, called RAPTOR, that enables structuring of fault-tolerance specifications and an implementation partially, synthesized from the formal specification. The RAPTOR approach uses three specifications describing the fault-tolerant system, the errors to be detected, and the actions to take to recover from those errors. System specification utilizes an object-oriented database to store the descriptions associated with these large, complex systems. The error detection and recovery specifications are defined using the formal specification notation Z. We also describe an implementation architecture and explore our solution with a case study.

关键词： Fault tolerant systems distributed information systems Monitoring Computer errors Application software Fault tolerance Fault detection Formal specifications Computer architecture Redundancy

来源：评论

学校读者我要写书评

暂无评论

Scalable Deterministic Replay in a Parallel Full-system Emulator 13

Scalable Deterministic Replay in a Parallel Full-system Emul...

引用

18th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming

作者： Chen, Yufei Chen, Haibo Fudan Univ Sch Comp Sci Shanghai Peoples R China Shanghai Jiao Tong Univ Inst Parallel & Distributed Syst Shanghai 200030 Peoples R China

ISBN: (纸本)9781450319225

Full-system emulation has been an extremely useful tool in developing and debugging systems.software like operating systems.and hypervisors. However, current full-system emulators lack the support for deterministic replay, which limits the reproducibility of concurrency bugs that is indispensable for analyzing and debugging the essentially multi-threaded systems.software. This paper analyzes the challenges in supporting deterministic replay in parallel full-system emulators and makes a comprehensive study on the sources of non-determinism. Unlike application-level replay systems. our system, called ReEmu, needs to log sources of non-determinism in both the guest software stack and the dynamic binary translator for faithful replay. To provide scalable and efficient record and replay on multicore machines, ReEmu makes several notable refinements to the CREW protocol that replays shared memory systems. First, being aware of the performance bottlenecks in frequent lock operations in the CREW protocol, ReEmu refines the CREW protocol with a seqlock-like design, to avoid serious contention and possible starvation in instrumentation code tracking dependence of racy accesses on a shared memory object. Second, to minimize the required log files, ReEmu only logs minimal local information regarding accesses to a shared memory location, but instead relies on an offline log processing tool to derive precise shared memory dependence for faithful replay. Third, ReEmu adopts an automatic lock clustering mechanism that clusters a set of uncontended memory objects to a bulk to reduce the frequencies of lock operations, which noticeably boost performance. Our prototype ReEmu is based on our open-source COREMU system and supports scalable and efficient record and replay of full-system environments (both x64 and ARM). Performance evaluation shows that ReEmu has very good performance scalability on an Intel multicore machine. It incurs only 68.9% performance overhead on average (ranging

关键词： Algorithms Performance reliability Scalable Deterministic Replay Full-system Emulator

来源：评论

学校读者我要写书评

暂无评论

A component-based approach to reliability analysis of distributed systems

A component-based approach to reliability analysis of distri...

引用

Reliable distributed systems

作者： S.M. Yacoub B. Cukic H.H. Ammar Computer Science and Electrical Engineering Department West Virginia University Morgantown WV USA

This paper proposes a reliability analysis technique for distributed software systems. The technique is based on scenarios that are modeled as sequence diagrams. Using scenarios, we construct component-dependency graphs (CDG). CDGs have been introduced for reliability analysis of component-based systems. They are extended to serve the complex nature of distributed systems.by applying nesting and hierarchy. CDGs include component and link reliabilities, which are treated as first class elements of the model. Based on CDGs, we present an algorithm to analyze the sensitivity of system reliability to reliabilities of its components, subsystems. and links. The proposed analysis technique is useful in identifying critical components and critical component links. An example based on medical informatics standard is presented to illustrate our methodology.

关键词： software systems reliability Algorithm design and analysis Biomedical informatics Computer science Assembly Protocols Middleware User interfaces databases

来源：评论

学校读者我要写书评

暂无评论

Automatic Managed Filestores - Practice and Experience (Abstract)

Automatic Managed Filestores - Practice and Experience (Abst...

引用

IEEE symposium on Mass Storage systems

作者： D.J. Rigby Rutherford Appleton Laboratory (RAL) Didcot UK

来源：评论

学校读者我要写书评

暂无评论

A checkpointing scheme for heterogeneous distributed database systems

A checkpointing scheme for heterogeneous distributed databas...

引用

International Conference on distributed Computing systems

作者： J.T. Lim S.C. Moon Department of Computer Science Korea Advanced Institute of Science and Technology Seoul South Korea

For efficient construction of the distributed database from media failure, a transaction-consistent checkpointing algorithm is proposed for heterogeneous distributed database systems. For full design autonomy and increased availability on the heterogeneous distributed database systems. the proposed algorithm never enforces termination of normal operations of transactions and changes of checkpointing algorithms in local database systems. The global checkpoints generated by the algorithm can be used to reconstruct the previous consistent states of a database efficiently.< >

关键词： Checkpointing database systems Transaction databases distributed databases software maintenance Communication networks Telecommunication network reliability Algorithm design and analysis Moon Computer science

来源：评论

学校读者我要写书评

暂无评论

NEW CONCURRENCY CONTROL ALGORITHM FOR distributed database systems.

Annual Proceedings - Reliability Physics (Symposium)

引用

Annual proceedings - reliability Physics (symposium) 1979年 221-234页

作者： Minoura, Toshimi

A new concurrency control algorithm for distributed database systems.that spatially extends the idea of ″exclusive/share locks″ is presented. The new algorithm, extended true-copy token algorithm, combines a locking mechanism and a ″true-copy token″ mechanism. ″True-copy tokens″ handle partitioned data that cannot be handled efficiently by locks alone.

关键词： Data base systems

来源：评论

学校读者我要写书评

暂无评论

A P2P object-oriented database system that supports multi-attribute and range queries with improved query response time

A P2P object-oriented database system that supports multi-at...

引用

2010 International symposium on Information Technology, ITSim'10

作者： Wei, Goh Chiao Ming, Lim Tong School of Computer Technology Sunway University College Bandar Sunway Malaysia

ISBN: (纸本)9781424467181

Nowadays, the demand for the processing and storing of data has been growing exponentially rapid. The massive demand of these data has limited the traditional way of storing and processing data based on client/server architecture. To overcome this bottleneck, a peer-to-peer object-oriented database is proposed because of its robustness, fault-tolerance, scalability and less administrative nature. Chord is a structured P2P overlay network providing indexing facility enables users to locate a piece of data based on a given key through an efficient routing algorithm. The proposed object-oriented database is built on the openChord, a Chord implementation. In this paper, we present a preliminary design for a P2P object-oriented database on the openChord which supports multi-attribute and range queries. The storing and processing of objects are managed locally to reduce the network traffic. Pointers of objects are stored around the routing path of nodes to efficiently access to a desired object to reduce storage cost and to preserve the object-oriented features. Nodes holding the object pointers are distributed around the network to reduce the lookup time. Nodes are organized into logical class hubs where each hub handles pointers to nodes storing objects belonging to a particular class. Queries involving multi-attributes and ranges are routed to the related class hubs to retrieve the desired objects. Our proposed system will be tested using an Order Picking application for a warehouse with only dozens of nodes connected in a wireless local area network. Tests were carried out with another P2P database system measured on reliability and performance of both P2P database systems. © 2010 IEEE.

关键词： Object-oriented databases

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：