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

arXiv 2022年

作者： Li, Huize Jin, Hai Zheng, Long Liao, Xiaofei Huang, Yu Liu, Cong Xu, Jiahong Duan, Zhuohui Chen, Dan Gui, Chuangyi National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

The attention-based neural network attracts great interest due to its excellent accuracy enhancement. However, the attention mechanism requires huge computational efforts to process unnecessary calculations, significantly limiting the system’s performance. To reduce the unnecessary calculations, researchers propose sparse attention to convert some dense-dense matrices multiplication (DDMM) operations to sampled dense-dense matrix multiplication (SDDMM) and sparse matrix multiplication (SpMM) operations. However, current sparse attention solutions introduce massive off-chip random memory access since the sparse attention matrix is generally unstructured. We propose CPSAA, a novel crossbar-based processing-in-memory (PIM)-featured sparse attention accelerator to eliminate off-chip data transmissions. First, we present a novel attention calculation mode to balance the crossbar writing and crossbar processing latency. Second, we design a novel PIM-based sparsity pruning architecture to eliminate the pruning phase’s off-chip data transfers. Finally, we present novel crossbar-based SDDMM and SpMM methods to process unstructured sparse attention matrices by coupling two types of crossbar arrays. Experimental results show that CPSAA has an average of 89.6×, 32.2×, 17.8×, 3.39×, and 3.84× performance improvement and 755.6×, 55.3×, 21.3×, 5.7×, and 4.9× energy-saving when compare with GPU, FPGA, SANGER, ReBERT, and ReTransformer. Copyright © 2022, The Authors. All rights reserved.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

FLoc: Fingerprint-Based Indoor Localization system under a Federated Learning Updating Framework

FLoc: Fingerprint-Based Indoor Localization System under a F...

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Yuxiang Liu Huichuwu Li Jiang Xiao Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9781728152127

ISBN: (纸本)9781728152134

Fingerprinting-based indoor localization via WiFi has achieved a great breakthrough in the past decade. However, it suffers from an inherent problem that the localization accuracy declines sharply over time due to the dynamic environment and unstable WiFi devices. Researchers have designed many methods to update the localization model, e.g., crowdsourcing-based model updating, in order to maintain the localization accuracy. Unfortunately, they have not taken the privacy into consideration during the updating process. This will lead to a threat that the eavesdroppers could guess the location providers' private information according to the updating model. For the goal of maintaining the localization accuracy without the risk of privacy breaching, we proposed FLoc, a fingerprinting-based indoor localization system which updates the localization model via a federated learning framework. In FLoc, every provider maintains a local localization model in their own device. They will regularly encrypt the updating parameters and share them to a common model server. At the model server, it aggregates the encrypted information of the local models to maintain a general model, which will be sent back to the local devices for next updating iteration. We evaluate FLoc in an APs unknown laboratory corridor. The experiment results show that FLoc has a comparable localization performance. Moreover, it can successfully protect the providers' privacy, since the information transferred is all encrypted.

关键词： Mobile handsets Privacy Fingerprint recognition Servers Wireless fidelity Databases Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Optimal Margin Distribution Machine with Sparsity Inducing Penalty

Optimal Margin Distribution Machine with Sparsity Inducing P...

引用

International Conference on Big Data and Smart computing (BIGCOMP)

作者： Teng Zhang Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9781728160344

ISBN: (纸本)9781728160351

Recently a promising research direction of statistical learning has been advocated, i.e., the optimal margin distribution learning, with the central idea of optimizing the margin distribution. As the most representative approach of this new learning paradigm, the optimal margin distribution machine (ODM) considers maximizing the margin mean and minimizing the margin variance simultaneously. The standard ODM exploits the ℓ_2-norm penalty, which gives rise to a dense decision boundary. However, in some situations, the model with parsimonious representation is more preferred, due to the redundant noisy features or limited computing resources. In this paper, we propose the sparse optimal margin distribution machine (Sparse ODM), which aims to achieve better generalization performance with moderate model size. For optimization, we extends an efficient coordinate descent method to solve the final problem since the variables are decoupled. In each iteration, we propose a modified Newton method to solve the one-variable sub-problem. Experimental results on both synthetic and real data sets show the superiority of the proposed method.

关键词： Standards Newton method Noise measurement Optimization Support vector machines Computational modeling Training

来源：评论

学校读者我要写书评

暂无评论

Design and Simulation of Multi-tiered Heterogeneous Memory Architecture

Design and Simulation of Multi-tiered Heterogeneous Memory A...

引用

International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication systems (MASCOTS)

作者： Jinyuan Hu Haikun Liu Hai Jin Xiaofei Liao National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Heterogeneous memory systems have become increasingly popular in recent years. Because heterogeneous storage media often show significantly different characteristics in terms of bandwidth, latency, capacity, and energy consumption, it is still challenging to best utilize them for cost-efficient and energy-efficient heterogeneous memory systems. In this paper, we propose a simulation framework for multi-tiered heterogeneous memory architectures based on GEM5 and DRAMsim3 simulators. We design a heterogeneous memory controller to architect Non-Volatile Memory (NVM) as main memory, and architect both Dynamic Random Access Memory (DRAM) and High-Bandwidth Memory (HBM) as a hybrid cache of NVM. Specifically, HBM, DRAM, and NVM are managed in a single (flat) address space. However, we use an address remapping table to maintain the mappings between NVM pages and HBM/DRAM pages, and logically manage HBM/DRAM/NVM as a three-tiered hybrid memory system. We also design a hardware-supported hot page monitor based on Majority Element Algorithm (MEA) to identify the hottest pages in the DRAM, and a dynamic threshold adjustment scheme for hot page migration to balance the memory bandwidth between DRAM and HBM. Our multi-tiered heterogeneous memory architecture can take advantage of the large capacity of NVM, the low latency of DRAM, and the high bandwidth of HBM concurrently. Experimental results show that our tiered memory architecture can improve application performance by an average of $2.5\times$ compared with an NVM-only architecture, and up to 57.4% compared with a DRAM-only architecture. Moreover, the performance gap between our HBM/DRAM/NVM architecture and a HBM-only architecture is less than 10%.

关键词： Analytical models Nonvolatile memory Heuristic algorithms Computational modeling Memory architecture Random access memory Computer architecture

来源：评论

学校读者我要写书评

暂无评论

VRFPS: A Novel Virtual Machine-Based Real-time File Protection system

VRFPS: A Novel Virtual Machine-Based Real-time File Protecti...

引用

International Conference on Software Engineering Research, Management and Applications (SERA)

作者： Feng Zhao Yali Jiang Guofu Xiang Hai Jin Wenbin Jiang Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

With the development of virtualization technology, file protection in virtual machine, especially in guest OS, becomes more and more important. Traditional host-based file protection system resides the critical modules in monitored system, which is easily explored and destroyed by malwares. Moreover, in order to protect the multiple operation systems running on the same platform, it is necessary to install independent file protection system for each of them, which greatly wastes computing resources and brings serious performance overhead. In this paper, a novel VM-based real-time file protection system, named VRFPS, is proposed to solve these problems. First, virtual machine monitor introspects all file operations of guest OS. Then, semantic gap between disk block and logic files is narrowed by blktap. Finally, a virtual sandbox is implemented in privileged domain to prevent protected files in guest domain from modifying illegally. Our approach is highly isolated, transparent and without modification on virtual machine monitor and guest OS. The experimental results show that the presented system is validate and of low performance overhead.

关键词： Real time systems Protection Virtual machining Kernel Operating systems Virtual machine monitors Application virtualization Data security Access control Software engineering

来源：评论

学校读者我要写书评

暂无评论

PMonitor: A Lightweight Performance Monitor for Virtual Machines

PMonitor: A Lightweight Performance Monitor for Virtual Mach...

引用

International Workshop on Education technology and Computer Science, ETCS

作者： Zhiyuan Shao Hai Jin Xiaowen Lu Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Performance monitor for virtual machines can monitor the performance metrics of virtual machines and gain the resource consumption status, and thus provide reliable basis for system performance evaluation and further management. However, at current stage, such performance monitor systems for the virtualized systems are inadequate and inefficient. In this paper, we propose a lightweight performance monitor system model for virtual machines, called PMonitor. Through prototype implementation and experiments, we find that PMonitor consumes very few processing power, which is much lower than other open source performance monitors running on the virtualized environments.

关键词： Condition monitoring Virtual machine monitors Virtual machining Measurement Performance gain system performance Resource management Power system management Power system modeling Virtual prototyping

来源：评论

学校读者我要写书评

暂无评论

VirtCFT: A Transparent VM-Level Fault-Tolerant system for Virtual clusters

VirtCFT: A Transparent VM-Level Fault-Tolerant System for Vi...

引用

International Conference on Parallel and Distributed systems (ICPADS)

作者： Minjia Zhang Hai Jin Xuanhua Shi Song Wu Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

A virtual cluster consists of a multitude of virtual machines and software components that are doomed to fail eventually. In many environments, such failures can result in unanticipated, potentially devastating failure behavior and in service unavailability. The ability of failover is essential to the virtual cluster's availability, reliability, and manageability. Most of the existing methods have several common disadvantages: requiring modifications to the target processes or their OSes, which is usually error prone and sometimes impractical; only targeting at taking checkpoints of processes, not whole entire OS images, which limits the areas to be applied. In this paper we present VirtCFT, an innovative and practical system of fault tolerance for virtual cluster. VirtCFT is a system-level, coordinated distributed checkpointing fault tolerant system. It coordinates the distributed VMs to periodically reach the globally consistent state and take the checkpoint of the whole virtual cluster including states of CPU, memory, disk of each VM as well as the network communications. When faults occur, VirtCFT will automatically recover the entire virtual cluster to the correct state within a few seconds and keep it running. Superior to all the existing fault tolerance mechanisms, VirtCFT provides a simpler and totally transparent fault tolerant platform that allows existing, unmodified software and operating system (version unawareness) to be protected from the failure of the physical machine on which it runs. We have implemented this system based on the Xen virtualization platform. Our experiments with real-world benchmarks demonstrate the effectiveness and correctness of VirtCFT.

关键词： Virtual machining Fault tolerant systems Fault tolerance Checkpointing Protocols Kernel

来源：评论

学校读者我要写书评

暂无评论

Live virtual machine migration with adaptive, memory compression

Live virtual machine migration with adaptive, memory compres...

引用

IEEE International Conference on cluster computing

作者： Hai Jin Li Deng Song Wu Xuanhua Shi Xiaodong Pan Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Live migration of virtual machines has been a powerful tool to facilitate system maintenance, load balancing, fault tolerance, and power-saving, especially in clusters or data centers. Although pre-copy is a predominantly used approach in the state of the art, it is difficult to provide quick migration with low network overhead, due to a great amount of transferred data during migration, leading to large performance degradation of virtual machine services. This paper presents the design and implementation of a novel memory-compression-based VM migration approach (MECOM) that first uses memory compression to provide fast, stable virtual machine migration, while guaranteeing the virtual machine services to be slightly affected. Based on memory page characteristics, we design an adaptive zero-aware compression algorithm for balancing the performance and the cost of virtual machine migration. Pages are quickly compressed in batches on the source and exactly recovered on the target. Experiment demonstrates that compared with Xen, our system can significantly reduce 27.1% of downtime, 32% of total migration time and 68.8% of total transferred data on average.

关键词： Virtual machining Virtual manufacturing Degradation Voice mail Power system management Load management Fault tolerant systems Energy management Chromium Computers

来源：评论

学校读者我要写书评

暂无评论

Yarqs: Yet Another Range Queries Schema in DHT Based P2P Network

Yarqs: Yet Another Range Queries Schema in DHT Based P2P Net...

引用

International Conference on Computer and Information technology (CIT)

作者： Hao Zhang Hai Jin Qin Zhang Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Range query in DHT based P2P network is a hot topic in recent researches. The hashing function in DHT protocols makes the data hard to keep their original order relationship. Hence range queries for such networks become difficult. This paper presents the design of Yarqs-a new schema to achieve range queries in DHT based P2P networks. By using the inherent characteristics of DHT based networks, Yarqs catches the data pass the nodes and organizes them as a cache network. The range queries are deployed over the cache network. Yarqs does not change the design of the DHT overlay and builds the architecture for range queries by using the historical DHT queries data. Yarqs supports inherent load balancing. We also study the performance of Yarqs in evaluation section. The experiments to check the influences of different parameters of Yarqs are deployed and analyzed.

关键词： Load management Peer to peer computing Data structures Protocols grid computing Computer networks Information technology Computer science Dictionaries Costs

来源：评论

学校读者我要写书评

暂无评论

Content-Based Design Patent Image Retrieval Using Structured Features and Multiple Feature Fusion

Content-Based Design Patent Image Retrieval Using Structured...

引用

International Conference on Image and Graphics (ICIG)

作者： Lei Zhu Hai Jin Ran Zheng Qin Zhang Xia Xie Mingrui Guo Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Traditional design patent verification based on manual comparison is too labor-intensive, time-consuming and subjective to be applied efficiently in practice. Design patent image retrieval system is designed to retrieve some similar patent images with much visual similarities. Structured features and multiple feature fusion are two main technologies to ensure the retrieval accuracy in the system. Block-wise Dense SIFT (Block-DSIFT), Pyramid Histograms of Orientation Gradients (PHOG), and GIST are proposed as main structured features. A multiple feature fusion algorithm for content-based design patent image retrieval is proposed to formulate the fusion as the linear combination of different matrixes which represent different feature distances between images to improve the precision of retrieval. The weights that reflect the significance of the features are determined by quadratic programming and can be solved efficiently. Experiments on a database of real design patent images show good efficiency and robustness of the proposed method and the system can be applied to design patent copyright validation.

关键词： Patents Feature extraction Histograms Image retrieval Shape Measurement Image color analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：