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

International conference on Dependable Systems and Networks Workshops (DSN-W)

作者： Xiang Rao Huaimin Wang Dianxi Shi Zhenbang Chen Hua Cai Qi Zhou Tingtao Sun National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China Computing Platform Alibaba Cloud Computing Corporation Hangzhou China

Extracting fault features with the error logs of fault injection tests has been widely studied in the area of large scale distributed systems for decades. However, the process of extracting features is severely affected by a large amount of noisy logs. While the existing work tries to solve the problem by compressing logs in temporal and spatial views or removing the semantic redundancy between logs, they fail to consider the co-existence of other noisy faults that generate error logs instead of injected faults, for example, random hardware faults, unexpected bugs of softwares, system configuration faults or the error rank of a log severity. During a fault feature extraction process, those noisy faults generate error logs that are not related to a target fault, and will strongly mislead the resulted fault features. We call an error log that is not related to a target fault a noisy error log. To filter out noisy error logs, we present a similarity-based error log filtering method SBF, which consists of three integrated steps: (1) model error logs into time series and use haar wavelet transform to get the approximate time series; (2) divide the approximate time series into sub time series by valleys; (3) identify noisy error logs by comparing the similarity between the sub time series of target error logs and the template of noisy error logs. We apply our log filtering method in an enterprise cloud system and show its effectiveness. Compared with the existing work, we successfully filter out noisy error logs and increase the precision and the recall rate of fault feature extraction.

关键词： Time series analysis Noise measurement Feature extraction Wavelet transforms Computer crashes Complexity theory Approximation methods

来源：评论

学校读者我要写书评

暂无评论

Pipelined high precision beamforming delay calculator for ultrasound imaging

Pipelined high precision beamforming delay calculator for ul...

引用

IEEE International conference on Field-Programmable Technology (FPT)

作者： Zhanxiang Zhao Xi Jin Xin Zhang Department of Physics University of Science and Technology Hefei China Wanyi Science and Technology Company Limited Hefei China

Ultrasound Imaging is one of the most widely used medical imaging methods, and beamforming is the enabling technology of ultrasound imaging, which directly influences the image quality. The critical problem of modern ultrasound imaging system is generating high resolution images at high frame rate. To solve this problem, real-time high precision beamforming delay parameters must be generated. This paper presents the design and implementation of a pipelined high precision beamforming delay calculator for ultrasound imaging, which uses 10-stage pipelined CORDIC (Coordinate Rotation Digital Computer) processor to perform fully pipelined architecture. The presented delay calculator calculates delay parameters with high precision, which can greatly improve the image quality. And fully pipelined architecture can also provide high frame rate. The design has been synthesized for an Altera Arria-II GX FPGA with speed grade 4. A delay calculator requires about 3,238 out of 50,600 available ALUTs (6.4%), and a 64-channel dual-beam system needs 24 such delay calculator modules. The delay calculators run in parallel, and one of them can generate 300 million delay parameters per second.

关键词： Delay Calculators Ultrasonic imaging Array signal processing Transducers Imaging Field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

CT model experimental research on cable saddle zone of extradosed bridge

CT model experimental research on cable saddle zone of extra...

引用

International conference on Consumer Electronics, Communications and Networks

作者： Cheng Haiqian Yang Ping Wuhan University of Technology Wuhan Hubei China

ISBN: (纸本)9781612844589

Most of cable saddle test and theoretical study about extradosed bridge consider that the normal force on arc wall of embedded pipe is evenly distributed. The approximate load simulation will affect the accuracy of analytical results. Referring to the typical cable saddle structure of extradosed bridge, a polyurethane model was produced for this paper. Through a series of CT scan experiment, we obtained contact interface images under two loading conditions. Interface analysis based on image processing technology can provided displacement values of key points on the contact interface. Then the displacement values were applied as loads on the corresponding ANSYS finite element model. Results show that: 1) the contact normal pressure is nearly cosine distribution instead of uniform distribution; 2) There exist stress mutations around the junction of straight line and arc if the embedded pipe adopts "straight-arc-straight" design form. 3) Construction deviation may make excessive extrusion called "end effect" between cable and the exit of embedded pipe, causing the concrete near pipe edge appear stress concentration.

关键词： Computed tomography Bridges Power cables Finite element methods Load modeling Stress Poles and towers

来源：评论

学校读者我要写书评

暂无评论

Extracting ultra-scale Lattice Boltzmann performance via hierarchical and distributed auto-tuning

Extracting ultra-scale Lattice Boltzmann performance via hie...

引用

Supercomputing conference

作者： Samuel Williams Leonid Oliker Jonathan Carter John Shalf Computational Research Division Lawrence Berkeley National Laboratory USA

We are witnessing a rapid evolution of HPC node architectures and on-chip parallelism as power and cooling constraints limit increases in microprocessor clock speeds. In this work, we demonstrate a hierarchical approach towards effectively extracting performance for a variety of emerging multicore-based supercomputing platforms. Our examined application is a structured grid-based Lattice Boltzmann computation that simulates homogeneous isotropic turbulence in magnetohydrodynamics. First, we examine sophisticated sequential auto-tuning techniques including loop transformations, virtual vectorization, and use of ISA-specific intrinsics. Next, we present a variety of parallel optimization approaches including programming model exploration (flat MPI, MPI/OpenMP, and MPI/Pthreads), as well as data and thread decomposition strategies designed to mitigate communication bottlenecks. Finally, we evaluate the impact of our hierarchical tuning techniques using a variety of problem sizes via large-scale simulations on state-of-the-art Cray XT4, Cray XE6, and IBM BlueGene/P platforms. Results show that our unique tuning approach improves performance and energy requirements by up to 3.4x using 49,152 cores, while providing a portable optimization methodology for a variety of numerical methods on forthcoming HPC systems.

关键词： Lattices Distribution functions Optimization Three dimensional displays Vectors Multicore processing Tuning

来源：评论

学校读者我要写书评

暂无评论

Coordinate strip-mining and kernel fusion to lower power consumption on GPU

Coordinate strip-mining and kernel fusion to lower power con...

引用

Design, Automation and Test in Europe conference and Exhibition

作者： Guibin Wang National Laboratory of Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9781612842080

Although general purpose GPUs have relatively high computing capacity, they also introduce high power consumption compared with general purpose CPUs. Therefore low-power techniques targeted for GPUs will be one of the most hot topics in the future. On the other hand, in several application domains, users are unwilling to sacrifice performance to save power. In this paper, we propose an effective kernel fusion method to reduce the power consumption for GPUs without performance loss. Different from executing multiple kernels serially, the proposed method fuses several kernels into one larger kernel. Owing to the fact that most consecutive kernels in an application have data dependency and could not be fused directly, we split large kernel into multiple slices with strip-mining method, then fuse independent sliced kernels into one kernel. Based on the CUDA programming model, we propose three different kernel fusion implementations, with each one targeting for a special case. Based on the different strip-ming methods, we also propose two fusion mechanisms, which are called invariant-slice fusion and variant-slice fusion. The latter one could be better adapted to the requirements of the kernels to be fused. The experimental results validate that the proposed kernel fusion method could effectively reduce the power consumption for GPU.

关键词： Kernel Energy consumption Graphics processing unit Power demand Instruction sets Programming Optimization

来源：评论

学校读者我要写书评

暂无评论

COLOR-COMPONENT BIT ALLOCATION SCHEME FOR JPEG 2000 parallel CODEC

COLOR-COMPONENT BIT ALLOCATION SCHEME FOR JPEG 2000 PARALLEL...

引用

IEEE International conference on image processing

作者： Tonomura, Yoshihide Nakachi, Takayuki Shirai, Daisuke Fujii, Tatsuya Kiya, Hitoshi NTT Corp NTT Network Innovat Labs Tokyo 2390847 Japan Tokyo Metropolitan Univ Fac Syst Design Dept Informat & Commun Syst Engn Hachioji Tokyo 1910065 Japan

ISBN: (纸本)9781424479948

A new bit allocation scheme for JPEG 2000 systems in parallel-distributed environments is proposed. In recent years, super high-definition images are being used for not only digital cinema also alternative services e. g. real-time sports in theaters. In general, such high-definition images are divided into small segments, such as tiles or components, and compressed. However, this process leads to low coding efficiency. In contrast, our proposed scheme controls the bit allocation ratio for each color-component separately by using the quantizer properties available in the JPEG 2000 standard. Simulation results show that the proposed scheme achieves the same coding performance as the non parallel-distributed approach.

关键词： JPEG 2000 Bit allocation parallel processing Rate distortion

来源：评论

学校读者我要写书评

暂无评论

A dynamic parallel approach to recognize tubular breast cancer for TMA image building

A dynamic parallel approach to recognize tubular breast canc...

引用

18th Euromicro International conference on parallel, distributed and Network-Based processing (PDP)

作者： Galizia, Antonella Clematis, Andrea Viti, Federica Milanesi, Luciano CNR Inst Appl Math & Informat Technol Genoa Italy CNR Inst Biomed Technol Milan Italy

ISBN: (纸本)9780769539393

Tissue MicroArray technology aims to perform immunohistochemical staining on hundreds of different tissue samples simultaneously, allowing faster analysis and considerably reducing costs incurred in staining. The presented work supports the pre-array phase of this technique, i.e. the automatic discrimination between normal and pathological regions within the analyzed tissues, and it works in the specific context of tubular breast cancer. The diagnosis is performed by automatically analyzing specific morphological features of the breast samples, in order to define if tissues present a normal behavior either they show pathological characteristics, in particular the absence of a double layer of cells around the lumen or the decay of a regular glands-and-lobules structure. Tissue structure is investigated through a parallel image processing algorithm, which performs the extraction of morphological parameters from the acquired images and compares them to experimentally validated threshold values. The input image is divided into a number of independent sub-images, to be singularly analyzed and labeled according to the result of the computed diagnosis. The time spent to actually analyze each sub-image generally varies depending on the pathological characteristics of each part of the tissue. In order to properly manage and exploit this feature of the algorithm, the analysis of the sub-images is dynamically dispatched among parallel processes. Experimental results, carried on by exploiting the parallel paradigm, certify the actual improvement in the execution time, leading to almost linear speed-up values on the actual tissue elaboration.

关键词： Tissue

来源：评论

学校读者我要写书评

暂无评论

A parallel Algorithm for Molecular Surface Matching Through image Representation

A Parallel Algorithm for Molecular Surface Matching Through ...

引用

18th Euromicro International conference on parallel, distributed and Network-Based processing (PDP)

作者： D'Agostino, Daniele Clematis, Andrea Merelli, Ivan Cozzi, Paolo Milanesi, Luciano CNR Inst Appl Math & Informat Technol Genoa Italy CNR Inst Biomed Technol Milan Italy

ISBN: (纸本)9780769539393

An emerging application field for structure matching is related to in silico studies of molecular biology: considering that protein function is mainly related to its external morphology, the possibility to match macromolecular surfaces is very important to infer information about the interaction of biological components. In this work we present a parallel algorithm based on images of local description, originally designed for object recognition in robotics, which has been adapted to identify surface complementarities for screening the interaction possibilities of biological macromolecules. The results obtained show the good discrimination power of the proposed approach, coupled with high performance figures.

关键词： parallel molecular screening images of local description structural biology

来源：评论

学校读者我要写书评

暂无评论

Large-scale grid computing for content-based image retrieval

引用

ASLIB PROCEEDINGS 2010年第4-5期62卷 438-446页

作者： Town, Chris Harrison, Karl Univ Cambridge Comp Lab Cambridge CB2 3QG England Imense Ltd Cambridge England Univ Birmingham Sch Phys & Astron Birmingham W Midlands England

Purpose - Content-based image retrieval (CBIR) technologies offer many advantages over purely text-based image search. However, one of the drawbacks associated with CBIR is the increased computational cost arising from tasks such as image processing, feature extraction, image classification, and object detection and recognition. Consequently CBIR systems have suffered from a lack of scalability, which has greatly hampered their adoption for real-world public and commercial image search. At the same time, paradigms for large-scale heterogeneous distributed computing such as grid computing, cloud computing, and utility-based computing are gaining traction as a way of providing more scalable and efficient solutions to large-scale computing tasks. Design/methodology/approach - This paper presents an approach in which a large distributed processing grid has been used to apply a range of CBIR methods to a substantial number of images. By massively distributing the required computational task across thousands of grid nodes, very high through-put has been achieved at relatively low overheads. Findings - This has allowed one to analyse and index about 25 million high resolution images thus far, while using just two servers for storage and job submission. The CBIR system was developed by Imense Ltd and is based on automated analysis and recognition of image content using a semantic ontology. It features a range of image-processing and analysis modules, including image segmentation, region classification, scene analysis, object detection, and face recognition methods. Originality/value - In the case of content-based image analysis, the primary performance criterion is the overall through-put achieved by the system in terms of the number of images that can be processed over a given time frame, irrespective of the time taken to process any given image. As such, grid processing has great potential for massively parallel content-based image retrieval and other tasks with similar p

关键词： Data handling Pattern recognition Data analysis Virtual work

来源：评论

学校读者我要写书评

暂无评论

Ultra-fast tomographic reconstruction with a highly optimized Weighted Back-Projection algorithm

Ultra-fast tomographic reconstruction with a highly optimize...

引用

18th Euromicro International conference on parallel, distributed and Network-Based processing (PDP)

作者： Agulleiro, J. I. Garzon, E. M. Garcia, I. Fernandez, J. J. Univ Almeria Dept Comp Architecture & Elect Almeria 04120 Spain

ISBN: (纸本)9780769539393

Electron tomography (ET) allows elucidation of the three-dimensional (3D) structure of large complex biological specimens at molecular resolution. In order to achieve such resolution levels, large projection images have to be used to compute the 3D reconstructions. Tomographic reconstruction on this scale requires a tremendous use of computational resources and a considerable processing time. In this work, we present and evaluate a highly optimized implementation of the Weighted Back-Projection reconstruction algorithm. Briefly, optimizations made to the code comprise (1) vector processing with SSE (Streaming SIMD Extensions) instructions, (2) an efficient use of cache memory, (3) to take advantage of the inherent image symmetry, (4) to use the FFTW (Fastest Fourier Transform in the West) library for image filtering, (5) to use regions of interest and last, but not least, (6) a wide range of minor optimizations like some data pre-calculations or an instruction level parallelism improvement. We have evaluated the method on tomographic reconstructions of several datasets and on two computing platforms. The results show that our version speeds up the method by a factor around 14 or 16, depending on the platform.

关键词： 3D image reconstruction Back-Projection Code optimization Tomography Vectorization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：