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

Asia-Pacific Conference on Communications

作者： Sheng Di Hai Jin Shengli Li Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781424413737;1424413737

With the increasing scale of data transmitted over Internet, how to effectively query and present mass distributed monitoring data has become a serious problem in distributed monitoring field. Almost all users want to retrieve data as detail as possible; on the other hand, the practical bandwidth and latency limit the data scale in transmission. In order to solve this conflict, we design a flexible two-level mechanism. In our platform with this mechanism, users can customize various retrieving spaces by submitting their clients' memories. Subsequently, after receiving some request of observing the performance of monitored nodes, the server-end will process the data queried from database according to some rules before responding clients with two-level monitoring data streams (compressed data level and original data level). Through carefully testing, we testify this mechanism is indeed valuable in querying and presenting large-scale monitoring data.

关键词： Large-scale systems Monitoring Testing Bandwidth Databases Grid computing Delay Data security Computers Web and internet services

来源：评论

学校读者我要写书评

暂无评论

Secure Rank-Ordered Search of Multi-keyword Trapdoor over Encrypted Cloud Data

Secure Rank-Ordered Search of Multi-keyword Trapdoor over En...

引用

IEEE Asia-Pacific Conference on services computing (APSCC)

作者： Ayad Ibrahim Hai Jin Ali A. Yassin Deqing Zou Cluster and Grid Computing Laboratory Services Computing Technology and System Laboratory Huazhong University of Science and Technology Wuhan China

Advances in cloud computing and Internet technologies have pushed more and more data owners to outsource their data to remote cloud servers to enjoy with huge data management services in an efficient cost. However, despite its technical advances, cloud computing introduces many new security challenges that need to be addressed well. This is because, data owners, under such new setting, loss the control over their sensitive data. To keep the confidentiality of their sensitive data, data owners usually outsource the encrypted format of their data to the untrusted cloud servers. Several approaches have been provided to enable searching the encrypted data. However, the majority of these approaches are limited to handle either a single keyword search or a Boolean search but not a multikeyword ranked search, a more efficient model to retrieve the top documents corresponding to the provided keywords. In this paper, we propose a secure multi-keyword ranked search scheme over the encrypted cloud data. Such scheme allows an authorized user to retrieve the most relevant documents in a descending order, while preserving the privacy of his search request and the contents of documents he retrieved. To do so, data owner builds his searchable index, and associates with each term document with a relevance score, which facilitates document ranking. The proposed scheme uses two distinct cloud servers, one for storing the secure index, while the other is used to store the encrypted document collection. Such new setting prevents leaking the search result, i.e. the document identifiers, to the adversary cloud servers. We have conducted several empirical analyses on a real dataset to demonstrate the performance of our proposed scheme.

关键词： Servers Indexes Encryption Privacy Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Collaboratively Scheduling to Decrease Inter-AS Traffic in P2P Live Streaming

Collaboratively Scheduling to Decrease Inter-AS Traffic in P...

引用

International Conference on Advanced Information Networking and Applications Workshops (AINAW)

作者： Xuping Tu Hai Jin Xiaofei Liao Weidong Wang Sirui Yang Qi Huang Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory Huazhong University of Science and Technology Wuhan China

In the existing data fetching algorithms for P2P streaming systems, the peers usually fetch data independently, leading to huge inter-AS traffic (AS: autonomous system). This paper proposes CoFetch, a collaborative fetching algorithm for P2P live streaming systems to decrease inter-AS traffic. In CoFetch, to avoid that all peers fetch the same data from inter-AS connection, instead of aggressively fetching data depending on the peers' own desires, the peers divide requests into multiple steps. In each step, peers mainly and locally share data fetched in previous steps by other collaborating peers and request subset data from inter-AS connections. The analytical results show that, inter-AS traffic in CoFetch is independent of the number of peers in AS but the number of collaborating peers in AS. Furthermore, in each overlay, when we limit the number of collaborating peers in one AS from 5 to 20, the inter-AS traffic is about 1.7-3 times of the streaming rate, regardless of the number of peers.

关键词： Telecommunication traffic Peer to peer computing Network topology Application software Collaborative work International collaboration Processor scheduling Grid computing Computer science Electronic mail

来源：评论

学校读者我要写书评

暂无评论

GIRAFFE: A scalable distributed coordination service for large-scale systems 16

GIRAFFE: A scalable distributed coordination service for lar...

引用

16th IEEE International Conference on Cluster computing, CLUSTER 2014

作者： Shi, Xuanhua Lin, Haohong Jin, Hai Zhou, Bing Bing Yin, Zuoning Di, Sheng Wu, Song Services Computing Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology China Centre for Distributed and High Performance Computing School of Information Technologies University of Sydney Australia GraphSQL Inc. Australia INRIA Argonne National Laboratory United States

ISBN: (纸本)9781479955480

The scale of cloud services keeps increasing over time, significantly introducing huge challenges in system manageability and reliability. Designing coordination services in cloud is the right track to solve the above problems. However, existing coordination services (e.g., Chubby and ZooKeeper) only perform well in read-intensive scenario and small ensemble scales. To this end, we propose Giraffe, a scalable distributed coordination service. There are three important contributions in our design. (1) Giraffe organizes coordination servers using interior-node-disjoint trees for better scalability. (2) Giraffe employs a novel Paxos protocol for strong consistency and fault-tolerance. (3) Giraffe supports hierarchical data organization and in-memory storage for high throughput and low latency. We evaluate Giraffe on a high performance computing test-bed. The experimental results show that Giraffe gains much better write performance than ZooKeeper when server ensemble is large. Giraffe is nearly 300% faster than ZooKeeper on update operations when ensemble size is 50 servers. Experiments also show that Giraffe reacts and recovers more quickly than ZooKeeper against node failures. © 2014 IEEE.

关键词： Distributed cloud

来源：评论

学校读者我要写书评

暂无评论

Automatic power-aware reconfiguration of processor resource in virtualized clusters

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2011年第7期48卷 1123-1133页

作者： Jin, Hai Deng, Li Wu, Song Shi, Xuanhua Zhou, Like Key Laboratory of Services Computing Technology and System Huazhong University of Science and Technology Ministry of Education Wuhan 430074 China Key Laboratory of Cluster and Grid Computing of Hubei Province Huazhong University of Science and Technology Wuhan 430074 China

Virtualization provides significant benefits of system maintenance, load balancing, fault tolerance, and power-saving in clusters or data centers. It also enables dynamic reconfiguration of computing resource for application environment. However, current dynamic resource control approaches mainly focus on how to satisfy the application-level quality of service (QoS) when application workloads vary with time. They are driven by application performance, which is often specific to certain class of applications and also weakens the response capability of control systems. In this paper, a resource-use-status-driven resource reconfiguration scheme (RUSiC) is presented to automatically adapt to dynamic workload changes to meet the demands of application performance. According to the new characteristics introduced by system virtualization, the scheme is designed to be a two-layer resource reconfiguration model to exactly grasp the demands of applications. Based on real resource use status, the scheme adjusts proper resource configuration for applications in time. Furthermore, the scheme introduces power-saving into resource reconfiguration process and avoids considerable unnecessary power and cooling consumption by reducing the number of active physical nodes in a new resource configuration. Experiments demonstrate that the scheme can quickly detect and respond to shifting resource demands as application workloads change over time.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

A New Approach for Hiding Policy and Checking Policy Consistency

A New Approach for Hiding Policy and Checking Policy Consist...

引用

International Conference on Information Security and Assurance, ISA

作者： Deqing Zou Zhensong Liao Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Huazhong University of Science and Technology Wuhan China

Automated trust negotiation (ATN) is a new means to establish trust relationship through the mutual exchange of access control policy and credentials in the open and distributed environments. In ATN, access control policy plays a key role in protecting resources from unauthorized access. In practice, a policy may contain sensitive information, and its disclosure may cause damages. In order to protect the sensitive policy or its content, the policy is usually designed complex. Even worse, the policy may be self contradictory, which would lead the negotiation to fail. To solve such a problem, a new approach for checking policy consistency is proposed in the paper. In the approach, we analyze why the policy inconsistency happens and specify how to avoid it by simplifying a compound policy. Meanwhile, the approach is proved useful to hide policy by presenting some useful theorems to generate minimal policy set and credential set.

关键词： Access control Protection Privacy Internet Information security Grid computing Computer science Resource management Application software National security

来源：评论

学校读者我要写书评

暂无评论

Virtual machine VCPU scheduling in the multi-core environment: Issues and challenges

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2011年第7期48卷 1216-1224页

作者： Jin, Hai Zhong, Alin Wu, Song Shi, Xuanhua Key Laboratory of Services Computing Technology and System Huazhong University of Science and Technology Ministry of Education Wuhan 430074 China Key Laboratory of Cluster and Grid Computing of Hubei Province Huazhong University of Science and Technology Wuhan 430074 China

The policies and mechanisms of VCPU (virtual CPU) scheduling in a virtual machine system are key factors to determine the system performance. Because the architecture of the software stack in the virtual machine system is different from the traditional computer systems, when scheduling the VCPUs in virtual machines, simply adopting scheduling strategies and algorithms of existing operating systems without any modifications can lead to drastic degradation of the system performance. Moreover, with the multi-core technology being employed for physical processors, the complexity of the VCPU scheduling is increased. Firstly, the architecture of the virtual machine system and its two-stage scheduling framework are depicted and analyzed in detail in this paper. Because the deterministic mapping relationship between application threads and physical cores is difficult to establish in the two-stage framework, and part functions of operating systems move down to virtual machine monitor, VCPU scheduling will confront many problems and challenges that mainly embody four aspects: the semantic gap between guest operating systems and a virtual machine monitor, the synchronization mechanisms in a multiprocessor operating system, the structure of shared cache in multi-core processors and emerging asymmetric multi-core structure. And then advantages and limitations of the existing solutions for these problems are discussed and analyzed deeply, and suggestions for further researches are presented.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

引用

2009 IEEE International Conference on Information and Automation(2009年 IEEE信息与自动化国际学术会议)

作者： Zehua Lv Hai Jin Pingpeng Yuan Services Computing Technology and System Laboratory Cluster and Grid Computing laboratoryHuazhong University of Science and TechnologyWuhan430074China

Interval Type-2 Fuzzy Sets (IT2 FSs) has been used in wide range of applications, such as decision making, pattern recognitions. However, there is little investigation on the clustering techniques of IT2 FSs, since it is very important for measuring the degree of similarity between interval type-2 fuzzy sets in clustering research. In this paper, we give a novel method to represent interval type-2 fuzzy sets by a series of linear functions. This method is named as triangular representation because the curves of the functions and the coordinates shape into triangles. A new kind of similarity between interval type-2 fuzzy sets based on triangle is given and the validity of this method is proven. Furthermore, several numerical examples are given to show that the proposed similarity measure is reasonable and better than any existing methods.

关键词： Fuzzy sets Frequency selective surfaces Laboratories Pattern recognition Uncertainty Computers Grid computing Electronic mail Decision making Automation

来源：评论

学校读者我要写书评

暂无评论

λGrapher: A Resource-Efficient Serverless system for GNN Serving through Graph Sharing 24

λGrapher: A Resource-Efficient Serverless System for GNN Se...

引用

33rd ACM Web Conference, WWW 2024

作者： Hu, Haichuan Liu, Fangming Pei, Qiangyu Yuan, Yongjie Xu, Zichen Wang, Lin National Engineering Research Center for Big Data Technology and System The Services Computing Technology and System Lab Cluster and Grid Computing Lab in the School of Computer Science and Technology Huazhong University of Science and Technology 1037 Luoyu Road Wuhan China Peng Cheng Laboratory Huazhong University of Science and Technology China School of Mathematics and Computer Science Nanchang University China Paderborn University Paderborn Germany

ISBN: (纸本)9798400701719

Graph Neural Networks (GNNs) have been increasingly adopted for graph analysis in web applications such as social networks. Yet, efficient GNN serving remains a critical challenge due to high workload fluctuations and intricate GNN operations. Serverless computing, thanks to its flexibility and agility, offers on-demand serving of GNN inference requests. Alas, the request-centric serverless model is still too coarse-grained to avoid resource waste. Observing the significant data locality in computation graphs of requests, we propose λGrapher, a serverless system for GNN serving that achieves resource efficiency through graph sharing and fine-grained resource allocation. "Grapher features the following designs: (1) adaptive timeout for request buffering to balance resource efficiency and inference latency, (2) graph-centric scheduling to minimize computation and memory redundancy, and (3) resource-centric function management with fine-grained resource allocation catered to the resource sensitivities of GNN operations and function orchestration optimized to hide communication latency. We implement a prototype of λGrapher based on the representative open-source serverless platform Knative and evaluate it with real-world traces from various web applications. Our results show that λGrapher can achieve an average savings of 61.5% in memory resource and 47.2% in computing resource compared with the state of the arts while ensuring GNN inference latency. © 2024 ACM.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Xenrelay: An Efficient Data Transmitting Approach for Tracing Guest Domain

Xenrelay: An Efficient Data Transmitting Approach for Tracin...

引用

IEEE International Conference on Cloud computing technology and Science (CloudCom)

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

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 available 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.

关键词： Relays Kernel Bandwidth Data communication Virtual machining Performance evaluation Engines

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：