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

31st ACM International Conference on Supercomputing, ICS 2017

作者： Shi, Xuanhua Li, Ming Liu, Wei Jin, Hai Yu, Chen Chen, Yong Services Computing Technology and System Lab Big Data Technology and System Lab Huazhong University of Science and Technology Wuhan430074 China Department of Computer Science Texas Tech University LubbockTX United States

ISBN: (纸本)9781450350204

Many high performance computing (HPC) applications are highly data intensive. Current HPC storage systems still use hard disk drives (HDDs) as their dominant storage devices, which suffer from disk head thrashing when accessing random data. New storage devices such as solid state drives (SSDs), which can handle random data access much more efficiently, have been widely deployed as the buffer to HDDs in many production HPC systems. Burst buffer has also been proposed to manage the SSD buffering of bursty write requests. Although burst buffer can improve I/O performance in many cases, we find that it has some limitations such as requiring large SSD capacity and harmonious overlapping between computation phase and data flushing stage. In this paper, we propose a scheme, called SSDUP (a traffic-aware SSD burst buffer), to improve the burst buffer by addressing the above limitations. In order to reduce the SSD capacity demand, we 5develop a novel traffic-detection method to detect the randomness in the write traffic. Based on this method, only the random writes are buffered to SSD and other writes are deemed sequential and propagated to HDDs directly. In order to overcome the difficulty of perfectly overlapping the computation phase and the flushing stage, we propose a pipeline mechanism for the SSD buffer, in which the data buffering and data flushing are performed in pipeline. Finally, in order to further improve the performance of buffering random writes in SSD, we covert the random writes to sequential writes in SSD by storing the data with a log structure. Further, we propose to use the AVL tree structure to store the sequence information of the data. We have implemented a prototype of SSDUP based on the OrangeFS and performed extensive experimental evaluation. The experimental results show that the proposed SSDUP scheme can improve the write performance by more than 50% on average. © 2017 Association for computing Machinery.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Layered Structure Aware Dependent Microservice Placement Toward Cost Efficient Edge Clouds 42

Layered Structure Aware Dependent Microservice Placement Tow...

引用

42nd IEEE International Conference on Computer Communications, INFOCOM 2023

作者： Zeng, Deze Geng, Hongmin Gu, Lin Li, Zhexiong China University of Geosciences School of Computer Science Wuhan China Huazhong University of Science and Technology 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 Wuhan China

ISBN: (纸本)9798350334142

Although the containers are featured by light-weightness, it is still resource-consuming to pull and startup a large container image, especially in relatively resource-constrained edge cloud. Fortunately, Docker, as the most widely used container, provides a unique layered architecture that allows the same layer to be shared between microservices so as to lower the deployment cost. Meanwhile, it is highly desirable to deploy dependent microservices of an application together to lower the operation cost. Therefore, the balancing of microservice deployment cost and the operation cost should be considered comprehensively to achieve minimal overall cost of an on-demand application. In this paper, we first formulate this problem into a Quadratic Integer Programming form (QIP) and prove it as a NP-hard problem. We further propose a Randomized Rounding-based Microservice Deployment and Layer Pulling (RR-MDLP) algorithm with low computation complexity and guaranteed approximation ratio. Through extensive experiments, we verify the high efficiency of our algorithm by the fact that it significantly outperforms existing state-of-the-art microservice deployment strategies. © 2023 IEEE.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

LS-AMS: An Adaptive Indexing Structure for Realtime Search on Microblogs

引用

IEEE Transactions on Big Data 2015年第4期1卷 125-137页

作者： Zhao, Feng Liu, Jun Zhou, Jingyu Jin, Hai Yang, Laurence T. Services Computing Technology and System Lab Big Data Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technolgoy Huazhong University of Science and Technology Wuhan China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China School of Computer Science and Technology Huazhong University of Science and Technology China Department of Computer Science St. Francis Xavier University Canada

Indexing microblogs for realtime search is challenging, because new microblogs are created at tremendous speed, and user query requests keep constantly changing. To guarantee user obtain complete query results, micro-blogging site maintains huge indices which leads to index fragmentation or extra merging overhead during realtime search. This paper proposes an efficient Log-Structured index structure with Adaptive Merging Strategy (LS-AMS) for realtime search on microblogs. LS-AMS structure consists of an inverted index buffer and a sequence of dynamically adjustable index packages with exponentially increasing sizes. These index packages manage their inverted indices using adaptive merging strategy, which can reduce the merging overhead to improve query performance and can adjust the index structure based on environmental factors, such as the arrival rate of query requests and new microblogs. Experimental results show that LS-AMS can greatly improve query performance without increasing the update cost and improve the self-adaptability in dynamic environment. © 2015 IEEE.

关键词： Merging

来源：评论

学校读者我要写书评

暂无评论

Ethereum smart contract security research:survey and future research opportunities

引用

Frontiers of Computer Science 2021年第2期15卷 143-160页

作者： Zeli WANG Hai JIN Weiqi DAI Kim-Kwang Raymond CHOO Deqing ZOU National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabClusters and Grid Computing LabHubei Engineering Research Center on Big Data SecurityWuhan430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan430074China School of Cyber Science and Engineering Huazhong University of Science and TechnologyWuhan430074China Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen518057China Department of Information Systems and Cyber Security University of Texas at San AntonioSan AntonioTX78249-0631USA

Blockchain has recently emerged as a research trend,with potential applications in a broad range of industries and *** particular successful Blockchain technology is smart contract,which is widely used in commercial settings(e.g.,high value financial transactions).This,however,has security implications due to the potential to financially benefit from a security incident(e.g.,identification and exploitation of a vulnerability in the smart contract or its implementation).Among,Ethereum is the most active and ***,in this paper,we systematically review existing research efforts on Ethereum smart contract security,published between 2015 and ***,we focus on how smart contracts can be maliciously exploited and targeted,such as security issues of contract program model,vulnerabilities in the program and safety consideration introduced by program execution *** also identify potential research opportunities and future research agenda.

关键词： smart contract security blockchain vulnerability unreliable data

来源：评论

学校读者我要写书评

暂无评论

Fast Parallel Recovery for Transactional Stream Processing on Multicores 40

Fast Parallel Recovery for Transactional Stream Processing o...

引用

40th IEEE International Conference on Data Engineering, ICDE 2024

作者： Zhao, Jianjun Liu, Haikun Zhang, Shuhao Duan, Zhuohui Liao, Xiaofei Jin, Hai Zhang, Yu School of Computer Science and Technology Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Wuhan China School of Computer Science and Engineering Nanyang Technological University Singapore

ISBN: (纸本)9798350317152

Transactional stream processing engines (TSPEs) have gained increasing attention due to their capability of processing real-time stream applications with transactional semantics. However, TSPEs remain susceptible to system failures and power outages. Existing TSPEs mainly focus on performance improvement, but still face a significant challenge to guarantee fault tolerance while offering high-performance services. We revisit commonly-used fault tolerance approaches in stream processing and database systems, and find that these approaches do not work well on TSPEs due to complex data dependencies. In this paper, we propose a novel TSPE called MorphStreamR to achieve fast failure recovery while guaranteeing low performance overhead at runtime. The key idea of MorphStreamR is to record intermediate results of resolved dependencies at runtime, and thus eliminate data dependencies to improve task parallelism during failure recovery. MorphStreamR further mitigates the runtime overhead by selectively tracking data dependencies and incorporating workload-aware log commitment. Experimental results show that MorphStreamR can significantly reduce the recovery time by up to 3.1 x while experiencing much less performance slowdown at runtime, compared with other applicable fault tolerance approaches. © 2024 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

D-overlay: A delay-aware overlay for gaming services

D-overlay: A delay-aware overlay for gaming services

引用

3rd International Conference on Innovative computing Information and Control, ICICIC'08

作者： Xiaofei, Liao Linchen, Yu Hai, Jin Hong, Yao Cluster and Grid Computing Lab. Services Computing Technology and System Lab. Huazhong University of Science and Technology Wuhan 430074 China School of Computer Science and Technology China University of Geosciences Wuhan 430074 China

ISBN: (纸本)9780769531618

Peer-to-peer (P2P) has become an important computing model because of its adaptation, selforganization and autonomy. But how to organize dynamic nodes in P2P networks efficiently for gaming message passing services is still a challenge. This paper present an approach, named D-overlay, a delay-aware overlay for gaming services, to implement node clustering based on link delay of nodes communications in the P2P network. This approach measures the delays among peers, explores the node connectivity together with the connection quality. Then, it builds a service ring for each peer according to its latency status, and keeps the low latency among neighbors by periodical adjustments. D-overlay improves the extensibility and reliability. One system, called PKTown, has been deployed based on D-overlay in CERNET of China. © 2008 IEEE.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Short: CICC: A fine-grained, semantic-aware, and transparent approach to preventing permission leaks for android permission managers 8

Short: CICC: A fine-grained, semantic-aware, and transparent...

引用

8th ACM Conference on Security and Privacy in Wireless and Mobile Networks, WiSec 2015

作者： Wang, Daibin Yao, Haixia Li, Yingjiu Jin, Hai Zou, Deqing Deng, Robert H. 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 School of Information Systems Singapore Management University Singapore

ISBN: (纸本)9781450336239

Android's permission system offers an all-or-nothing installation choice for users. To make it more flexible, users may choose a popular app tool, called permission manager, to selectively grant or revoke an app's permissions at runtime. A fundamental requirement for such permission manager is that the granted or revoked permissions should be enforced faithfully. However, we discover that none of existing permission managers meet this requirement due to permission leaks. To address this problem, we propose CICC, a finegrained, semantic-aware, and transparent approach for any permission managers to defend against the permission leaks. Compared to existing solutions, CICC is fine-grained because it detects the permission leaks using call-chain information at the component instance level, instead of at the app level or component level. The fine-grained feature enables it to generate a minimal impact on the usability of running apps. CICC is semantic-aware in a sense that it manages call-chains in the whole lifecycle of each component instance. CICC is transparent to users and app developers, and it requires minor modification to permission managers. Our evaluation shows that CICC incurs relatively low performance overhead and power consumption. Copyright 2015 ACM.

关键词： Android Call-chain Permission leaks Permission manager

来源：评论

学校读者我要写书评

暂无评论

GRAM: A GPU-based property graph traversal and query for HPC rich metadata management 1

引用

15th IFIP International Conference on Network and Parallel computing, NPC 2018

作者： Li, Wenke Shi, Xuanhua Huang, Hong Zhao, Peng Jin, Hai Dai, Dong Chen, Yong Services Computing Technology and System Lab Big Data Technology and System Lab Huazhong University of Science and Technology Wuhan430074 China Department of Computer Science Texas Tech University LubbockTX43104 United States

ISBN: (数字)9783030056773

ISBN: (纸本)9783030056766

In HPC systems, rich metadata are defined to describe rich information about data files, like the executions that lead to the data files, the environment variables, and the parameters of all executions, etc. Recent studies have shown the feasibility of using property graph to model rich metadata and utilizing graph traversal to query rich metadata stored in the property graph. We propose to utilize GPU to process the rich metadata graphs. There are generally two challenges to utilize GPU for metadata graph query. First, there is no proper data representation for the metadata graph on GPU yet. Second, there is no optimization techniques specifically for metadata graph traversal on GPU neither. In order to tackle these challenges, we propose GRAM, a GPU-based property graph traversal and query framework. GRAM uses GPU to express metadata graph in Compressed Sparse Row (CSR) format, and uses Structure of Arrays (SoA) layout to store properties. In addition, we propose two new optimizations, parallel filtering and basic operations merging, to accelerate the metadata graph traversal. Our evaluation results show that GRAM can be effectively applied to user scenarios in HPC systems, and the performance of metadata management is greatly improved. © IFIP International Federation for Information Processing 2018.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

LibAMM: Empirical Insights into Approximate computing for Accelerating Matrix Multiplication 38

LibAMM: Empirical Insights into Approximate Computing for Ac...

引用

38th Conference on Neural Information Processing systems, NeurIPS 2024

作者： Zeng, Xianzhi Jiang, Wenchao Zhang, Shuhao National Engineering Research Center for Big DataTechnology 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 Nanyang Technological University Singapore Singapore University of Technology and Design Singapore

Matrix multiplication (MM) is pivotal in fields from deep learning to scientific computing, driving the quest for improved computational efficiency. Accelerating MM encompasses strategies like complexity reduction, parallel and distributed computing, hardware acceleration, and approximate computing techniques, namely AMM algorithms. Amidst growing concerns over the resource demands of large language models (LLMs), AMM has garnered renewed focus. However, understanding the nuances that govern AMM's effectiveness remains incomplete. This study delves into AMM by examining algorithmic strategies, operational specifics, dataset characteristics, and their application in real-world tasks. Through comprehensive testing across diverse datasets and scenarios, we analyze how these factors affect AMM's performance, uncovering that the selection of AMM approaches significantly influences the balance between efficiency and accuracy, with factors like memory access playing a pivotal role. Additionally, dataset attributes are shown to be vital for the success of AMM in applications. Our results advocate for tailored algorithmic approaches and careful strategy selection to enhance AMM's effectiveness. To aid in the practical application and ongoing research of AMM, we introduce LibAMM -a toolkit offering a wide range of AMM algorithms, benchmarks, and tools for experiment management. LibAMM aims to facilitate research and application in AMM, guiding future developments towards more adaptive and context-aware computational solutions. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

CNLoc: Channel state information assisted indoor WLAN localization using nomadic access points 1

引用

15th IFIP International Conference on Network and Parallel computing, NPC 2018

作者： Xiao, Jiang Li, Huichuwu Li, He Jin, Hai 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 Department of Information and Electronic Engineering Muroran Institute of Technology MuroranHokkaido Japan

ISBN: (数字)9783030056773

ISBN: (纸本)9783030056766

Wireless local area network (WLAN) based indoor localization is expanding its fast-paced adoption to facilitate a variety of indoor location-based services (ILBS). Unfortunately, the performance of current WLAN localization systems relying on fixed access points (APs) deployment is constrained by the spatial localizability variance (SLV) problem that different locations may exhibit significantly distinct localization resolution. Prior approaches tackle this problem through nomadic APs with favorable mobility to dynamically adjust the network topology. However, the lack of prior knowledge of nomadic AP’s position has been a challenge for location distinction and will lead to prohibitive performance degradation. In this paper, we propose and develop CNLoc, a novel CSI-based (Channel State Information) indoor WLAN localization framework to overcome the location uncertainty of nomadic APs. Our implementation and evaluation show that CNLoc can improve the accuracy with unknown location information of nomadic APs. We also discuss some open issues and new possibilities in future nomadic AP based indoor localization. © IFIP International Federation for Information Processing 2018.

关键词： Channel state information

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：