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

36th International Conference on Massive Storage systems and technology, MSST 2020

作者： Liu, Haikun Ye, Yuanyuan Liao, Xiaofei Jin, Hai Zhang, Yu Jiang, Wenbin He, Bingsheng 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 Wuhan430074 China School of Computing National University of Singapore Singapore

Emerging Non-Volatile Main Memory (NVMM) technologies generally feature high density, low energy consumption and cost per bit compared to DRAM. However, the limited write endurance of NVMM poses a significant challenge of using NVMM as an substitute for DRAM. This paper proposes a space-oblivious compression and wear-leveling based memory architecture to improve the write endurance of NVMM. As memory blocks of many applications usually contain a large amount of zero bytes and frequent values, we propose a nonuniform compression encoding scheme that integrates Zero Deduplication with Frequent Value Compression (called ZD-FVC) to reduce bit-writes on NVMM. Moreover, we leverage the memory space available through compression to achieve an intra-block wear leveling policy. It rotates the writing positions of a compressed data block within the data’s initial memory space, and thus enhances write endurance by balancing the bit-writes per NVMM cell. ZD-FVC can be integrated into the NVMM module and implemented entirely by hardware, without any intervention of Operating systems. We implement ZD-FVC in Gem5 and NVMain simulators, and evaluate it with several programs from SPEC CPU2006. Experimental results shows that ZD-FVC is much better than several state-of-the-art approaches. Particularly, ZD-FVC can improve data compression ratio by 55% compared to Frequent Value Compression. Compared with the Data Comparison Write, ZD-FVC is able to significantly improve the lifetime of NVMM by 3.3X on average, and also reduces NVMM write latency by 31% and energy consumption by 19% on average. © 2020 36th International Conference on Massive Storage systems and technology, MSST 2020. All Rights Reserved.

关键词： Dynamic random access storage

来源：评论

学校读者我要写书评

暂无评论

Demystifying Ethereum account diversity:observations,models and analysis

引用

Frontiers of Computer Science 2022年第4期16卷 119-130页

作者： Chaofan Wang Xiaohai Dai Jiang Xiao Chenchen Li Ming Wen Bingbing Zhou Hai Jin Clusters and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabWuhan430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan430074China School of Cyber Science and Engineering Huazhong University of Science and TechnologyWuhan430074China Centre for Distributed and High Performance Computing School of Information TechnologiesThe University of SydneyCamperdownNew South Wales2006Australia

Blockchain platform Ethereum has involved millions of accounts due to its strong potential for providing numerous services based on smart *** massive accounts can be divided into diverse categories,such as miners,tokens,and exchanges,which is termed as account diversity in this *** benefit of investigating diversity are multi-fold,including understanding the Ethereum ecosystem deeper and opening the possibility of tracking certain abnormal ***,the exploration of blockchain account diversity remains *** the most relevant studies,which focus on the deanonymization of the accounts on Bitcoin,can hardly be applied on Ethereum since their underlying protocols and user idioms are *** this end,we present the first attempt to demystify the account diversity on *** key observation is that different accounts exhibit diverse behavior patterns,leading us to propose the heuristics for classification as the *** then raise the coverage rate of classification by the statistical learning model Maximum Likelihood Estimation(MLE).We collect real-world data through extensive efforts to evaluate our proposed method and show its ***,we make an in-depth analysis of the dynamic evolution of the Ethereum ecosystem and uncover the abnormal arbitrage *** for the former,we validate two sweeping statements reliably:(1)standalone miners are gradually replaced by the mining pools and cooperative miners;(2)transactions related to the mining pool and exchanges take up a large share of the total *** latter analysis shows that there are a large number of arbitrage transactions transferring the coins from one exchange to another to make a price difference.

关键词： blockchain Ethereum classification account diversity network analysis

来源：评论

学校读者我要写书评

暂无评论

Performance modeling of resource failures in grid environments

Performance modeling of resource failures in grid environmen...

引用

International Conference on Frontier of Computer Science and technology

作者： Tao, Yongcai Wu, Song Shi, Lei School of Information Engineering Zhengzhou University Zhengzhou Henan 450001 China Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9780769541396

grid is susceptible to a number of software and hardware failures, so a deep understanding of and modeling the grid resource failures are a challenge and have significant influence on grid researching. However, due to various reasons such as commercial secret and security, it is difficult to obtain real historical logs of grids. Therefore, an accurate model of resource failures is critically useful. In the paper, through analyzing the grid log data, we detail the suitability of three potential statistical distributions for each data set: Wetbull, Zipf's law and Pareto. Then, this paper develops a grid resource failure simulator. Finally, with the different failure patterns generated by the failure simulator, the paper evaluates several common scheduling algorithms used in grid systems. © 2010 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

HCOpt: An automatic optimizer for configuration parameters of Hadoop 2nd

HCOpt: An automatic optimizer for configuration parameters o...

引用

2nd International Conference on Human Centered computing, HCC 2016

作者： Zhang, Xiong Zeng, Linxi Shi, Xuanhua Wu, Song Xie, Xia Jin, Hai Services Computing Technology and System Laboratory Big Data Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9783319318530

MapReduce is an efficient tool for data-intensive applications. Hadoop, an open-source implementation of MapReduce, has been widely adopted and experienced by some enterprises and scientific computing communities. However, when users intend to run a MapReduce program in Hadoop, they have to set a number of configuration parameters to make sure the program runs efficiently. Users often run into performance problems because they are unaware of how to set these parameters. To address these performance problems, we focus on the optimization opportunities presented by the high configurability of Hadoop, and propose an automation tool named HCOpt for performance optimization of Hadoop configuration parameters. HCOpt uses a Profile Engine to collect monitoring information from running MapReduce programs, a Prediction Engine to estimate the performance of a given Hadoop configuration and a genetic-based search algorithm to find an optimized configuration in the large search space. Our evaluation shows that HCOpt reduces the job completion time of Hadoop applications by up to 20 % when compared to applications run with configuration parameters that suggested by the rule-based optimization. © Springer International Publishing Switzerland 2016.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Efficient mobile code offloading in heterogeneous wireless networks

Efficient mobile code offloading in heterogeneous wireless n...

引用

作者： Lu, Feng Liu, Ruoxue Li, Wei Jin, Hai Zomaya, Albert Y. Services Computing Technology and System Lab Big Data Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Center for Distributed and High Performance Computing School of Information Technologies The University of Sydney Sydney Australia

Mobile data offloading has already appeared to offer the means of addressing the challenges of limited computing capability and battery life of mobile devices. Most existing code offloading frameworks only consider migrating an application within a single network at a time and failed to fully utilize the energy efficiency mechanism of the latest CPU chips. To tackle these issues, we propose an offloading approach under both a multitasking environment and a heterogeneous network to increase energy and execution efficiency. The offloading problem was formulated as a biobjective optimization problem that aims to save energy and keep a good performance by combining mobile cloud computing with *** technology under a heterogeneous network equipped with cellular and WiFi connectivity. By varying the applications and network scenarios, the experimental results show that with offloading a single application using our proposed framework, the data-intensive application can obviously benefit when the access point density of WiFi reaches 0.0002 unit/m2. Under multiple application scenarios, our proposed framework can increase processing speed by an average of 0.3× over the single application and can save an average of 25% power over the single application. © 2019 John Wiley & Sons, Ltd.

关键词： Heterogeneous networks

来源：评论

学校读者我要写书评

暂无评论

FedRKG: A Privacy-Preserving Federated Recommendation Framework via Knowledge Graph Enhancement 18th

FedRKG: A Privacy-Preserving Federated Recommendation Framew...

引用

18th International Conference on Green, Pervasive, and Cloud computing, GPC 2023

作者： Yao, Dezhong Liu, Tongtong Cao, Qi Jin, Hai 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 Wuhan430074 China School of Computing Science University of Glasgow Glasgow United Kingdom

ISBN: (纸本)9789819998951

Federated Learning (FL) has emerged as a promising approach for preserving data privacy in recommendation systems by training models locally. Recently, Graph Neural Networks (GNN) have gained popularity in recommendation tasks due to their ability to capture high-order interactions between users and items. However, privacy concerns prevent the global sharing of the entire user-item graph. To address this limitation, some methods create pseudo-interacted items or users in the graph to compensate for missing information for each client. Unfortunately, these methods introduce random noise and raise privacy concerns. In this paper, we propose FedRKG, a novel federated recommendation system, where a global knowledge graph (KG) is constructed and maintained on the server using publicly available item information, enabling higher-order user-item interactions. On the client side, a relation-aware GNN model leverages diverse KG relationships. To protect local interaction items and obscure gradients, we employ pseudo-labeling and Local Differential Privacy (LDP). Extensive experiments conducted on three real-world datasets demonstrate the competitive performance of our approach compared to centralized algorithms while ensuring privacy preservation. Moreover, FedRKG achieves an average accuracy improvement of 4% compared to existing federated learning baselines. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2024.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Short: CICC: A fine-grained, semantic-aware, and transparent approach to preventing permission leaks for android permission managers 8

Short: CICC: A fine-grained, semantic-aware, and transparent...

引用

8th ACM Conference on Security and Privacy in Wireless and Mobile Networks, WiSec 2015

作者： Wang, Daibin Yao, Haixia Li, Yingjiu Jin, Hai Zou, Deqing Deng, Robert H. 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 School of Information Systems Singapore Management University Singapore

ISBN: (纸本)9781450336239

Android's permission system offers an all-or-nothing installation choice for users. To make it more flexible, users may choose a popular app tool, called permission manager, to selectively grant or revoke an app's permissions at runtime. A fundamental requirement for such permission manager is that the granted or revoked permissions should be enforced faithfully. However, we discover that none of existing permission managers meet this requirement due to permission leaks. To address this problem, we propose CICC, a finegrained, semantic-aware, and transparent approach for any permission managers to defend against the permission leaks. Compared to existing solutions, CICC is fine-grained because it detects the permission leaks using call-chain information at the component instance level, instead of at the app level or component level. The fine-grained feature enables it to generate a minimal impact on the usability of running apps. CICC is semantic-aware in a sense that it manages call-chains in the whole lifecycle of each component instance. CICC is transparent to users and app developers, and it requires minor modification to permission managers. Our evaluation shows that CICC incurs relatively low performance overhead and power consumption. Copyright 2015 ACM.

关键词： Android Call-chain Permission leaks Permission manager

来源：评论

学校读者我要写书评

暂无评论

Network and Parallel computing 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Hai Jin Daniel Reed Wenbin Jiang

ISBN: (数字)9783540322467

ISBN: (纸本)9783540298106

These proceedings contain the papers presented at the 2005 IFIP International Conference on Network and Parallel computing (NPC 2005), held in Beijing, China, between November 30 and December 3, 2005. The goal of the conference was to establish an international forum for engineers and scientists to present their ideas and experiences in network and parallel computing. A total of 320 submissions were received in response to our Call for Papers. These papers were from the following countries or regions: Australia, Canada, China, France, Germany, Hong Kong, India, Iran, Italy, Japan, Korea, Lux- burg, Nepal, Netherlands, Taiwan, United Arab Emirates, and United States. Each submission was sent to at least three *** paper was judged - cording to its originality, innovation, readability, and relevance to the expected ***,atotalof68paperswereretainedfor- clusionin *** the 68 papers,48 wereacceptedasfull papers for presentation at the conference. We also accepted 20 papers as short papers for a possible brief presentation at the conference, followed by discussion during a poster session. Thus, only 21% of the total submissions could be included in the ?nal program.

关键词： Theory of Computation Computer Communication Networks Software Engineering Operating systems Algorithm Analysis and Problem Complexity Information systems Applications (incl. Internet)

来源：评论

学校读者我要写书评

暂无评论

SHelp: Automatic self-healing for multiple application instances in a virtual machine environment

SHelp: Automatic self-healing for multiple application insta...

引用

作者： Chen, Gang Jin, Hai Zou, Deqing Zhou, Bing Bing Qiang, Weizhong Hu, Gang Cluster and Grid Computing Lab. Services Computing Technology and System Lab. Huazhong University of Science and Technology Wuhan 430074 China Centre for Distributed and High Performance Computing School of Information Technologies University of Sydney NSW 2006 Australia

ISBN: (纸本)9780769542201

When multiple instances of an application running on multiple virtual machines, an interesting problem is how to utilize the fault handling result from one application instance to heal the same fault occurred on other sibling instances, and hence to ensure high service availability in a cloud computing environment. This paper presents SHelp, a lightweight runtime system that can survive software failures in the framework of virtual machines. It applies weighted rescue points and error virtualization techniques to effectively make applications bypass the faulty path. A two-level storage hierarchy is adopted in the rescue point database for applications running on different virtual machines to share error handling information to reduce the redundancy and to more effectively and quickly recover from future faults caused by the same bugs. A Linux prototype is implemented and evaluated using four web server applications that contain various types of bugs. Our experimental results show that SHelp can make server applications to recover from these bugs in just a few seconds with modest performance overhead. © 2010 IEEE.

关键词： Software reliability

来源：评论

学校读者我要写书评

暂无评论

D-overlay: A delay-aware overlay for gaming services

D-overlay: A delay-aware overlay for gaming services

引用

3rd International Conference on Innovative computing Information and Control, ICICIC'08

作者： Xiaofei, Liao Linchen, Yu Hai, Jin Hong, Yao Cluster and Grid Computing Lab. Services Computing Technology and System Lab. Huazhong University of Science and Technology Wuhan 430074 China School of Computer Science and Technology China University of Geosciences Wuhan 430074 China

ISBN: (纸本)9780769531618

Peer-to-peer (P2P) has become an important computing model because of its adaptation, selforganization and autonomy. But how to organize dynamic nodes in P2P networks efficiently for gaming message passing services is still a challenge. This paper present an approach, named D-overlay, a delay-aware overlay for gaming services, to implement node clustering based on link delay of nodes communications in the P2P network. This approach measures the delays among peers, explores the node connectivity together with the connection quality. Then, it builds a service ring for each peer according to its latency status, and keeps the low latency among neighbors by periodical adjustments. D-overlay improves the extensibility and reliability. One system, called PKTown, has been deployed based on D-overlay in CERNET of China. © 2008 IEEE.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：