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

Atomic commit in concurrent computing

IEEE CONCURRENCY 2000年第4期8卷 34-41页

作者： Thanisch, P Univ Stirling Alpha Ctr Accrue Software Stirling FK9 4NF Scotland

Commit protocols have been proposed for use in a variety of concurrent-computing applications. The author has developed two condition sets that can help you determine when to use a commit protocol and when to avoid them.

关键词： Multiprocessing Programs Multiprocessing Systems Protocols Concurrency Control Atomic Commit concurrent computing Commit Protocols Condition Sets concurrent computing Distributed Databases Transaction Databases Access Protocols Database Systems Intelligent Networks File Systems IP Networks Computer Network Management Distributed computing

来源：评论

学校读者我要写书评

暂无评论

The benefits of concurrent computing in tribology system design

引用

TRIBOLOGY INTERNATIONAL 2019年 132卷 85-98页

作者： Wang, Nenzi Chen, Hsin-Yi Chen, Yu-Wen Lin, Yu-Chun Chang Gung Univ Dept Mech Engn Taoyuan 333 Taiwan

Many optimum designs of tribological components are highly time-constrained before final productions. It is well-known that the process of a complex simulated design can be considerably accelerated by using some form of parallel computing. Also, for many tribological models additional assumptions can be relaxed with stricter design constrains, if the execution can be speeded up. In this study, the concurrent computing for tribological design is proposed, which is to perform parallel computing using the multitasking capability of today's operating system. In the concurrent computing a master program, which manages the process of the optimization, is used to launch a number of standalone slave programs (air bearing models) in a quick succession. And the operating system (MS-Windows) of the computer manages the parallel execution of the slave programs. Other than the standard programming language (Fortran 95) this approach uses none of the general parallel programming paradigms or directives, such as message passing interface, OpenMP, or coding using graphics processing units. In this study, the algorithm for the multiobjective optimization is group inching fortification method and the concurrent computing is executed in the algorithm-level. High parallel computing speedups are obtained in the simulated bearing designs. The approach can also be applied in using commercial general-purpose packages for modelling and self-coded methods for optimum design of tribological components or systems.

关键词： Air bearing design concurrent computing Group inching fortification method

来源：评论

学校读者我要写书评

暂无评论

FAULT-TOLERANT MATRIX ARITHMETIC AND SIGNAL-PROCESSING ON HIGHLY concurrent computing STRUCTURES

引用

PROCEEDINGS OF THE IEEE 1986年第5期74卷 732-741页

作者： JOU, JY ABRAHAM, JA UNIV ILLINOIS DEPT ELECT & COMP ENGNURBANAIL 61801 UNIV ILLINOIS DEPT COMP SCIURBANAIL 61801 UNIV ILLINOIS COORDINATED SCI LABURBANAIL 61801

Hardware for executing matrix arithmetic and signal processing algorithms at high speeds is in great demand in many real-time and scientific applications. With the advent of VLSI technology, large numbers of processing elements which cooperate with each other at high speed have become economically feasible. Since any functional error in a high-performance system may seriously jeopardize the operation of the system and its data integrity, some level of fault tolerance must be incorporated in order to ensure that the results of long computations are valid. Since the major computational requirements for many important real-time signal processing tasks can be reduced to a common set of basic matrix operations, the development of a unified fault-tolerant scheme for matrix operations can solve the problems of both reliable signal processing and reliable matrix operations. Earlier work proposed a low-cost checksum scheme for fault-tolerant matrix operations on multiple processor systems. However, this scheme can only correct errors in matrix multiplication; it can detect, but not correct, errors in matrix-vector multiplication, LU decomposition, matrix inversion, etc. In order to solve these problems with the checksum scheme, a very general matrix encoding scheme is proposed in this paper to achieve fault-tolerant matrix arithmetic and signal processing with linear arrays, which are believed to hold the most promise in VLSI computing structures for their flexibility, low cost, and applicability to most of the interesting algorithms. This proposed technique is, therefore, a very cost-effective encoding technique to achieve fault-tolerant matrix arithmetic and signal processing on highly concurrent VLSI computing structures.

关键词： Fault tolerance Arithmetic Signal processing concurrent computing Matrix decomposition Signal processing algorithms Very large scale integration Fault tolerant systems Error correction Encoding

来源：评论

学校读者我要写书评

暂无评论

HIGHLY concurrent computing STRUCTURES FOR MATRIX ARITHMETIC AND SIGNAL-PROCESSING

引用

COMPUTER 1982年第1期15卷 65-&页

作者： AHMED, HM DELOSME, JM MORF, M Stanford University

First Page of the Article

关键词： concurrent computing Signal processing Signal processing algorithms Very large scale integration Digital arithmetic Digital signal processing Parallel processing Matrix decomposition Computational complexity Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Advances in concurrent computing for Digital Stochastic Measurement Simulation

引用

JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS 2020年第2期29卷

作者： Pjevalica, Nebojsa Pjevalica, Velibor Petrovic, Nenad Univ Novi Sad Comp & Control Engn Dept Fac Tech Sci Trg D Obradovica 6 Novi Sad 21000 Serbia JP Srbijagas Tech Provis Sect Narodnog Fronta 12 Novi Sad Serbia Sch Elect Engn Stari Grad Visokog Stevana 37 Belgrade 11000 Serbia

This paper introduces a concurrent computing technique for the acceleration of digital stochastic measurement simulations. The digital stochastic measurement presents an advanced methodology based on the specific parallel hardware structure, utilized for an orthogonal transformation calculus/decomposition. Methodology is analyzed in detail, starting from the very basic idea, toward recent references, covering main research directions and trends. An oversampling nature of the evaluated digital stochastic measurement, along with demanding arithmetic requirements, implies exhausting simulation complexity. As a test case, several typical power grid signals were harmonically analyzed through a discrete Fourier transformation based on the proposed methodology. A harmonic decomposition was simulated with several levels of computing concurrency. Through all the simulated scenarios main success criterion was model accuracy, while the parameter used for selection of the optimal simulation computing technique was the overall calculus speed. Final results exposed thread pool computing technique as an optimal simulation platform.

关键词： Digital stochastic measurement orthogonal transformation discrete transforms analog-digital conversion concurrent computing

来源：评论

学校读者我要写书评

暂无评论

TPVM: distributed concurrent computing with lightweight processes 95

TPVM: distributed concurrent computing with lightweight proc...

引用

International Symposium on High Performance Distributed computing

作者： A.J. Ferrari V.S. Sunderam Department of Computer Science University of Virginia Charlottesville VA USA Department of Mathematics and Computer Science Emory University Atlanta GA USA

ISBN: (纸本)9780818670886

The TPVM (Threads-oriented PVM) system, is an experimental auxiliary subsystem for the PVM distributed system, which supports the use of lightweight processes or "threads" as the basic unit of parallelism and scheduling. TPVM provides a library interface which presents both a traditional, task based, explicit message passing model, as well as a data-driven scheduling model that enables straightforward specification of computation based on data dependencies. Our system design is still under development, but a prototype implementation has allowed us to perform a number of preliminary experiments. These have provided strong evidence that TPVM can offer improved performance, processor utilization, and load balance to several application categories. Through our experiments we have also determined that the current TPVM design is not very well suited to certain types of applications, most notably highly synchronous, SPMD-style algorithms.

关键词： concurrent computing Parallel processing Processor scheduling Message passing Pervasive computing Software systems Computer science Computer networks Distributed computing Yarn

来源：评论

学校读者我要写书评

暂无评论

HeNCE: graphical development tools for network-based concurrent computing

HeNCE: graphical development tools for network-based concurr...

引用

Scalable High Performance computing Conference

作者： A. Beguelin J. Dongarra A. Geist R. Manchek K. Moore R. Wade V. Sunderam Oak Ridge National Laboratory University of Tennessee USA Oak Ridge National Laboratory USA University of Tennessee USA Emory University USA

HeNCE (heterogeneous network computing environment) is an X Window based graphical parallel programming environment that was created to assist scientists and engineers with the development of parallel programs. HeNCE provides a graphical interface for creating, compiling, executing, and debugging parallel programs, as well as configuring a distributed virtual computer (using PVM). HeNCE programs can be run on a single Unix workstation or over a network of heterogeneous machines. The paper describes the purpose and use of the HeNCE software.< >

关键词： concurrent computing Programming profession Algorithms Distributed computing Parallel programming Parallel processing Computer networks Lifting equipment Laboratories Contracts

来源：评论

学校读者我要写书评

暂无评论

DCL: protocols and primitives for distributed and concurrent computing in networked environments

DCL: protocols and primitives for distributed and concurrent...

引用

International Conference on computing and Information (ICCI)

作者： V.S. Sunderam Department of Math & Computer Science Emory University Atlanta GA USA

We present design and implementation strategies for providing general purpose distributed computing primitives on computer networks. This suite of primitives is intended to be a framework within which distributed and concurrent applications may be built in networked environments, in the absence of a distributed operating system. The proposed constructs are derived from typical application requirements, and include group communications, synchronization and recovery, and integrated distributed primitives such as mutual exclusion and consensus. We define an extensible suite of general purpose distributed computing primitives, discuss algorithms for their implementation, and present performance results and experiences.< >

关键词： Protocols concurrent computing Intelligent networks Application software Distributed computing Operating systems Computer networks Kernel Computer science Testing

来源：评论

学校读者我要写书评

暂无评论

An Efficient Distributed Video Coding with Parallelized Design for concurrent computing

An Efficient Distributed Video Coding with Parallelized Desi...

引用

Data Compression Conference (DCC)

作者： Yun-Chung Shen Han-Ping Cheng Ja-Ling Wu Graduate Institute of Networking and Multimedia National Taiwan University

Summary form only given. In this paper, Wyner-Ziv (WZ) video coding is a particular case of distributed video coding (DVC). Although some works, with improved performance, have been made in recent years, the coding efficiency of state-of-the-art WZ codec is still far from that of the state-of-the-art prediction-based codec, especially for high and complex motion contents. Moreover, most reported WZ codecs have a high time delay in decoder, which hinders its practical application in real-time systems. The performance of the SI creation process based on adjacent previously decoded frames is limited by the quality of the past and the future reference frames as well as the distance and motion behavior between them. In this work, by combining coding tools developed in recent literatures on transform domain WZ coding with some newly developed modules on both encoding and decoding sides, an efficient and practical WZ video coding architecture, dubbed as Distributed video coding with PArallelized design for concurrent computing (DISPAC), is proposed to better the rate-distortion (RD) performance. Another unique feature of DISPAC, lies in the parallelizability of the modules used by its WZ decoder which increased the decoding speed largely. Experimental results conducted on a concurrent computing environment (consisting of multi-core CPU and GPU processors) reveal that DISPAC codec can gain up to 2.8 dB in the RD measures and 14.35 times faster in the decoding speed as compared with the-state-of-art WZ video codec, respectively. By shifting the computational complexity from the encoder to the decoder and integrating with appropriate trascoding techniques, DVC has been expected to provide a video codec solution for Cloud computing mobile devices (such as mobile phones).

关键词： Decoding Video coding Encoding concurrent computing Video codecs Mobile handsets

来源：评论

学校读者我要写书评

暂无评论

An Event Graph for concurrent computing in Cryptographic Protocols

An Event Graph for Concurrent Computing in Cryptographic Pro...

引用

2010 Second Asia-Pacific Conference on Information Processing (APCIP 2010)

作者： Huanbao Wang and Yilan Chen Department of Maths & Physics Anhui University of Architecture Hefei 230601,China

An Event Graph for concurrent CIn this paper we introduce the event graph for concurrent computing in cryptographic protocols that,is composed of meta-graphs and adopted as the formalism of cryptographic protocols that run in an infinite concurrent way and new operations such as prefixing,parallel composition of event graphs to be defined in terms of traditional process *** event graph is used as a novel and effective mode for proving safety properties of cryptographic protocols running in an infinite concurrent *** of safety properties using theorem proving are dependent on bi-simulation equivalence relations of the event *** paper presents bi-simulation equivalence relations of the event *** event graph mode that meets the UC security can be also extended to describe other concurrent *** in Cryptographic Protocols

关键词： event graph concurrent computing meta-graph UC security cryptographic protocol

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：