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

2014 Third International Conference on Computer Technology in Russia and in the Former Soviet Union (SoRuCom)

作者： Ivannikov, Victor Gaisaryan, Sergey Tomilin, Alexander RAS Inst Syst Programming Moscow Russia

ISBN: (纸本)9781479917990

By 1991, several copies of two vector-pipeline supercomputers: “Electronica SSBIS” (the development of the Research institute “Delta”, MEI USSR and the institute of Cybernetics, AS USSR - chief designer Vladimir Andreevich Melnikov), and “modular pipelined processor (MPP)” (the development of the Lebedev institute of Precision mechanics and Computer Engineering - Chief Designer Andrei Andreevich Sokolov) have been designed and produced.

关键词： computer software mainframes parallel machines pipeline processing Electronica SSBIS MPP computing system modular pipelined processor system software vector pipeline supercomputers Computer architecture Computers File systems Libraries Operating systems programming Random access memory architecture of the system software operating system transport and functional network protocols vector-pipeline supercomputers systems software Operating systems Mainframes File systems random access machine Pipeline processing Computer Architecture parallel machines Computers computer software programming Libraries

来源：评论

学校读者我要写书评

暂无评论

Deriving complete finite tests based on state machines 12

Deriving complete finite tests based on state machines

引用

IEEE East West Design and Test Symposium (EWDTS)

作者： Burdonov, Igor Kossatchev, Alexander Yevtushenko, Nina RAS Inst Syst Programming Moscow Russia Tomsk State Univ Tomsk Russia

ISBN: (纸本)9781479976300

Many state machine based strategies return complete but infinite test suites. A usual approach to guarantee the fault coverage with respect to some kind of faults is to limit the number of faults, i.e., to consider a finite fault domain. In this paper, we summarize some results on deriving complete test suites w.r.t. infinite faults domains but w.r.t. special types of the specification machine.

关键词： finite state machines fault coverage finite fault domain finite tests infinite faults domains state machine-based strategy Automata Chaos programming Safety Semantics Software Testing fault coverage finite state machines state machines Automata Semantics programming chaos computer software Consumer safety safety faults semiotics Infinite

来源：评论

学校读者我要写书评

暂无评论

Dynamic verification of hybrid systems

Dynamic verification of hybrid systems

引用

Conference on Tools and Methods of Program Analysis (TMPA)

作者： Pakulin, Nikolay RAS Inst Syst Programming Dept Software Engineeing Moscow Russia

ISBN: (纸本)9780986077319

In the recent decade we face aggressive replacement of analog control loops with digital ones. Even for critical systems there are ongoing projects for digital control: "Smart Grids" in power industry, "Integrated Modular Avionics" in aerospace, "Smart Fabrics" in manufacturing, etc. Introduction of large scale digital control channels raises the risks of faults that might result in heavy losses. Those risks call for new methods of analysis and verification, including modeling hybrid systems and modelbased verification. The paper overviews a number of existing approaches to verification of hybrid systems and introduces architecture of a test bed for dynamic verification of models of hybrid systems.

关键词： hybrid systems Verification new methods test bed critical systems energy industries Power industry Numerical controls verification model

来源：评论

学校读者我要写书评

暂无评论

Global path planning in 4D environments using topological mapping

Global path planning in 4D environments using topological ma...

引用

9th European Conference on Product and Process Modelling

作者： Semenov, V. A. Kazakov, K. A. Zolotov, V. A. Inst Syst Programming RAS Moscow Russia

ISBN: (纸本)9780415621281

Global path planning is a challenging problem raised in many fields of research. It is of particular interest to construction planning community facing the requirements of trustworthiness and feasibility of the project schedules. Correct construction schedules must exclude conflicting situations at project sites, thereby improving project productivity and reducing risks and waste. Some conflicts can be foreseen and avoided using emerging 4D modeling and planning technologies. Modern 4D modeling systems enable to identify and report simple clashes among construction elements, equipment units, workspaces occupying the same place at the same time. However, they are not capable of revealing more sophisticated conflicts caused by lack of collision-free paths to deliver the elements to final destination locations. Global path planning methods look promising to assure the existence of collision-free paths for displaced elements. In particular, topological mapping methods have proved to be well suited for single path planning requests in static 3D scenes. However, they could not be directly applied to complex pseudo-dynamic scenes originating from 4D modeling and planning applications. In this paper a new efficient method intended for global path planning in dynamic environments is presented. It generalizes existing mapping techniques by means of incremental and concordant updates of all the deployed metric and topological structures as the explored environment is being evolved under events appearing in discrete time moments. The obtained results, both theoretical and experimental, showed that the proposed method gives a significant performance gain for multiple path planning requests in complex pseudo-dynamic environments and can be successfully applied for validation of construction project schedules against path conflicts.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

Concurrent Planning Using Semantics-driven Reconciliation

Concurrent Planning Using Semantics-driven Reconciliation

引用

18th ISPE International Conference on Concurrent Engineering - Improving Complex systems Today

作者： Semenov, Vitaly Morozov, Sergey Tarlapan, Oleg Zolotov, Vladislav RAS Inst Syst Programming 25 Alexander Solzhenitsyn St Moscow 109004 Russia

ISBN: (纸本)9780857297983

Concurrent planning, scheduling, and monitoring are challenging problems relating to effective communication and collaboration among key project participants like managers, planners, designers, cost analysts, and production engineers. Commercially available planning systems provide for a wide range of traditional network techniques such as Gantt chart, Critical Path Method (CPM), and the Program Evaluation and Review Technique (PERT), but have significant limitations for large-scale projects which have to be managed concurrently due to complexity and short deadlines. Being oriented on synchronously working users, such systems usually adopt client-server architectures, centralized data stores and pessimistic transaction models that create well-known performance, availability and productivity shortcomings. The research presented follows alternative approach to collaborative planning based on optimistic replication of project data and use of all-embracing, semantics-driven reconciliation method (SRM). The method enables to identify and to resolve conflicts in concurrently elaborated plans and bring them to semantically correct representation. Being implemented as a data exchange bridge between project management and 4D modelling systems, it supports effective collaboration through synchronizing the project plans and consolidating the results of individual work.

关键词： Concurrent engineering environments project management systems planning and scheduling optimistic replication reconciliation

来源：评论

学校读者我要写书评

暂无评论

Establishing Linux Driver Verification Process

Establishing Linux Driver Verification Process

引用

7th International Andrei Ershov Memorial Conference on Perspectives of systems Informatics

作者： Khoroshilov, Alexey Mutilin, Vadim Petrenko, Alexander Zakharov, Vladimir RAS Inst Syst Programming Moscow 117901 Russia

ISBN: (纸本)9783642114854

This paper presents an initiative program aimed at enhancing Linux device driver designing and maintenance by launching a long-term process that will attend the OS kernel development. This process includes two adjacent lines of activity: 1) creation and replenishment of a repository of potential faults and errors that may occur in Linux device drivers, and 2) development and improvement of special-purpose verification tools for automatic detection of all errors specified in repository. We describe in some details both lines of activity, present an architecture of a perspective verification toolset, compare our project with similar work, and finally discuss the current state of art in Linux device driver verification.

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

On-line hierarchical job scheduling on grids with admissible allocation

引用

JOURNAL OF SCHEDULING 2010年第5期13卷 545-552页

作者： Tchernykh, Andrei Schwiegelshohn, Uwe Yahyapour, Ramin Kuzjurin, Nikolai CICESE Res Ctr Dept Comp Sci Ensenada 22830 Baja California Mexico Tech Univ Dortmund Robot Res Inst D-44221 Dortmund Germany Tech Univ Dortmund IT & Media Ctr D-44221 Dortmund Germany RAS Inst Syst Programming Moscow 117901 Russia

In this paper, we address non-preemptive online scheduling of parallel jobs on a Grid. Our Grid consists of a large number of identical processors that are divided into several machines. We consider a Grid scheduling model with two stages. At the first stage, jobs are allocated to a suitable machine, while at the second stage, local scheduling is independently applied to each machine. We discuss strategies based on various combinations of allocation strategies and local scheduling algorithms. Finally, we propose and analyze a scheme named adaptive admissible allocation. This includes a competitive analysis for different parameters and constraints. We show that the algorithm is beneficial under certain conditions and allows for an efficient implementation in real systems. Furthermore, a dynamic and adaptive approach is presented which can cope with different workloads and Grid properties.

关键词： Grid computing Online scheduling Resource management Job allocation

来源：评论

学校读者我要写书评

暂无评论

Automatically Tuning Sparse Matrix-Vector Multiplication for GPU Architectures

Automatically Tuning Sparse Matrix-Vector Multiplication for...

引用

5th International Conference on High Performance Embedded Architectures and Compilers

作者： Monakov, Alexander Lokhmotov, Anton Avetisyan, Arutyun Inst Syst Programming RAS 25 Solzhenitsyna St Moscow 109004 Russia Imperial Coll London Dept Computat London SW7 2AZ England

ISBN: (纸本)9783642115141

Graphics processors are increasingly used in scientific applications due to their high computational power, which comes from hardware with multiple-level parallelism and memory hierarchy. Sparse matrix computations frequently arise in scientific applications, for example, when solving PDEs on unstructured grids. However, traditional sparse matrix algorithms are difficult to efficiently parallelize for GPUs due to irregular patterns of memory references. In this paper we present a new storage format for sparse matrices that better employs locality, has low memory footprint and enables automatic specialization for various matrices and future devices via parameter tuning. Experimental evaluation demonstrates significant speedups compared to previously published results.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Implementing Blocked Sparse Matrix-Vector Multiplication on NVIDIA GPUs

引用

9th SAMOS International Workshop

作者： Monakov, Alexander Avetisyan, Arutyun RAS Inst Syst Programming Moscow 117901 Russia

ISBN: (纸本)9783642031373

We discuss implementing blocked sparse matrix-vector multiplication for NVIDIA GPUs. We outline an algorithm and various optimizations, and identify potential future improvements and challenging tasks. In comparison with previously published implementation, our implementation is faster on matrices having many high fill-ratio blocks but slower on matrices with low number of non-zero elements per row.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Collaborative software engineering using metamodel-driven approach

Collaborative software engineering using metamodel-driven ap...

引用

16th IEEE International Workshop on Enabling Technologies - Infrastructure for Collaborative Enterprises

作者： Semenov, Vitaly RAS Inst Syst Programming Moscow 117901 Russia

ISBN: (纸本)9780769528793

A metamodel-driven approach to collaborative software engineering is presented The approach employs optimistic replication of UML models and a novel semantics-based method for reconciliation of long-lived transactions in collaborative environments using metamodel information. The research described addresses the general problem of semantically consistent and functionally meaningful reconciliation of divergent replicas and enables significant simplification and formalization of its solution. The software engineering application is presented to illustrate how the approach can be effectively applied for cooperatively elaborated UML diagrams under strong consistency guarantees for produced software artifacts.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：