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

2019 INFOCOM IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2019

作者： Deng, Xiaofeng Zhang, Fan 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

ISBN: (纸本)9781728118789

In traditional database systems, data anonymization has been extensively studied, it provides an effective solution for data privacy preservation, and multidimensional anonymization scheme among them is widely used. However, without delicate parameter settings, these technologies may cause uncontrollable information loss and decrease the accuracy of data analytic tasks. Furthermore, crowdsourcing data is usually huge in amount and must be distributed stored in clouds, which makes the conventional data anonymization technologies not applicable. In this paper, we propose a framework that uses MapReduce to anonymize large-scale data before disseminating them to human workers. In order to guarantee the number and distribution of data records to be similar in all nodes, our framework first redistributes the original data to all participating nodes. Then a heuristic two-phase anonymization schema, which can be seamlessly integrated into the framework, is proposed. Experimental results show that with the same objective of privacy, our approach is scalable for large-scale data and can improve the average accuracy of human worker's analytic tasks. © 2019 IEEE.

关键词： Crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

BED: A Block-Level Deduplication-Based Container Deployment Framework 15th

BED: A Block-Level Deduplication-Based Container Deployment ...

引用

15th International Conference on Green, Pervasive, and Cloud computing, GPC 2020

作者： Zhang, Shiqiang Wu, Song Fan, Hao Zou, Deqing 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 Scinece and Technology Wuhan430074 China

ISBN: (纸本)9783030642426

Container technology has gained great popularity in cloud environment since containers provide near-native performance and are lighter and less expensive than traditional virtual machines. However, starting up a non-local container, whose image is unavailable locally, is time-consuming. The reason is that pulling an image from a remote registry requires a long time. In this paper, we experimentally find that a lot of redundant data exists among image layers when we pull images from the registry. This redundant data causes additional pull time and makes the startup of a non-local container slower. To minimize the amount of pulled data while providing intact images, we propose a container deployment framework, BED, based on block-level deduplication. To be specific, BED stores an image layer as numerous data blocks and a fingerprint list which is generated based on these data blocks. When BED needs to pull an image, it pulls the fingerprint lists of the image, deduplicates these fingerprint lists, and pulls the data blocks non-existing locally from the registry. Based on the local and pulled blocks, BED reconstructs the image layers for a container. Experiments show that compared with original Docker, BED reduces the time of pulling images by 35% on average and saves about 48% data transmission in the network. © 2020, Springer Nature Switzerland AG.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

A new approach to hide policy for automated trust negotiation

引用

1st International Workshop on Security, IWSEC 2006

作者： Hai, Jin Zhensong, Liao Deqing, Zou Weizhong, Qiang Cluster and Grid Computing Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)3540476997

Automated trust negotiation (ATN) is an important approach to establish trust between strangers through the exchange of credentials and access control policies. In practice, access control policy may contain sensitive information. The negotiation process becomes complicated when the access control policy is designed complex in order to avoid information leakage. Furthermore, if the access control policy has conflicts or cycles, normal negotiation strategies often fail. In this paper, a new approach to hide access control policy is proposed based on the study on the existing problems. In the approach, the policy consistency is checked so as to detect policy conflicts. 0-1 table is used to implement it as well as discover minimal credential-set. Meanwhile, a practical example shows that the approach is suitable and can effectively protect sensitive information in access control policy. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Information technology

来源：评论

学校读者我要写书评

暂无评论

FDGLib: A Communication Library for Efficient Large-Scale Graph Processing in FPGA-Accelerated Data Centers

引用

Journal of Computer Science & technology 2021年第5期36卷 1051-1070页

作者： Yu-Wei Wu Qing-Gang Wang Long Zheng Xiao-Fei Liao Hai Jin Wen-Bin Jiang Ran Zheng Kan Hu National Engineering Research Center for Big Data Technology and System School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Services Computing Technology and System Laboratory School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

With the rapid growth of real-world graphs,the size of which can easily exceed the on-chip(board)storage capacity of an accelerator,processing large-scale graphs on a single Field Programmable Gate Array(FPGA)becomes *** multi-FPGA acceleration is of great necessity and *** cloud providers(e.g.,Amazon,Microsoft,and Baidu)now expose FPGAs to users in their data centers,providing opportunities to accelerate large-scale graph *** this paper,we present a communication library,called FDGLib,which can easily scale out any existing single FPGA-based graph accelerator to a distributed version in a data center,with minimal hardware engineering *** provides six APIs that can be easily used and integrated into any FPGA-based graph accelerator with only a few lines of code *** the torus-based FPGA interconnection in data centers,FDGLib also improves communication efficiency using simple yet effective torus-friendly graph partition and placement *** interface FDGLib into AccuGraph,a state-of-the-art graph *** results on a 32-node Microsoft Catapult-like data center show that the distributed AccuGraph can be 2.32x and 4.77x faster than a state-of-the-art distributed FPGA-based graph accelerator ForeGraph and a distributed CPU-based graph system Gemini,with better scalability.

关键词： data center accelerator graph processing distributed architecture communication optimization

来源：评论

学校读者我要写书评

暂无评论

GTapestry: A locality-aware overlay network for high performance computing

GTapestry: A locality-aware overlay network for high perform...

引用

11th IEEE Symposium on Computers and Communications, ISCC 2006

作者： Jin, Hai Luo, Fei Zhang, Qin Liao, Xiaofei Zhang, Hao Cluster and Grid Computing Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)0769525881

A locality-aware overlay network for high performance computing, GTapestry, is proposed in this paper. GTapestry assembles physically neighboring nodes in the Internet into self-organized groups. The routing mechanism of GTapestry is divided into inter-group routing, used by groups that communicate with others through their leaders, and intra-group routing, used by group members to communicate with each other directly. Compared with Tapestry, the performance of GTapestry, including the routing efficiency and the maintenance cost for stability, is evaluated in theory and via simulation. It indicates that GTapestry can be the substrate of peer-to-peer based HPC systems for applications with task-level parallelism. © 2006 IEEE.

关键词： 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

来源：评论

学校读者我要写书评

暂无评论

Specifying web service agreement with OWL

Specifying web service agreement with OWL

引用

International Conference on Next Generation Web services Practices, NWeSP 2005

作者： Hao, Wu Hai, Jin Cluster and Grid Computing Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)0769524524

Quality of Service (QoS) is necessary for service-oriented computing. Web services Agreement (WSA) aims at defining a language and a protocol for advertising the capabilities of providers, creating agreements based on offers providers, and monitoring of QoS. On the other hand, semantic web provides many techniques that enable services intelligent and automatic on web. Therefore, we intend to integrate semantic web techniques with WSA management to show its advantages. In this paper, we present some works for this initial study. We illustrate how to specify WSA with ontology language instead of XML schema. Some semantic web based methods to express WSA elements are proposed, such as using OWL class expression to capture the "Terms" statement semantic, introducing rules-based method to represent service level description, and defining ontology for QoS metric. An agent-based runtime framework for WSA management is also presented to support our approach. © 2005 IEEE.

关键词： Telecommunication services

来源：评论

学校读者我要写书评

暂无评论

Identifying community structure in semantic peer-to-peer networks

Identifying community structure in semantic peer-to-peer net...

引用

2nd International Conference on Semantics, Knowledge, and grid, SKG 2006

作者： Chen, Hanhua Jin, Hai Cluster and Grid Computing Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)076952673X

The research community has turned to create Semantic Overlay Networks for information retrieval in large scale peer-to-peer networks. Much research work in semantic overlay protocols and searching algorithms is done and their results indicate that semantic overlay is powerful for content searching in peer-to-peer network. However, very limited work has been done in analyzing and evaluating characteristic about semantic overlay network. In this paper we identify a natural property of semantic overlay network, community structure. We setup a mathematical model to evaluate the community structure property. A heuristic backtrace-greedy hybrid algorithm is also designed to optimize the evaluation value of a given overlay network. Using the evaluation model we compare the SemreX semantic overlay with the Gnutella network. We find that the SemreX overlay network has a distinct feature of community structure, while the Gnutella network does not have such feature. © 2006 IEEE.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

An anycast-based P2P routing protocol for mobile ad hoc networks

An anycast-based P2P routing protocol for mobile ad hoc netw...

引用

First IEEE and IFIP International Conference in Central Asia on Internet, 2005

作者： Rong, Cheng Hai, Jin Ke, Shi Bin, Cheng Cluster and Grid Computing Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)0780391799

With the increasing popularity of mobile ad-hoc networks (MANETs), it becomes a challenge to integrate peer-to-peer (P2P) technique into MANETs efficiently. This paper proposes to integrate anycast routing technique to mobile P2P networks to reduce overhead and optimize query lookup service. We propose a novel anycast-based mobile P2P routing protocol for MANETs, called AMPP, which integrates Chord and anycast routing protocol at the network layer in highly dynamic MANETs. Our simulation results show that integrating anycast routing technique to mobile P2P network can reduce query lookup cost and improve network performance. © 2005 IEEE.

关键词： Client server computer systems

来源：评论

学校读者我要写书评

暂无评论

Aeneas: Real-time performance evaluation approach for distributed programs with reliability-constrains

Aeneas: Real-time performance evaluation approach for distri...

引用

19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005

作者： Li, Yunfa Jin, Hai Han, Zongfen Xie, Chao Zou, Deqing Wu, Hao Cluster and Grid Computing Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)0769523129

A novel approach, based on the execution state of distributed programs, is proposed in this paper, called Aeneas. U is for the real-time performance analysis of distributed programs with reliability-constrains, In Aeneas, there are two important/actors, the available datafiles and the transmission paths of each available data file. Some algorithms are designed to find all the transmission paths of each data file needed while the program executes, count the transmission time for each transmission path, then get the aggregate transmission time, calculate the fastest and the slowest response time of distributed programs with reliability-constrains. A representative case is analyzed, and the results show that it is an efficient way to evaluate the real-time performance of distributed programs with reliability -constrains. © 2005 IEEE.

关键词： Distributed database systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：