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

Answering reachability queries with ordered lab.l constraints over lab.led graphs

Frontiers of Computer Science 2024年第1期18卷 105-117页

作者： Daoliang HE Pingpeng YUAN 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&TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Reachability query plays a vital role in many graph analysis *** researches proposed many methods to efficiently answer reachability queries between vertex *** many real graphs are lab.led graph,it highly demands lab.l-Constrained Reachability(LCR)query inwhich constraint includes a set of lab.ls besides vertex *** researches proposed several methods for answering some LCR queries which require appearance of some lab.ls specified in constraints in the *** that constraint may be a lab.l set,query constraint may be ordered lab.ls,namely OLCR(Ordered-lab.l-Constrained Reachability)queries which retrieve paths matching a sequence of ***,no solutions are availab.e for ***,we propose DHL,a novel bloom filter based indexing technique for answering OLCR *** can be used to check reachability between vertex *** the answers are not no,then constrained DFS is ***,we employ DHL followed by performing constrained DFS to answer OLCR *** show that DHL has a bounded false positive rate,and it's powerful in saving indexing time and *** experiments on 10 real-life graphs and 12 synthetic graphs demonstrate that DHL achieves about 4.8-22.5 times smaller index space and 4.6-114 times less index construction time than two state-of-art techniques for LCR queries,while achieving comparable query response *** results also show that our algorithm can answer OLCR queries effectively.

关键词： graph ordered-lab.l-constrained reachability partial index bloom filter query processing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Xenrelay: An efficient data transmitting approach for tracing guest domain

Xenrelay: An efficient data transmitting approach for tracin...

引用

2nd IEEE International Conference on Cloud computing technology and Science, CloudCom 2010

作者： Jin, Hai Cao, Wenzhi Yuan, Pingpeng Xie, Xia Cluster and Grid Computing Lab. Services Computing Technique and System Lab. Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9780769543024

As the degree of virtualization is growing considerably, improving performance of virtual machine environments motivates deeper investigation of the internal processes and performance implications of virtualization. Several tools are currently availab.e to help analyze performance in virtual machine environments. However, all of these cannot support users to add their own trace information. In this paper, we present Xenrelay, a unified, efficient, and simple mechanism for transferring large amounts of data from guest domain kernel to privileged domain user-space. Xenrelay allows users (who trace subsystems of guest domain to analyze performance) to record and fast relay data between domains. We provide a case of Xenrelay's value in revealing behavior of virtualization. We build a block trace toolkit (using Xenrelay as an engine). This toolkit is used to track the block I/O virtualization procedures and evaluates overheads in the Xen environment. Our trace results identify that the main delay is the time of request transmission and block device operation. Besides, the results reveal impact of the I/O schedules on the disk performance. © 2010 IEEE.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

RB-GACA: An RBAC based grid access control architecture

引用

International Journal of grid and Utility computing 2005年第1期1卷 61-70页

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

grid computing is emerging as a new format of wide area distributed computing. Because the distribution of services and resources in wide-area networks are heterogeneous, dynamic, and multi-domain, security is a critical concern in grid computing. Authorisation and access control, which are important aspects of security, have obtained more and more attention. This paper proposes a universal, scalab.e authorisation and access control architecture, RB-GACA, for grid computing. It is based on classical access control mechanism in distributed applications, Role Based Access Control (RBAC). The paper provides a flexible policy management approach for various grid environments. We also use a standard policy language for the presentation of access control policies to provide a general and standard support for different services and resources. Copyright © 2005, Inderscience Publishers.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Chinagrid: Making grid computing a reality

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2004年 3334卷 13-24页

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

grid computing presents a new trend to distributed computing and Internet applications, which can construct a virtual single image of heterogeneous resources, provide uniform application interface and integrate widespread computational resources into super, ubiquitous and transparent aggregation. Chinagrid project, founded by Ministry of Education of China, is an attempt to achieve above goals by exploring the various resources on existing and well developed internet infrastructure, CERNET (China Education and Research Network). In this paper, I will introduce the general picture of Chinagrid project, its vision and mission. The design of Chinagrid support platform, called CGSP, is also discussed briefly. To illustrate the reality of Chinagrid project, five different grid computing applications and its application supporting platform are discussed in detail. The purpose of this paper is to introduce this great grid project to the world completely for the first time. © Springer-Verlag Berlin Heidelberg 2004.

关键词： grid computing

来源：评论

学校读者我要写书评

暂无评论

A high-performance inter-domain data transferring system for virtual machines

Journal of Software

引用

Journal of Software 2010年第2期5卷 206-213页

作者： Li, Dingding Jin, Hai Shao, Yingzhe Liao, Xiaofei Han, Zongfen Chen, Kai Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

Virtual machine technology can enhance server utilization and consolidation on an individual physical machine. In a growing number of contexts, many of which re-quire high-performance networking inside of the system. Unfortunately, the development of virtualization technology is inclined to application isolation as yet, leads high communication overheads between virtual machines which are resident on the same physical machine, and also limits the achievable network performance. Some efforts have been paid to bridge the network I/O performance gap between the virtualization and native environment, but the amelioration is not satisfactory. In this paper, we propose a system called IDTS (Inter-Domain Transferring system) which uses the shared memory between different domains (also called hosted or guest OSes) to expand the communication band-width and shorten the latency for network applications running in the co-resident VMs. Evaluations are also presented to prove IDTS's availab.lity and highly efficiency. We believe that IDTS is an effective solution for the inter-domain communication on Xen virtualization platform. © 2010 Academy Publisher.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

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 scalab.lity. 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 survey on dynamic graph processing on GPUs: concepts, terminologies and systems

引用

Frontiers of Computer Science 2024年第4期18卷 1-23页

作者： Hongru GAO Xiaofei LIAO Zhiyuan SHAO Kexin LI Jiajie CHEN Hai JIN 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 TechnologyHuazhong University of Science and TechnologyWuhan 430074China Zhejiang Lab Hangzhou 311121China

Graphs that are used to model real-world entities with vertices and relationships among entities with edges,have proven to be a powerful tool for describing real-world problems in *** most real-world scenarios,entities and their relationships are subject to constant *** that record such changes are called dynamic *** recent years,the widespread application scenarios of dynamic graphs have stimulated extensive research on dynamic graph processing systems that continuously ingest graph updates and produce up-to-date graph analytics *** the scale of dynamic graphs becomes larger,higher performance requirements are demanded to dynamic graph processing *** the massive parallel processing power and high memory bandwidth,GPUs become mainstream vehicles to accelerate dynamic graph processing ***-based dynamic graph processing systems mainly address two challenges:maintaining the graph data when updates occur(i.e.,graph updating)and producing analytics results in time(i.e.,graph computing).In this paper,we survey GPU-based dynamic graph processing systems and review their methods on addressing both graph updating and graph *** comprehensively discuss existing dynamic graph processing systems on GPUs,we first introduce the terminologies of dynamic graph processing and then develop a taxonomy to describe the methods employed for graph updating and graph *** addition,we discuss the challenges and future research directions of dynamic graph processing on GPUs.

关键词： dynamic graphs graph processing graph algorithms GPUs

来源：评论

学校读者我要写书评

暂无评论

High performance RDF updates with triplebit + 13

High performance RDF updates with triplebit +

引用

13th International Conference on Digital Information Management, ICDIM 2018

作者： Yuan, Pingpeng Fan, Lijian Jin, Hai Services Computing Technology and System Lab. Cluster and Grid Computing Lab. School of Computer Science Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781538652435

The volume of RDF data continues to grow over the past decade and many known RDF datasets have billions of triples. A grant challenge of managing this huge RDF data is how to access this big RDF data efficiently. A popular approach to addressing the problem is to build a full set of permutations of (S, P, O) indexes. Although this approach has shown to accelerate joins by orders of magnitude, the large space overhead limits the scalab.lity of this approach and makes it heavyweight. In this paper, we present TripleBit +, a fast and compact system for updating RDF data. The design of TripleBit + has two salient features. First, the efficient maintenance strategies of TripleBit + reduces both the overhead to update data and indexes. Second, effective maintenance technologies to handle online updates over RDF repositories are proposed. Our experiments show that TripleBit + outperforms RDF-3X, MonetDB, BitMat on LUBM, UniProt, and BTC 2012 benchmark queries and it offers orders of mangnitude performance improvement for some complex join queries. Our design also yields high task rates as high as 660,000 per second and fast average response time of task which is faster than x-RDF-3X and PostgreSQL. © 2018 IEEE.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Dependency-aware maintenance for dynamic grid services

Dependency-aware maintenance for dynamic grid services

引用

36th International Conference on Parallel Processing in Xi'an, ICPP

作者： Jin, Hai Qi, Li Wu, Song Luo, Yaqin Dai, Jie Cluster and Grid Computing Lab. Service Computing Technology and System Huazhong University of Science and Technology

ISBN: (纸本)076952933X

Any mistaken maintenance for the complicated and distributed grid can bring unpredictable disaster. Here we focus on the system availab.lity issues caused by service dependencies during the maintenance in grid. A novel mechanism, called Cobweb Guardian, is proposed in this paper. It provides multiple granularities (service-, container-, and node-level) maintenance for service components in grid. By using the Cobweb Guardian, grid administrators can execute the maintaining task safely in runtime with high availab.lity. The evaluation results show that our proposed dependency-aware maintenance can make the grid management more automatic and availab.e. © 2007 IEEE.

关键词： Maintenance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：