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

8th International Conference on Computer Science and Education, ICCSE 2013

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

ISBN: (纸本)9781467344623

With the development of desktop virtualization technology, more and more companies begins to deploy virtual desktop. Traditional NAS and SAN storages can only support small-scale users due to network bandwidth limit and poor scalability. Another disadvantage is that NAS and SAN storages are very expensive. The distributed file systems such as GFS, PVFS, and Lustre are with low cost, high scalability and mass storage, but they are only designed for specific scenarios and can not meet the need of desktop virtualization storage. The characteristics of virtual desktop I/O are small random I/O, high IOPS, snapshot needed and frequent access of the root image. Based on these I/O characteristics, DevStore is designed for desktop virtualization, and aims to be low cost, good scalability and performance. Experiments show that DevStore image's write performance is 70MB/s and read performance is 60MB/s in gigabit Ethernet. The snapshot time of DevStore is less than 1ms. DevStore is also easy to expand. Experiments also show that DevStore is better than QCOW in NFS environment and meets the desktop virtualization storage need. © 2013 IEEE.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Resource allocation in contending virtualized environments through stochastic virtual machine performance modeling and feedback

Resource allocation in contending virtualized environments t...

引用

作者： Jiang, Cong-Feng Wan, Jian Xu, Xiang-Hua Zhang, Ji-Lin You, Xin-Dong Grid and Services Computing Technology Lab Hangzhou Dianzi University Hangzhou 310037 China

In virtualized systems, allocation and scheduling of resources shared among multiple virtual machines faces challenges such as autonomy, isolation and high workload dynamics. The multiplexing and consolidation nature of virtualized systems also raise issues such as interference and conflicts among various virtual machine instances. Therefore traditional resource allocation strategy can't achieve good performance without modifications according to these particular characteristics in virtualized systems. In this paper we use a stochastic model to characterize the resources (especially CPU) and workload dynamics. Then we use a weighted priority based service differentiation strategy to allocate resources in contending conditions to provide performance guarantees as well as load balance and fairness. In the proposed algorithms user behavior and workloads are characterized through the historical and real time performance profiling and estimation from hosted agents within individual Virtual Machines. The resources are allocated according to the demand as well as the performance of the targeted Virtual Machines based on the Sufferage aggregation and performance feedback. Experiments on a real Xen based virtualization environment with 20 Virtual Machines are conducted and evaluated for accuracy, efficiency, sensitivity, and overhead. The results show that the performance feedback based allocation can achieve a higher SLA satisfaction rate as 97.1%, a lower load imbalance index as 18.7%. The performance feedback based allocator uses 14.06% less CPU time for CPU-intensive applications and reduces 45.59% I/O wait time in disk contention environments. The results also show that the feedback based algorithm is valid, effective and scalable for implementation in real virtualized environments.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

A Novel routing scheme for paired peers in P2P network

A Novel routing scheme for paired peers in P2P network

引用

2007 Asian Technology Information Program's (ATIP's) 3rd Workshop on High Performance computing in China - Solution Approaches to Impediments for High Performance computing, CHINA HPC'07

作者： Liao, Xiaofei Services Computing Technology and System Lab Cluster and Grid Computing Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781595939036

Peer-to-Peer (P2P) networks have been shown to be a promising approach to provide instant voice services over the Internet for its potential high scalability. However, for one paired peers, how to efficiently transmit voice data among peers in such networks remains a major challenge. Hereby this paper proposed some hybrid routing schemes for P2P transmitting system, which include improved random detection algorithm, delay binary tree search algorithm, AS-aware discovery algorithm. With the help of these novel routing schemes, we can choose the correct algorithm to transfer media data, in small size but low delay, among peers in P2P network. Simulations show that these new routing strategies achieve obvious effect. © 2008 ACM.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

A hybrid memory architecture supporting fine-grained data migration

引用

Frontiers of Computer Science 2024年第2期18卷 31-41页

作者： Ye CHI Jianhui YUE Xiaofei LIAO Haikun LIU Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Department of Computer Science Michigan Technological UniversityMichigan 49931USA

Hybrid memory systems composed of dynamic random access memory(DRAM)and Non-volatile memory(NVM)often exploit page migration technologies to fully take the advantages of different memory *** previous proposals usually migrate data at a granularity of 4 KB pages,and thus waste memory bandwidth and DRAM *** this paper,we propose Mocha,a non-hierarchical architecture that organizes DRAM and NVM in a flat address space physically,but manages them in a cache/memory *** the commercial NVM device-Intel Optane DC Persistent Memory Modules(DCPMM)actually access the physical media at a granularity of 256 bytes(an Optane block),we manage the DRAM cache at the 256-byte size to adapt to this feature of *** design not only enables fine-grained data migration and management for the DRAM cache,but also avoids write amplification for Intel Optane *** also create an Indirect Address Cache(IAC)in Hybrid Memory Controller(HMC)and propose a reverse address mapping table in the DRAM to speed up address translation and cache ***,we exploit a utility-based caching mechanism to filter cold blocks in the NVM,and further improve the efficiency of the DRAM *** implement Mocha in an architectural *** results show that Mocha can improve application performance by 8.2%on average(up to 24.6%),reduce 6.9%energy consumption and 25.9%data migration traffic on average,compared with a typical hybrid memory architecture-HSCC.

关键词： non-volatile memory hybrid memory system data migration fine-grained caching

来源：评论

学校读者我要写书评

暂无评论

RTRM: A response time-based replica management strategy for cloud storage system

RTRM: A response time-based replica management strategy for ...

引用

8th International Conference on grid and Pervasive computing, GPC 2013

作者： Bai, Xiaohu Jin, Hai Liao, Xiaofei Shi, Xuanhua Shao, Zhiyuan Services Computing Technology and System Lab. Cluster and Grid Computing Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9783642380266

Replica management has become a hot research topic in storage systems. This paper presents a dynamic replica management strategy based on response time, named RTRM. RTRM strategy consists of replica creation, replica selection, and replica placement mechanisms. RTRM sets a threshold for response time, if the response time is longer than the threshold, RTRM will increase the number of replicas and create new replica. When a new request comes, RTRM will predict the bandwidth among the replica servers, and make the replica selection accordingly. The replica placement refers to search new replica placement location, and it is a NP-hard problem. Based on graph theory, this paper proposes a reduction algorithm to solve this problem. The simulation results show that RTRM strategy performs better than the five built-in replica management strategies in terms of network utilization and service response time. © 2013 Springer-Verlag.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

MR-Scope: A real-time tracing tool for MapReduce 10

MR-Scope: A real-time tracing tool for MapReduce

引用

Proceedings of the 19th ACM International Symposium on High Performance Distributed computing

作者： Huang, Dachuan Shi, Xuanhua Ibrahim, Shadi Lu, Lu Liu, Hongzhang Wu, Song Jin, Hai Cluster and Grid Computing Lab. Services Computing Technique and System Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781605589428

MapReduce programming model is emerging as an efficient tool for data-intensive applications. Hadoop, an open-source implementation of MapReduce, has been widely adopted and experienced by both academia and enterprise. Recently, lots of efforts have been done on improving the performance of MapReduce system and on analyzing the MapReduce process based on the log files generated during the Hadoop execution. Visualizing log files seems to be a very useful tool to understand the behavior of the Hadoop process. In this paper, we present MRScope, a real-time MapReduce tracing tool. MR-Scope provides a real-time insight of the MapReduce process, including the ongoing progress of every task hosted in Task Tracker. In addition, it displays the health of the Hadoop cluster data nodes, the distribution of the file system's blocks and their replicas and the content of the different block splits of the file system. We implement MR-Scope in native Hadoop 0.1. Experimental results demonstrat that MR-Scope's overhead is less than 4% when running wordcount benchmark. Copyright 2010 ACM.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

DDASTM: Ensuring conflict serializability efficiently in distributed STM

DDASTM: Ensuring conflict serializability efficiently in dis...

引用

8th International Conference on grid and Pervasive computing, GPC 2013

作者： Zhang, Yu Jin, Hai Liao, Xiaofei Services Computing Technology and System Lab. Cluster and Grid Computing Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9783642380266

CS (Conflict Serializability) is a recently proposed relaxer correctness criterion that can increase transactional memory's parallelism. DDA (Distributed Dependency-Aware) model is currently proposed to implement CS in distributed STM (Software Transactional Memory) for the first time. However, its transactions detect conflicts individually via detecting cycles in PG (Precedence Graph) and cause extra runtime overhead, especially at the condition that the transactions access lots of objects or the PG is large. In this paper, we propose an approach to make each cycle in PG detected by those transactions, which construct this cycle, together in parallel way, instead of detecting cycle individually. Experimental results show that the average execution time and communication cost of all transactions, including aborted ones, in our approach, can be decreased to 76% and 78% of those in DDA respectively. Its speedup is up to 2.56x against baseDSTM, employing two-phase locking. © 2013 Springer-Verlag.

关键词： Locks (fasteners)

来源：评论

学校读者我要写书评

暂无评论

Agent-based data loading method in medlmgrid

Agent-based data loading method in medlmgrid

引用

2009 International Conference on New Trends in Information and Service Science, NISS 2009

作者： Zheng, Ran Jin, Hai Zhang, Qin Liu, Xin Services Computing Technology and System Lab. Cluster and Grid Computing Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9780769536873

Agent-based grid data loading method aims at integrating heterogeneous hospitals' information systems into a medical information exchange platform based on grid middleware. It collects distributed data sets for decision support system, which makes data sources expanded from independent database modes to medical information systems in wide area. Virtual data access with grid service improves data security and makes data modification in local system more flexible. HL7 protocol and middleware are utilized to transform HL7 data into various local data structures for keeping the independence of each hospital information system and providing more convenience and expansibility for various medical applications. © 2009 IEEE.

关键词： Medical applications

来源：评论

学校读者我要写书评

暂无评论

Scalable DHT-based Information Service for large-scale grids 08

Scalable DHT-based Information Service for large-scale grids

引用

2008 Conference on computing Frontiers, CF'08

作者： Jin, Hai Tao, Yongcai Wu, Song Shi, Xuanhua Cluster and Grid Computing Lab. Services Computing Technology and System Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781605580777

Current grid information service is centralized or hierarchical and proves inefficient as grid scale rapidly increases. The introduction of P2P techniques into grids breaks an encouraging path. However, frequent join and departure of resource nodes require strong self-organization capacity of system to maintain their rigid structure. Moreover, arranging identifier space for P2P nodes is knotty and has great impact on system performance. If the identifier space is too large, some nodes will be overloaded. On the contraiy, small identifier space will bring the same problem as millennium bug. To address the issues, this paper proposes a scalable DHT-based (Distributed Hash Table) Information Service (DIS) for grid system, which organizes grid resources into a DHT ring based on VO (Virtual Organization). To save the identifier space while retaining the scalability and system performance, only stable VOs can join DIS via a new DHT node, whereas volatile VOs join DIS through being the sub-domain of other VO. Experimental results show that DIS provides rapid resource query, strong scalability and high throughput, meanwhile avoiding the key node failure as well as the bottleneck problem. Copyright 2008 ACM.

关键词： grid computing

来源：评论

学校读者我要写书评

暂无评论

VAST: Automatically combining keywords and visual features for web image retrieval

VAST: Automatically combining keywords and visual features f...

引用

2008 10th International Conference on Advanced Communication Technology

作者： Hai, Jin Ruhan, He Wenbing, Tao Aobing, Sun Services Computing Technology and System Lab. Cluster and Grid Computing Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9788955191356

A large-scale image retrieval system for the WWW, named VAST (VisuAl & SemanTic image search), is presented in this paper. Based on the existing inverted file and visual feature clusters, we form a semantic network on top of the keyword association on the visual feature clusters. The system is able to automatically combine keyword and visual features for retrieval by the semantic network The combination is automatic, simple, and very fast, which is suitable for large-scale web dataset Meanwhile, the retrieval takes advantage of the semantic contents of the images in addition to the low-level features, which remarkably improves the retrieval precision. The experimental results demonstrate the superiority of the system.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：