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

作者： 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

来源：评论

学校读者我要写书评

暂无评论

An Optimistic Checkpoint Mechanism Based on Job Characteristics and Resource Availability for Dynamic Grids

引用

Wuhan University Journal of Natural Sciences 2011年第3期16卷 213-222页

作者： TAO Yongcai JIN Hai WU Song School of Information Engineering Zhengzhou University Zhengzhou 450000 Henan China Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan 430074 Hubei China

In the paper, based on the job characteristics and resources availability, an optimistic checkpoint mechanism for dynamic grids（OCM4G） is proposed. It can determine whether to checkpoint a given job running on a given resource node and establish optimal aperiodic checkpoint intervals by applying the knowledge of job characteristics and resource availability. We evaluate OCM4G over a real grid environment （ChitlaGrid） and the results show that OCM4G achieves better performance than the periodic checkpoint and the analytical method of calculating aperiodic checkpoint intervals.

关键词： grid computing fault tolerance checkpoint Markov

来源：评论

学校读者我要写书评

暂无评论

Partitioning large-scale property graph for efficient distributed query processing 21

Partitioning large-scale property graph for efficient distri...

引用

21st IEEE International Conference on High Performance computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on Data Science and systems, HPCC/SmartCity/DSS 2019

作者： Pang, Haohan Gan, Peng Yuan, Pingpeng Jin, Hai Hua, Qiangsheng National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab. Clusters and Grid Computing Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9781728120584

Recently, many communities have published their domain knowledge in the form of graphs. A significant trend is that the relations between pairs of nodes in the graph have become so complex that these data can be treated as property graphs. Complex properties imply semantic constraints which can distinguish elements of property graph into different semantic-related aspects. If the property graph can be partitioned according to these aspects, cross-partition communication would be reduced when evaluating SPARQL queries, for the reason that a query can often be evaluated in a single aspect. Conventional graph partition methods, however, pay little attention to semantic constraints in property graphs. To solve this problem, we propose a new property graph partition method for query optimization. First, we propose the property semantic reachable path as basic partition element, with which to capture the semantic-related aspects in a property graph. Second, to combine paths into partitions, we develop a space-efficient algorithm which merges vertices rather than entire paths. Extensive experiments over representative property graph data confirm the effectiveness of our semantic awareness approach. The performance of our approach is comparable with leading competitors, in terms of load balance, data redundancy, and network overhead. © 2019 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Space-Oblivious Compression and Wear Leveling for Non-Volatile Main Memories 36

Space-Oblivious Compression and Wear Leveling for Non-Volati...

引用

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

来源：评论

学校读者我要写书评

暂无评论

Fast isosurface extraction for medical volume dataset on cell BE

Fast isosurface extraction for medical volume dataset on cel...

引用

38th International Conference on Parallel Processing, ICPP-2009

作者： Jin, Hai Li, Bo Zheng, Ran Zhang, Qin Services Computing Technology and System Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9780769538020

The size of volumetric data generated by medical imaging and scientific simulations is increased significantly due to the dramatic advances in medical imaging modalities and computing technologies. The volumetric data generally need to be visualized and Marching Cubes algorithm (MC for short) is one of the standard methods of the isosurface extraction for the medical applications. However, MC algorithm requires a large amount of data computing power. The Cell Broadband Engine (Cell for short) processor, which is a typical COTS (commodity off-the-shelf) heterogeneous designed to handle extremely demanding computations, can be used to hasten isosurface extraction in medial application. In this paper, we present a streaming model-based scheme to efficiently map MC algorithm to Cell. Specifically, a blockbased filter running on PPE is imposed as a preprocessing stage to avoid unnecessary data transfer and computation, and the MC kernel runs on SPEs as the subsequent stage. Through tuning the size of the block, the workload of PPE and SPE is orchestrated harmoniously. The experimental results demonstrate that overall isosurface extraction speedup of more than 10 times is achieved compared with conventional heavy iron CPUs. © 2009 IEEE.

关键词： Cells

来源：评论

学校读者我要写书评

暂无评论

A scalable service scheme for secure group communication in grid

A scalable service scheme for secure group communication in ...

引用

31st Annual International Computer Software and Applications Conference, COMPSAC 2007

作者： Li, Yunfa Jin, Hai Zou, Deqing Chen, Jieyun Han, Zongfen Services Computing Technology and System Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9780769528700

In this paper, we propose a scalable service scheme for secure group communication in grid. In the service scheme, a series of methods and strategies are presented, such as the initialization methods for group member, administrative domain and virtual organization, the key distribution strategy and the rekeying strategy. In order to improve the scalability of this service scheme, the services for a group are logically divided into two hierarchical levels, which is in accordance with the characteristics of group communication in grid. In addition, in order to show the efficiency and the scalability of the service scheme, simulation experiments are done. The results show that the service scheme is efficient and scalable. Thus, the service scheme can satisfy the requirement of people in large-scale, dynamic grid environment. © 2007 IEEE.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Temporal-based ranking in heterogeneous networks

Temporal-based ranking in heterogeneous networks

引用

11th IFIP WG 10.3 International Conference on Network and Parallel computing, NPC 2014

作者： Yu, Chen Li, Ruidan Yao, Dezhong Lu, Feng Jin, Hai Services Computing Technology and System Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9783662449165

Ranking is a fundamental task for network analysis, benefiting to filter and find valuable information. Time information impacts results in content that is sensitive to trends and events ranking. The current ranking either assumes that user's interest and concerns remain static and never change over time or focuses on detecting recency information. Meanwhile most prevalent networks like social network are heterogeneous, that composed of multiple types of node and complex reliance structures. In this paper, we propose a general Temporal based Heterogeneous Ranking (TemporalHeteRank) method. We demonstrate that TemporalHeteRank is suitable for heterogeneous networks on the intuition that there is a mutually information balance relationship between different types of nodes that could be reflected on ranking results. We also explore the impact of node temporal feature in ranking, then we use the node life span by carefully investigating the issues of feasibility and generality. The experimental results on sina weibo ranking prove the effectiveness of our proposed approach. © 2014 IFIP International Federation for Information Processing.

关键词： Heterogeneous networks

来源：评论

学校读者我要写书评

暂无评论

Friends based keyword search over online social networks

Friends based keyword search over online social networks

引用

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

作者： Huang, Jinzhou Jin, Hai Services Computing Technology and System Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9783642380266

Online social networks are rapidly becoming popular for users to share, organize and locate interesting content. Users pay much attention to their close friends, those direct or two-hop friends. Users of Facebook commonly browse relevant profiles and the homepages, which are inefficient in obtaining desired information for a user due to the large amount of relevant data. In this paper, we propose a summary index with a ranking model by extending existing Bloom filter techniques, and achieve efficient full-text search over large scale OSNs to reduce inter-server communication cost and provide much shorter query latency. Furthermore, we conduct comprehensive simulations using traces from real world systems to evaluate our design. Results show that our scheme reduces the network traffic by 94.1% and reduces the query latency by 82.4% with high search accuracy. © 2013 Springer-Verlag.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

FIOS: A Flexible virtualized I/O Subsystem to alleviate interference among Virtual Machines 12

FIOS: A Flexible virtualized I/O Subsystem to alleviate inte...

引用

6th International Conference on Ubiquitous Information Management and Communication, ICUIMC'12

作者： Qi, Zhang Jin, Hai Liao, Xiaofei Li, Dingding Deng, Wei Services Computing Technology and System Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781450311724

Serving as the infrastructure of cloud computing, virtualization technologies have attracted considerable interest in recent years for their excellent resource utility, scalability, and high availability. Virtual Machine Monitor (VMM), which is a key element in cloud computing, enables multiple guest operating systems running simultaneously to share the same physical resources. This may lead to significant interference of disk I/O performance among virtual machines (VM). Particularly, the I/O performance of none I/O intensive domains can be seriously injured by the advent of I/O intensive nodes. We address this problem by building a block-level cache in the virtualized layer to absorb I/O requests from different domains. This method not only effectively alleviates the I/O performance interference caused by I/O intensive domains, but also greatly improves the I/O performance of guest OS. We implement and evaluate a Flexible I/O Subsystem (FIOS) within Xen VMM and show an evident reduction of I/O performance interference among virtual machines as well as a remarkable improvement of disk throughput. © 2012 ACM.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

A real-time scheduling framework based on multi-core dynamic partitioning in virtualized environment

A real-time scheduling framework based on multi-core dynamic...

引用

11th IFIP WG 10.3 International Conference on Network and Parallel computing, NPC 2014

作者： Wu, Song Zhou, Like Fu, Danqing Jin, Hai Shi, Xuanhua Services Computing Technology and System Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9783662449165

With the prevalence of virtualization and cloud computing, many real-time applications are running in virtualized cloud environments. However, their performance cannot be guaranteed because current hypervisors' CPU schedulers aim to share CPU resources fairly and improve system throughput. They do not consider real-time constraints of these applications, which result in frequent deadline misses. In this paper, we present a real-time scheduling framework in virtualized environment. In the framework, we propose a mechanism called multi-core dynamic partitioning to divide physical CPUs (PCPUs) into two pools dynamically according to the scheduling parameters of real-time virtual machines (RT-VMs). We apply different schedulers to these pools to schedule RT-VMs and non-RT-VMs respectively. Besides, we design a global earliest deadline first (vGEDF) scheduler to schedule RT-VMs. We implement a prototype in the Xen hypervisor and conduct experiments to verify its effectiveness. © 2014 IFIP International Federation for Information Processing.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：