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

International Conference on Cloud and Service computing (CSC)

作者： Li Deng Hai Jin Song Wu Xuanhua Shi Jiangfu Zhou 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

More and more enterprises are moving beyond server virtualization to desktop virtualization in recent years. In virtualization environments, centralized shared storage systems are generally used to take advantage of virtualization features such as VM migration. Network file system (NFS) is considered to be the best choice in small or medium sized LANs due to its flexibility and low cost. But it becomes the bottleneck when many clients access the server simultaneously, especially when multiple virtual machines access a large amount of data at the same time, such as operation save and restore. In this paper, we present a new method named ComIO to quickly save and restore virtual machines using page compression. Based on the analysis of virtual machines' memory characteristics, we design a fast enhanced characteristic-based compression (ECBC) algorithm. Combined with multi-threaded techniques, the compression tasks are parallelized for significantly shortened compresssion time. Page boundary alignment is proposed to enable wanted page data to be directly extracted from the compressed block. The experimental results demonstrate that compared with Xen, our method ComIO not only greatly reduces the time spent on saving and restoring virtual machines on average, but also indirectly augments the effective storage space.

关键词： Virtual machining Image coding Instruction sets Compression algorithms Servers Image restoration Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

TCPBridge: A software approach to establish direct communications for NAT hosts

TCPBridge: A software approach to establish direct communica...

引用

ACS/IEEE International Conference on Computer systems and Applications

作者： Sanmin Liu Hai Jin Xiaofei Liao Hong Yao Deze Zeng 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

Traversing network address translation (NAT) for peer-to-peer (P2P) communication has become a hot topic recently. Compared to UDP, establishing TCP connections for hosts behind different NATs is more complex. Thus, many TCP-based applications do not address TCP traversal through NATs. Some solutions suggest using delegates to relay all communications, or tunneling TCP over UDP. However, they require a big reform to network architecture, or using a nonstandard TCP/IP stack. In this paper, we present a novel idea called TCPBridge. TCPBridge converts TCP traversal to UDP traversal without modifying any binaries of the TCP-based applications. Our design can be integrated with those P2P applications which have not solved TCP traversal problem, and extends them to support direct communications between NAT hosts. It deals with the problem of TCP traversal, so as to improve the usability of applications. We have implemented TCPBridge in several existing P2P systems. Statistics prove that TCPBridge is scalable and robust, and we believe it will benefit many other existing P2P applications.

关键词： Network address translation TCPIP Application software Punching Robustness Protocols Communication system software grid computing Computer science Peer to peer computing

来源：评论

学校读者我要写书评

暂无评论

A Simulation Times Model of Multi-core Simulation

A Simulation Times Model of Multi-core Simulation

引用

WRI World Congress on Software Engineering, WCSE

作者： Zhibin Yu Hai Jin Yabin Hu 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

Chip multi-processor (CMP) increases processor throughput by duplicating resources for many threads. Due to the main frequency of a single processor approaching to limit, CMP is becoming more and more popular. However, it is not well studied how to evaluate a new CMP design by simulation. This paper analyzes the possible organizations of cores on a CMP and then presents a mathematical model for the simulation times. It also provides a sampling policy used to reduce the simulation times. The sampling experiments show that the simulation time is 7.5 days under condition that the required confidence level is 95% and confidence interval is 4 when the benchmarks in SPEC CPU2000 are used. As for the simulation of CMPs, the simulation time is very short.

关键词： Yarn Analytical models Process design Hardware Sampling methods Throughput Frequency Computational modeling Computer simulation Multicore processing

来源：评论

学校读者我要写书评

暂无评论

Meld: A Real-Time Message Logic Debugging system for Distributed systems

Meld: A Real-Time Message Logic Debugging System for Distrib...

引用

IEEE Asia-Pacific Conference on services computing (APSCC)

作者： Xuping Tu Hai Jin Xuepeng Fan Jiang Ye 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

The largest difference between a distributed and a non-distributed system is that the former introduces network messages to the system. Network messages bring the scalability to a distributed system as well as complexity to it. Testing large-scale distributed systems is a great challenge, because some errors happen after a distributed sequence of events that involves machine and network failures. Meld is a checker that allows developers to specify expected message logic on a deployed distributed system, and that verifies these logics while the system is running. When Meld finds a problem it starts collecting more information that led to the problem, allowing developers to quickly find the root cause. Developers write message logics on Meld and Meld verifies them through analyzing the collected abstract of messages. By using binary instrumentation, Meld works almost transparently with debugged systems and can change logics to be checked at runtime. An evaluation with a deployed system shows that Meld can detect non-trivial correctness at runtime.

关键词： Servers Debugging Runtime Monitoring Computer bugs Receivers Payloads

来源：评论

学校读者我要写书评

暂无评论

A Secured Scheme for Geographical Distance Computation over Encrypted Cloud Data

A Secured Scheme for Geographical Distance Computation over ...

引用

International Conference on Computer Science and Network technology

作者： Zaid Ameen Abduljabbar Hai Jin Ayad Ibrahim Aqeel Noori Mohammed Abdulridha Hussain Zaid Alaa Hussien Deqing Zou Salah H. Abbdal Cluster and Grid Computing Lab Services Computing Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China University of Basrah Basrah Iraq

ISBN: (纸本)9781467381741

Popular service providers, such as Google and Amazon, have turned their vast resources into a cloud computing model and enforced their businesses to run applications on the servers of such new model. To ensure security and privacy in this environments, customers have to encrypt their data before uploading them into the cloud servers. Unfortunately, modern unbreakable encryption methods are inadequate because they do not have the ability to execute database queries on the encrypted data. In this paper, we address the problem of how to calculate the geographical distance over an encrypted dataset. Specifically, the data owner, Alice, sends her encrypted dataset of geographical locations into the cloud server. At any time, Bob would like to check the proximity of his submitted query from the locations of Alice. Our proposed scheme enables the untrusted server to perform such task without compromising the privacy of either the dataset of Alice or the query of Bob. Among various distance metrics, we employ the efficient principle of approximate matching to obtain the proximity between query and data locations. Furthermore, we use the inner product similarity to formalize such principle for similarity measurement. Several experiments have been conducted to investigate the overhead and the efficiency of the proposed scheme.

关键词： Cloud computing Privacy preserving Geographical distance Cloud computing Servers distance metric approximate match Dataset CLOUDS Clouds data querying similar measure Uploading Privacy cryptography Geographical Locations

来源：评论

学校读者我要写书评

暂无评论

A multicast based bandwidth saving approach for wireless live streaming system

引用

International Journal of Smart Home 2008年第1期2卷 65-80页

作者： Jiang, Wenbin Jin, Hai Liao, Xiaofei Yuan, Zhi Services Computing Technology and System Lab Huazhong University of Science and Technology Wuhan 430074 China Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan 430074 China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

P2P based live streaming applications are growing up rapidly. However, when extending them to WLANs, the bandwidth bottleneck and the high rate of packet loss are usually the major stumbling blocks. To overcome this issue, a new wireless multicast agent mechanism (WiMA) based on the IP multicast scheme for buffer management and scheduling is proposed. First of all, a wireless agent selection method is presented to choose an appropriate agent for WiMA. Then this agent gains media data by interacting with wired neighbor peers as a common P2P node, and transmits these data to other wireless peers in the WLAN by means of multicast pushing and multicast patching. A normal wireless peer requests data according to the strategy of "emergent ones first". Experimental results show that the approach proposed can significantly save bandwidth in WLANs with acceptable start delay and satisfied playing continuity.

关键词： Wireless local area networks (WLAN)

来源：评论

学校读者我要写书评

暂无评论

Performance Modeling of Resource Failures in grid Environments

Performance Modeling of Resource Failures in Grid Environmen...

引用

Japan-china Joint Workshop on Frontier of Computer Science and technology (FCST)

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

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: Weibull, 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.

关键词： Scheduling algorithm Weibull distribution Transient analysis Computational modeling User interfaces Distribution functions

来源：评论

学校读者我要写书评

暂无评论

GIDN: A Lightweight Graph Inception Diffusion Network for High-efficient Link Prediction

arXiv

引用

arXiv 2022年

作者： Wang, Zixiao Guo, Yuluo Zhao, Jin Zhang, Yu Yu, Hui Liao, Xiaofei Wang, Biao Yu, Ting 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 Zhejiang Lab Hangzhou China

In this paper, we propose a Graph Inception Diffusion Networks(GIDN) model. This model generalizes graph diffusion in different feature spaces, and uses the inception module to avoid the large amount of computations caused by complex network structures. We evaluate GIDN model on Open Graph Benchmark(OGB) datasets, reached an 11% higher performance than AGDN on ogbl-collab dataset. Copyright © 2022, The Authors. All rights reserved.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

A Cloud Service Cache system Based on Memory Template of Virtual Machine

A Cloud Service Cache System Based on Memory Template of Vir...

引用

chinagrid Annual Conference (chinagrid)

作者： Xuanhua Shi Chao Liu Song Wu Hai Jin Xiaoxin Wu Li Deng Services Computing Technology and System Laboratory Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Huawei Technologies Company Limited China

In data centers and cloud computing environments, the number of virtual machines (VMs) increases when the number of service requests increases. Since services are invoked on demand, the corresponding virtual machines will be created and shut down frequently. This makes the time of starting a virtual machine a crucial performance bottleneck for services in data centers. Besides, if virtual machines read image files from disks to start themselves, additional overhead to access disk will be generated. In this paper, we present a cloud service cache system based on memory template of virtual machines - VCache to improve the response time of cloud computing services, and to reduce the disk access overhead. This system can create and maintain service cache VMs through memory templates, which are snapshots of running virtual machines. By creating virtual machines from cached image files, the service running in these VMs can be deployed rapidly, which greatly reduces the launching time of the service and disk I/O load. We evaluate our system with experiments, and the experimental results show that the average time for creating a VM is reduced about 80% and the amount of data through disk access decreases more than 50%.

关键词： Virtual machining Random access memory IP networks Memory management Image restoration Cloud computing Cloning

来源：评论

学校读者我要写书评

暂无评论

Hyperbit: A Financial Temporal Knowledge Graph Data Storage system

SSRN

引用

SSRN 2022年

作者： Yuan, Pingpeng Han, Sheng Zang, Shaoqi Shi, Xuanhua 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

In the field of finance, data has the characteristics of temporal multi-frequency and heterogeneous high dimension, and the traditional knowledge graph is not suitable to express the temporal relation of financial data, so the financial temporal knowledge graph has become a research hotspot recently. There are a large number of temporal edges in the financial temporal knowledge graph. The use of general graph database management system to store financial knowledge graph data has problems such as large storage scale and slow update speed, and it cannot realize the traceability of financial data, so it cannot meet the needs of the financial field. In order to solve these problems, HyperBit, a storage system for efficient storage and management of financial data, is designed and implemented. Firstly, a temporal quad storage structure is proposed. Secondly, the Log Structured Cumulative Update (LSCU) is proposed to update financial temporal data efficiently. The update log module is designed in the system. When there is data to update, it is not directly updated in the data storage of the system, but recorded in the update log, and the system updates the content of the update log cumulatively. The system manages update logs by partition and chunk, which makes the log storage compact and independent. Besides, it is convenient for parallel processing and it improves the data update speed. Thirdly, a Bidirectional Backtracking by Final and Optimal Root (BBFOR) method is proposed to meet the requirements of efficient traceability of financial data. Unlike traditional version tracing method, BBFOR adopt both the snapshot and incremental methods which balance the space and time cost of version switching, and BBROF consider the version of the access frequency characteristic and set up the final root and the optimal root. Besides, BBROF adopt bidirectional backtracking technology to improve the efficiency of the version switching. Experimental results show that the storage cost

关键词： Switching

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：