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

2023 International Russian Automation Conference, RusAutoCon 2023

作者： Martinov, Georgi Salamatin, Evgeny Moscow State University of Technology "STANKIN" Department of Computer-Architecture Control Systems Moscow Russia

ISBN: (纸本)9798350345551

The problem of synchronizing parallel tasks in control systems at the level of the part program is reviewed. A general solution, based on a high-level part programming language extension, is proposed for synchronizing parallel tasks within one control system as well as tasks performed by several different control systems. A scheme for synchronizing the CNC with external autonomous devices through the Common PLC Memory, to which the part program, the PLC program and the inputs and outputs (I/Os) of electric automation have access, has been developed. A set of functions in a high-level part programming language, providing zeroing a certain number of bytes, writing bit, byte, long and float data types to the Common PLC Memory and reading them from it, has been implemented. As a part of practical research, a test stand on the basis of the AxiOMA Control CNC system, that controls actuators via the EtherCAT protocol, was assembled;master and slave part programs were implemented;tests, confirming the operability of the mechanism for synchronizing CNC system with external devices by using a part program, were carried out. © 2023 IEEE.

关键词： Control systems

来源：评论

学校读者我要写书评

暂无评论

The optimization of parallel Smith-Waterman sequence alignment using on-chip memory of GPGPU

The optimization of parallel Smith-Waterman sequence alignme...

引用

2010 IEEE 5th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2010

作者： Zhang, Qian An, Hong Liu, Gu Han, Wenting Yao, Ping Xu, Mu Li, Xiaoqiang Department of Computer Science and Technology University of Science and Technology of China Hefei China Laboratory of Computer System and Architecture Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781424464388

Memory optimization is an important strategy to gain high performance for sequence alignment implemented by CUDA on GPGPU. Smith-Waterman (SW) algorithm is the most sensitive algorithm widely used for local sequence alignment but very time consuming. Although several parallel methods have been used in some studies and shown good performances, advantages of GPGPU memory hierarchy are still not fully exploited. This paper presents a new parallel method on GPGPU using on-chip memory more efficiently to optimize parallel Smith-Waterman sequence alignment presented by Gregory M. Striemer. To minimize the cost of data transfers, on-chip shared memory is used to store intermediate results. Constant memory is also used effectively in our implementation of parallel Smith-Waterman algorithm. Using these two kinds of on-chip memory decreases long latency memory access operations, and reduces demand for global memory when aligning longer sequences. The experimental results show 1.66× to 3.16× speedup over Gregory's parallel SW on GPGPU in terms of execution time and 19.70× speedup on average and 22.43× speedup peak performance over serial SW in terms of clock cycles on our computer platform. © 2010 IEEE.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

Retrieving texture images using coarseness fuzzy partitions

Retrieving texture images using coarseness fuzzy partitions

引用

13th International Conference on Information Processing and Management of Uncertainty, IPMU 2010

作者： Chamorro-Martínez, Jesús Martínez-Jiménez, Pedro Manuel Soto-Hidalgo, Jose Manuel Department of Computer Science and Artificial Intelligence University of Granada Spain Department of Computer Architecture Electronics and Electronic Technology University of Córdoba Argentina

ISBN: (纸本)9783642140570

In this paper, a Fuzzy Dominant Texture Descriptor is proposed for semantically describing an image. This fuzzy descriptor is defined over a set of fuzzy sets modelling the "coarseness" texture property. Concretely, fuzzy partitions on the domain of coarseness measures are proposed, where the number of linguistic labels and the parameters of the membership functions are calculated relating representative coarseness measures (our reference set) with the human perception of this texture property. Given a "texture fuzzy set", its dominance in an image is analyzed and the dominance degree is used to obtain the image texture descriptor. Fuzzy operators over these descriptors are proposed to define conditions in image retrieval queries. The proposed framework makes database systems able to answer queries using texture-based linguistic labels in natural language. © Springer-Verlag Berlin Heidelberg 2010.

关键词： Image texture

来源：评论

学校读者我要写书评

暂无评论

NfvInsight:A Framework for Automatically Deploying and Benchmarking VNF Chains

引用

Journal of computer Science & technology 2022年第3期37卷 680-698页

作者： Tian-Ni Xu Hai-Feng Sun Di Zhang Xiao-Ming Zhou Xiu-Feng Sui Sa Wang Qun Huang Yun-Gang Bao State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190China University of Chinese Academy of Sciences Beijing 100049China School of Information and Electronics Beijing Institute of TechnologyBeijing 100081China Peng Cheng Laboratory Shenzhen 518055China Department of Computer Science and Technology Peking UniversityBeijing 100871China

With the advent of virtualization techniques and software-defined networking(SDN),network function virtualization(NFV)shifts network functions(NFs)from hardware implementations to software appliances,between which exists a performance *** to narrow the gap is an essential issue of current NFV ***,the cumbersomeness of deployment,the water pipe effect of virtual network function(VNF)chains,and the complexity of the system software stack together make it tough to figure out the cause of low performance in the NFV *** pinpoint the NFV system performance,we propose NfvInsight,a framework for automatic deployment and benchmarking VNF *** framework tackles the challenges in NFV performance *** framework components include chain graph generation,automatic deployment,and fine granularity *** design and implementation of each component have their *** the best of our knowledge,we make the first attempt to collect rules forming a knowledge base for generating reasonable chain *** deploys the generated chain graphs automatically,which frees the network operators from executing at least 391 lines of bash commands for a single *** diagnose the performance bottleneck,NfvInsight collects metrics from multiple layers of the software ***,we collect the network stack latency distribution ingeniously,introducing only less than 2.2%*** showcase the convenience and usability of NfvInsight in finding bottlenecks for both VNF chains and the underlying *** our framework,we find several design flaws of the network stack,which are unsuitable for packet forwarding inside one single server under the NFV *** optimization for these flaws gains at most 3x performance improvement.

关键词： network function virtualization(NFV) service chain performance bottleneck network stack latency

来源：评论

学校读者我要写书评

暂无评论

Reliably locking system v shared memory for user level communication in linux

Reliably locking system v shared memory for user level commu...

引用

2001 IEEE International Conference on Cluster Computing, CLUSTER 2001

作者： Seifert, Friedrich Rehm, Wolfgang Chemnitz University of Technology Department of Computer Science Chair of Computer Architecture Strabe der Nationen 62 Chemnitz09111 Germany

ISBN: (纸本)0769511163

A major trend in recent cluster communication systems is to circumvent the operating system during the actual data transfers. That, on the one hand, reduces latency since there is no user-kernel transition needed and, on the other hand, increases bandwidth by avoiding additional intermediate copies. The data transfer is handled completely by the networking hardware and its DMA engine. For example, the Virtual Interface processes can access networking hardware directly in a protected manner. One of its characteristics is that it requires that all memory used for communication be locked down into physical memory. The same requirement holds true for the Infiniband ensures reliable locking of regular, i.e. private, virtual memory without altering the kernel. In this paper we present an extended solution that can handle System V shared memory as well. © 2001 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

Fuzzy partitions for modelling texture properties: Coarseness, contrast and directionality

Fuzzy partitions for modelling texture properties: Coarsenes...

引用

IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2015

作者： Chamorro-Martinez, Jesus Martinez-Jimenez, Pedro Manuel Soto-Hidalgo, Jose Manuel Department of Computer Science and Artificial Intelligence University of Granada Spain Department of Computer Architecture Electronics and Electronic Technology University of Córdoba Spain

ISBN: (纸本)9781467374286

The analysis of the perceptual properties of texture plays a fundamental role in tasks like semantic description of images or content-based image retrieval using linguistic queries. In this paper, we propose to model these properties by means of fuzzy partitions defined on the domain of some representative measures. In particular, we have focused our study on the properties of coarseness, contrast and directionality, that play a fundamental role in the human perception of texture. In our approach, the number of fuzzy sets in the partitions, as well as the parameters of the membership functions, are calculated by taking into account the relationship between the computational values given by the measures and the human perception of the corresponding property. The performance of the proposed modelling has been analyzed by applying the obtained fuzzy partitions in several experiments. © 2015 IEEE.

关键词： Membership functions

来源：评论

学校读者我要写书评

暂无评论

Performance-aware speculation control using wrong path usefulness prediction

Performance-aware speculation control using wrong path usefu...

引用

2008 IEEE 14th International Symposium on High Performance computer architecture, HPCA 2008

作者： Chang, Joo Lee Kim, Hyesoon Mutlu, Onur Patt, Yale N. Department of Electrical and Computer Engineering University of Texas at Austin School of Computer Science Georgia Institute of Technology Computer Architecture Group Microsoft Research

ISBN: (纸本)9781424420704

Fetch gating mechanisms have been proposed to gate the processor pipeline to reduce the wasted energy consumption due to wrong-path (i.e. mis-speculated) instructions. These schemes assume that all wrong-path instructions are useless for processor performance and try to eliminate the execution of all wrong-path instructions. However, wrong-path memory references can be useful for performance by providing prefetching benefits for later correct-path operations. Therefore, eliminating wrong-path instructions without considering the usefulness of wrong-path execution can significantly reduce performance as well as increase overall energy consumption. This paper proposes a comprehensive, low-cost speculation control mechanism that takes into account the usefulness of wrong-path execution, while effectively reducing the energy consumption due to useless wrong-path instructions. One component of the mechanism is a simple, novel wrong-path usefulness predictor (WPUP) that can accurately predict whether or not wrong-path execution will be beneficial for performance. The other component is a novel branch-count based fetch gating scheme that requires very little hardware cost to detect if the processor is on the wrong path. The key idea of our speculation control mechanism is to gate the processor pipeline only if (1) the number of outstanding branches is above a dynamically-determined threshold and (2) the WPUP predicts that wrong-path execution will not be beneficial for performance. Our results show that our proposal eliminates most of the performance loss incurred by fetch gating mechanisms that assume wrong-path execution is useless, thereby both improving performance and reducing energy consumption while requiring very little (51-byte) hardware cost. ©2008 IEEE.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Improved structural modeling based on conserved domain clusters and structure-anchored alignments

Proceedings of the ACM Symposium on Applied Computing

引用

Proceedings of the ACM Symposium on Applied Computing 2007年 128-132页

作者： Zhang, Fa Xu, Lin Liu, Zhiyong Yuan, Bo Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Science Graduate School Chinese Academy of Science Institute of Computing Technology Chinese Academy of Science Department of Computer Science and Engineering Shanghai Jiaotong University

ISBN: (纸本)1595934804;9781595934802

In this paper, we presented a method to improve structural modeling based on conserved domain clusters and structure-anchored alignments. We first constructed a template library of structural clusters for all conserved sequence domains. Then, for each cluster, we built the profile using the structure and sequence information. Finally we use the profile and structural alignments as anchors to increase the alignment accuracy between a query and its templates. Our preliminary results show that this method can be used for the partial prediction for a majority of known protein sequences with better qualities. Copyright 2007 ACM.

关键词： Proteins

来源：评论

学校读者我要写书评

暂无评论

A comparative evaluation of parallel programming models for shared-memory architectures

A comparative evaluation of parallel programming models for ...

引用

2012 10th IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2012

作者： Sanchez, Luis Miguel Fernandez, Javier Sotomayor, Rafael Garcia, J. Daniel Computer Architecture and Technology Area Computer Science Department Universidad Carlos III De Madrid Madrid Colmenarejo 28270 Spain

ISBN: (纸本)9780769547015

Nowadays, most computers that are commercially available off-the-shelf (COTS) include hardware features that increase the performance of parallel general-purpose threads (hyper threading, multicore, ccNUMA architectures) or SIMD kernels (CPU vector instructions, GPUs). The purpose of this paper is to perform a compared evaluation of several parallel programming models where each one is fitted to exploit some of these features but also each one requires a different level of programming skills. Four parallel programming models (OpenMP, Intel TBB, Intel ArBB, and CUDA) have been selected. The idea is to cover a wide spectrum of programming models and most of the parallel hardware features included in modern computers. On one hand, OpenMP and TBB platforms, that exploit parallel threads running on multicore systems. On the other hand, ArBB, that combines muticore parallel threads and multicore SIMD features with a simpler programming model, and CUDA that exploits SIMD features of the GPU hardware. Our results obtained with the benchmarks used on this paper suggest that OpenMP and TBB have a lower performance compared to ArBB and CUDA. But also that ArBB performance tends to be comparable with CUDA performance in most cases (although it is normally lower). Thus, there are evidences that a careful designed top range multicore and multisocket architecture, can be comparable in terms of performance with top range GPU cards for many applications, with the advantage of a simpler programming model. © 2012 IEEE.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Expert mutation operators for the evolution of radial basis function neural networks

引用

6th International Work-Conference on Artificial and Natural Neural Networks, IWANN 2001

作者： González Rojas, Jesús Rojas, I. Pomares, H. Department of Computer Architecture and Computer Technology University of Granada Campus Cle Fncn Temeva E. 18071 Granada Spain

ISBN: (纸本)3540422358

This paper compares some mntationoperators containing expert knowledge about the problem of optimizing the parameters of a Radial Basis Function Neural Network. It is shown that the expert kno wledge is not always able to improve the results obtained by a blind evolutionary algorithm, and that the final results depend strongly on how the expert knowledge is utilized. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Radial basis function networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：