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

Research on key technologies of edge cache in virtual data space across WAN

Frontiers of computer science 2023年第1期17卷 15-34页

作者： Jiantong HUO Yaowen XU Zhisheng HUO Limin XIAO Zhenxue HE State Key Laboratory of Software Development Environment Beihang UniversityBeijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China High Performance Computing Center Beihang UniversityBeijing 100191China College of Software Beihang UniversityBeijing 100191China Hebei Key Laboratory of Agricultural Big Data Hebei Agricultural UniversityBaoding 071001China College of Computer Science and Technology Zhejiang UniversityHangZhou 310013China

The authors of this paper have previously proposed the global virtual data space system (GVDS) to aggregate the scattered and autonomous storage resources in China’s national supercomputer grid (National Supercomputing Center in Guangzhou, National Supercomputing Center in Jinan, National Supercomputing Center in Changsha, Shanghai Supercomputing Center, and computer Network Information Center in Chinese Academy of sciences) into a storage system that spans the wide area network (WAN), which realizes the unified management of global storage resources in China. At present, the GVDS has been successfully deployed in the China National Grid environment. However, when accessing and sharing remote data in the WAN, the GVDS will cause redundant transmission of data and waste a lot of network bandwidth resources. In this paper, we propose an edge cache system as a supplementary system of the GVDS to improve the performance of upper-level applications accessing and sharing remote data. Specifically, we first designs the architecture of the edge cache system, and then study the key technologies of this architecture: the edge cache index mechanism based on double-layer hashing, the edge cache replacement strategy based on the GDSF algorithm, the request routing based on consistent hashing method, and the cluster member maintenance method based on the SWIM protocol. The experimental results show that the edge cache system has successfully implemented the relevant operation functions (read, write, deletion, modification, etc.) and is compatible with the POSIX interface in terms of function. Further, it can greatly reduce the amount of data transmission and increase the data access bandwidth when the accessed file is located at the edge cache system in terms of performance, i.e., its performance is close to the performance of the network file system in the local area network (LAN).

关键词： virtual data space system wide area network edge cache redundant data transmission

来源：评论

学校读者我要写书评

暂无评论

NNMF-based factorization techniques for high-accuracy privacy protection on non-negative-valued datasets

NNMF-based factorization techniques for high-accuracy privac...

引用

作者： Wang, Jie Zhong, Weijun Zhang, Jun Department of Management Sciences and Engineering Southeast University Nanjing 210096 China Laboratory for High Performance Scientific Computing and Computer Simulation Department of Computer Sciences University of Kentucky Lexington KY 4056 United States

ISBN: (纸本)0769527027

The challenge in preserving data privacy is how to protect attribute values without jeopardizing the similarity between data objects under analysis. In this paper, we further our previous work on applying matrix techniques to protect privacy and present a novel algebraic technique based on iterative methods for non-negative-valued data distortion. As an unsupervised learning method for uncovering latent features in high-dimensional data, a low rank nonnegative matrix factorization (NNMF) is used to preserve natural data non-negativity and avoid subtractive basis vector and encoding interactions present in techniques such as principal component analysis. It is the first in privacy preserving data mining in our paper that combining non-negative matrix decomposition with distortion processing. Two iterative methods to solve bound-constrained optimization problem in NMF are compared by experiments on Wisconsin Breast Cancer Dataset. The overall performance of NMF on distortion level and data utility is compared to our previously-proposed SVD-based distortion strategies and other existing popular data perturbation methods. Data utility is examined by cross validation of a binary classification using the support vector machine. Our experimental results on data mining benchmark datasets indicate that, in comparison with standard data distortion techniques, the proposed NMF-based method are very efficient in balancing data privacy and data utility, and it affords a feasible solution with a good promise on high-accuracy privacy preserving data mining. © 2006 IEEE.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

Recent Advances in In-Memory computing:Exploring Memristor and Memtransistor Arrays with 2D Materials

引用

Nano-Micro Letters 2024年第7期16卷 1-30页

作者： Hangbo Zhou Sifan Li Kah-Wee Ang Yong-Wei Zhang Institute of High Performance Computing(IHPC) Agency for ScienceTechnology and Research(A*STAR)1 Fusionopolis Way#16-16 ConnexisSingapore 138632Republic of Singapore Department of Electrical and Computer Engineering National University of Singapore4 Engineering Drive 3Singapore 117583Republic of Singapore Institute of Materials Research and Engineering Agency for ScienceTechnology and Research(A*STAR)2 Fusionopolis WaySingapore 138634Republic of Singapore

The conventional computing architecture faces substantial chal-lenges,including high latency and energy consumption between memory and processing *** response,in-memory computing has emerged as a promising alternative architecture,enabling computing operations within memory arrays to overcome these *** devices have gained significant attention as key components for in-memory computing due to their high-density arrays,rapid response times,and ability to emulate biological *** these devices,two-dimensional(2D)material-based memristor and memtransistor arrays have emerged as particularly promising candidates for next-generation in-memory computing,thanks to their exceptional performance driven by the unique properties of 2D materials,such as layered structures,mechanical flexibility,and the capability to form *** review delves into the state-of-the-art research on 2D material-based memristive arrays,encompassing critical aspects such as material selection,device perfor-mance metrics,array structures,and potential ***,it provides a comprehensive overview of the current challenges and limitations associated with these arrays,along with potential *** primary objective of this review is to serve as a significant milestone in realizing next-generation in-memory computing utilizing 2D materials and bridge the gap from single-device characterization to array-level and system-level implementations of neuromorphic computing,leveraging the potential of 2D material-based memristive devices.

关键词： 2D materials Memristors Memtransistors Crossbar array In-memory computing

来源：评论

学校读者我要写书评

暂无评论

A network management system based on DPI

A network management system based on DPI

引用

International Conference on Network-Based Information Systems

作者： Yang, Chu-Sing Liao, Ming-Yi Luo, Mon-Yen Wang, Shin-Min Yeh, C. Eugene Department of Electrical Engineering Institute of Computer and Communication Engineering National Cheng Kung University Taiwan Department of Computer Science and Information Engineering National Kaohsiung University of Applied Sciences Kaohsiung Taiwan National Center for High-Performance Computing Taiwan

ISBN: (纸本)9780769541679

More and more network applications have appeared in recent years. Government, university, industry and individual Internet users and network services need more bandwidth and various network applications. Many new network protocols are proposed so that it is now becoming harder to manage the network. In the conditional network, every network protocol uses the fixed port, the so-called well-known port number. In the past, it was easy to classify and manage the network traffic because we could identify the network service by the port number. However, new types of network applications do not use fixed port number. The method of traffic classification with fixed port number is inadequate. In recent years, the DPI (Deep Packet Inspection) is used to classify the traffic. This study deploys a NMS (network management system) based on DPI and SNMP. The NMS controls the network devices and services according to the traffic classification of DPIS (DPI server). The platform of DPIS is implemented on the Netfilter framework in Linux kernel. © 2010 IEEE.

关键词： Network management

来源：评论

学校读者我要写书评

暂无评论

PEPC: Parallel and Extensible PC Implementation for Causal Structure Learning 23

PEPC: Parallel and Extensible PC Implementation for Causal S...

引用

7th International Conference on high performance Compilation, computing and Communications, HP3C 2023

作者： Feng, Yongquan Xu, Liyang Huang, Wanrong Yang, Wenjing Lu, Yutong Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha China School of Computer Science and Engineering Sun Yat-sen University Guangzhou China

ISBN: (纸本)9781450399883

Learning the causal relationships among variables from observational data has been a significant problem in statistics and data mining, and one such algorithm is the PC algorithm. However, the existing CPU-based implementations are difficult to support Causal Structure Learning(CSL) on complex observational data due to inefficiency. In this paper, we propose an efficient CPU-based parallel implementation of the PC algorithm, called PEPC. It has an extensible framework, and some optimizations are adopted to reduce the CSL computation of the PC algorithm. Moreover, our PEPC supports efficient multi-thread parallelism. The experimental results demonstrate that PEPC outperforms existing methods in serial efficiency and multi-thread parallelism. In serial tests, our method achieves the maximum speedup ratios of 577.26, 116.74, and 134.68 over three existing approaches, Stable, ***, and Tetrad. In parallel experiments, it achieves 10.66X speedup when running the PC algorithm with 12 threads. © 2023 ACM.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

The Library for Hadoop Deflate Compression Based on FPGA Accelerator with Load Balance 20

The Library for Hadoop Deflate Compression Based on FPGA Acc...

引用

20th International Conference on Parallel and Distributed computing, Applications and Technologies, PDCAT 2019

作者： Du, Haixin Zhang, Jiankui Sha, Shihao Ye, Cai Luo, Qiuming College of Computer Science and Software Engineering Shenzhen University NHPCC/Guangdong Key Laboratory of Popular HPC Guangdong Province Engineering Center of China-made High Performance Data Computing System Shenzhen China

ISBN: (纸本)9781728126166

Hadoop application will produce lots of intermediate results in the map/reduce process that requires disk I/O and network transmission. By compressing the large-scale data of intermediate result, it will greatly improve disk access efficiently and reduce program run time. Hardware-accelerated solutions have become more desirable. This paper design a multi-FPGA compression accelerator on the Hadoop platform, and the system performance analysis compared with a software-only solution that mainly uses CPU to processing. The testing programs are zpipe, TestDFSIO and Terasort. In contrast with the software-only solution. The max speedup of zpipe is 6.55X (single FPGA) and 10.24X (dual FPGA), the max speedup of TestDFSIO is 6.28X (single FPGA) and 6.28X (dual FPGA), and the max speedup of Terasort application is up to 3.25X(single FPGA) and 3.35X(dual FPGA). © 2019 IEEE.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

A holistic stream partitioning algorithm for distributed stream processing systems 20

A holistic stream partitioning algorithm for distributed str...

引用

20th International Conference on Parallel and Distributed computing, Applications and Technologies, PDCAT 2019

作者： Li, Kejian Liu, Gang Lu, Minhua Guangdong Province Key Laboratory of Popular High Performance Computers Guangdong Province Engineering Center of China-made High Performance Data Computing System College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China School of Biomedical Engineering Shenzhen University Shenzhen518060 China

ISBN: (纸本)9781728126166

The performances of modern distributed stream processing systems are critically affected by the distribution of the load across workers. Skewed data streams in real world are very common and pose a great challenge to these systems, especially for stateful applications. Key splitting, which allows a single key to be routed to multiple workers, is a great idea to achieve good balance of load in the cluster. However, it comes with the cost of increased memory consumption and computation overhead as well as network communication. In this paper, we present a new definition of metric to model the cost of key splitting for intra-operator parallelism in stream processing systems and provide a novel perspective to reduce replication factor while keeping both overall load imbalance and processing latency low. Similar to previous work, our approach treats the head and the tail of the distribution differently in order to reduce memory requirements. For the head, it uses our proposed notion of regional load imbalance to decide dynamically whether to make one more worker responsible for the heavy hitter or not. For the tail, it simply uses hash partitioning to keep the size of the routing table for the head as small as possible. Extensive experimental evaluation demonstrates that our approach provides superior performance compared to the state-of-the-art partitioning algorithms in terms of load imbalance, replication factor and latency over different levels of skewed stream distributions. © 2019 IEEE.

关键词： Distributed parameter control systems

来源：评论

学校读者我要写书评

暂无评论

Rapid prototyping techniques for fuzzy controllers 5th

Rapid prototyping techniques for fuzzy controllers

引用

5th Asian computing science Conference on Advances in computing science, ASIAN 1999

作者： Chantrapornchai, Chantana Tongsima, Sissades Sha, Edwin Silpakorn University Nakorn Pathom7300 Thailand National Electronics and Computer Technology Center High Performance Computing Laboratory Bangkok10400 Thailand Department of Computer Science and Engineering University of Notre Dame Notre DameIN46556 United States

ISBN: (纸本)354066856X

In this paper, a new framework for rapid system design and implementation for fuzzy systems is proposed. The given system specification is separated into two components: A conceptual specification and a parameter specification. The conceptual specification defines the system core, which is rarely changed during the system adjustment and may be implemented in hardware at an early stage of the design process. The parameter specification defines parameters that are often changed and are implemented in software for easy adjustment. Such a partitioning ap- proach integrates both hardware and software capability. The presented methodology gives a rapid prototyping and efficient system tuning process which, therefore, can reduce the development cycle time and increase flexibility when designing fuzzy systems. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Rapid prototyping

来源：评论

学校读者我要写书评

暂无评论

Parallel erasure coding: Exploring task parallelism in erasure coding for enhanced bandwidth and energy efficiency 11

Parallel erasure coding: Exploring task parallelism in erasu...

引用

11th IEEE International Conference on Networking Architecture and Storage, NAS 2016

作者： Chen, Hsing-Bung Fu, Song High Performance Computing-Design Group Los Alamos National Laboratory Los AlamosNM87545 United States Department of Computer Science and Engineering University of North Texas DentonTX76203 United States

ISBN: (纸本)9781509033157

Very large data sets within the range of megabytes to terabytes generated daily from checkpoint-and- restart processes are seen in today's scientific simulations. Reliability and durability are two important factors to build an archive storage system. Erasure code based object storage systems are becoming popular choices for archive storage systems due to cost-effective storage space saving schemes and higher fault-resilience capabilities. Both erasure code encoding and decoding procedures involve heavy array, matrix, and table-lookup compute intensive operations. Current solutions of the erasure coding process are based on single process approach which is not capable of processing very large data sets efficient and effectively. In this paper, we address the bottleneck problem of single process erasure encoding by leveraging task parallelism offered by multi-core computers. We add parallel processing capability to the erasure coding process. More specifically, we develop a parallel erasure coding software, called parEC. It explores the MPI run time parallel I/O environment and integrates data placement process for distributing encoded data blocks to destination storage devices. We evaluate the performance of parEC in terms of both encoding throughput and energy efficiency. We also compare the performance of two task scheduling algorithms for parEC. Our experimental results show parEC can significantly reduce the encoding time (i.e., by 74.06%-96.86%) and energy consumption (i.e., by 73.57%-96.86%), and Demand-based Workload Assignment (DBWA) algorithm can a high system utilization (i.e., 95.23%). © 2016 IEEE.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

CoChain: high Concurrency Blockchain Sharding via Consensus on Consensus 42

CoChain: High Concurrency Blockchain Sharding via Consensus ...

引用

42nd IEEE International Conference on computer Communications, INFOCOM 2023

作者： Li, Mingzhe Lin, You Zhang, Jin Wang, Wei Southern University of Science and Technology Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation Research Institute of Trustworthy Autonomous Systems Computer Science and Engineering Department China Hong Kong University of Science and Technology Computer Science and Engineering Department Hong Kong Institute of High Performance Computing and Agency for Science Technology and Research Singapore

ISBN: (纸本)9798350334142

Sharding is an effective technique to improve the scalability of blockchain. It splits nodes into multiple groups so that they can process transactions in parallel. To achieve higher parallelism and concurrency at large scales, it is desirable to maintain a large number of small shards. However, simply configuring small shards easily results in a higher fraction of malicious nodes inside shards, causing shard corruption and compromising system security. Existing sharding techniques hence demand large shards, at the expense of limited concurrency. To address this limitation, we propose CoChain: a blockchain sharding system that can securely configure small shards for enhanced concurrency. CoChain allows some shards to be corrupted. For security, each shard is monitored by multiple other shards. The latter reach a cross-shard Consensus on the Consensus results of their monitored shard. Once a corrupted shard is found, its subsequent consensus will be taken over by another shard, hence recovering the system. Via Consensus on Consensus, CoChain allows the existence of shards with more fraction of malicious nodes ( © 2023 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：