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

31st ACM International Conference on Supercomputing, ICS 2017

作者： Liu, Haikun Chen, Yujie Liao, Xiaofei Jin, Hai He, Bingsheng Zheng, Long Guo, Rentong Services Computing Technology and System Lab/Big Data Technology System Lab/Cluster and Grid Computing Lab School of Computing Science and Technology Huazhong University of Science and Technology Wuhan430074 China School of Computing National University of Singapore Singapore117418 Singapore

ISBN: (纸本)9781450350204

Non-Volatile Memory (NVM) has recently emerged for its nonvolatility, high density and energy efficiency. Hybrid memory systems composed of DRAM and NVM have the best of both worlds, because NVM can offer larger capacity and have near-zero standby power consumption while DRAM provides higher performance. Many studies have advocated to use DRAM as a cache to NVM. However, it is still an open problem on how to manage the DRAM cache effectively and efficiently. In this paper, we propose a novel Hardware/Software Cooperative Caching (HSCC) mechanism that organizes NVM and DRAM in a flat address space while logically supporting a cache/memory hierarchy. HSCC maintains the NVMto-DRAM address mapping and tracks the access counts of NVM pages through a moderate extension to page tables and TLBs. It significantly simplifies the hardware design and offers several optimization opportunities for cache management in software layers. We thus propose utility-based cache filtering policies to improve the efficiency of DRAM cache. Experimental results show that HSCC improves system performance by up to 9.6X (77.2% on average) and reduces energy consumption by 34.3% on average, compared to a hardware-assisted DRAM/NVM memory system. HSCC also presents 15.4% and 14.5% performance improvement against a .ataddressable memory architecture and a Row *** Locality Aware (RBLA) caching policy for hybrid memories, respectively. © 2017 Association for computing Machinery.

关键词： Dynamic random access storage

来源：评论

学校读者我要写书评

暂无评论

VulDeePecker: A deep learning-based system for vulnerability detection

arXiv

引用

arXiv 2018年

作者： Li, Zhen Zou, Deqing Xu, Shouhuai Ou, Xinyu Jin, Hai Wang, Sujuan Deng, Zhijun Zhong, Yuyi 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 School of Cyber Security and Computer Hebei University Shenzhen Huazhong University of Science and Technology Research Institute Department of Computer Science University of Texas at San Antonio

The automatic detection of software vulnerabilities is an important research problem. However, existing solutions to this problem rely on human experts to define features and often miss many vulnerabilities (i.e., incurring high false negative rate). In this paper, we initiate the study of using deep learning-based vulnerability detection to relieve human experts from the tedious and subjective task of manually defining features. Since deep learning is motivated to deal with problems that are very different from the problem of vulnerability detection, we need some guiding principles for applying deep learning to vulnerability detection. In particular, we need to find representations of software programs that are suitable for deep learning. For this purpose, we propose using code gadgets to represent programs and then transform them into vectors, where a code gadget is a number of (not necessarily consecutive) lines of code that are semantically related to each other. This leads to the design and implementation of a deep learning-based vulnerability detection system, called Vulnerability Deep Pecker (VulDeePecker). In order to evaluate VulDeePecker, we present the first vulnerability dataset for deep learning approaches. Experimental results show that VulDeePecker can achieve much fewer false negatives (with reasonable false positives) than other approaches. We further apply VulDeePecker to 3 software products (namely Xen, Seamonkey, and Libav) and detect 4 vulnerabilities, which are not reported in the National Vulnerability Database but were "silently" patched by the vendors when releasing later versions of these products;in contrast, these vulnerabilities are almost entirely missed by the other vulnerability detection systems we experimented with. Copyright © 2018, The Authors. All rights reserved.

关键词： Computer software

来源：评论

学校读者我要写书评

暂无评论

Sysevr: A framework for using deep learning to detect software vulnerabilities

arXiv

引用

arXiv 2018年

作者： Li, Zhen Zou, Deqing Xu, Shouhuai Jin, Hai Zhu, Yawei Chen, Zhaoxuan Services Computing Technology and System Lab Cluster and Grid Computing Lab Big Data Security Engineering Research Center School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Department of Computer Science University of Texas at San Antonio San AntonioTX78249 United States

The detection of software vulnerabilities (or vulnerabilities for short) is an important problem that has yet to be tackled, as manifested by many vulnerabilities reported on a daily basis. This calls for machine learning methods to automate vulnerability detection. Deep learning is attractive for this purpose because it does not require human experts to manually define features. Despite the tremendous success of deep learning in other domains, its applicability to vulnerability detection is not systematically understood. In order to fill this void, we propose the first systematic framework for using deep learning to detect vulnerabilities. The framework, dubbed Syntax-based, Semantics-based, and Vector Representations (SySeVR), focuses on obtaining program representations that can accommodate syntax and semantic information pertinent to vulnerabilities. Our experiments with 4 software products demonstrate the usefulness of the framework: we detect 15 vulnerabilities that are not reported in the National Vulnerability Database. Among these 15 vulnerabilities, 7 are unknown and have been reported to the vendors, and the other 8 have been "silently" patched by the vendors when releasing newer versions of the products. Copyright © 2018, The Authors. All rights reserved.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

Theory and methodology of research on cloud security

引用

Science china(Information Sciences) 2016年第5期59卷 15-17页

作者： Hai JIN Weiqi DAI Deqing ZOU 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

Cloud computing is a model for enabling ubiquitous,convenient,on-demand access to a shared pool of configurable computing *** to Gartner’s survey,cloud computing has been at the head of a list of the top ten IT strategic technologies for some *** computing is currently undergoing vigorous development and promotion by many leading Chinese and foreign enterprises,and it has become the basis for a new

关键词： TPM Theory and methodology of research on cloud security

来源：评论

学校读者我要写书评

暂无评论

Exploring the Impact of Processing Guarantees on Performance of Stream Data Processing

Exploring the Impact of Processing Guarantees on Performance...

引用

2017 17th IEEE International Conference on Communication technology (ICCT 2017)

作者： Syed Muhammad Abrar Akber Changfu Lin Hanhua Chen Fan Zhang Hai Jin Cluster and Grid Computing Lab Services Computing Technology and System Lab Big Data Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology

Processing semantics ensure tuple processing guarantees during system recovery from failures. It determines whether particular tuples are re-processed or not upon system recovery. Processing semantics facilitate to maintain real-time response as well as correctness of results in stream data processing. Existing literature is in real deficit to provide sufficient resources exclusively on processing semantics. This work focuses on reviewing processing semantics in stream data processing *** article aims at exploring the impact of processing guaran-tees on performance of stream data processing. We summarize current research directions to guarantee processing semantics,based on prominent stream processing engines. Furthermore,we compare throughput for a couple of representative stream processing engines under all possible processing *** experiments show that at-most once processing guarantee provides the highest throughput among other guarantees. Lastly,challenges for further research are also discussed in this paper.

关键词： stream data processing processing semantic processing guarantee at-least once at-most once exactly-once

来源：评论

学校读者我要写书评

暂无评论

Core maintenance in dynamic graphs: A parallel approach based on matching

arXiv

引用

arXiv 2017年

作者： Wang, Na Yu, Dongxiao Jin, Hai Hua, Qiang-Sheng Shi, Xuanhua Xie, Xia Services Computing Technology and System Lab Big Data Technology and System Lab Clusters and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

—The core number of a vertex is a basic index depicting cohesiveness of a graph, and has been widely used in large-scale graph analytics. In this paper, we study the update of core numbers of vertices in dynamic graphs with edge insertions/deletions, which is known as the core maintenance problem. Different from previous approaches that just focus on the case of single-edge insertion/deletion and sequentially handle the edges when multiple edges are inserted/deleted, we investigate the parallelism in the core maintenance procedure. Specifically, we show that if the inserted/deleted edges constitute a matching, the core number update with respect to each inserted/deleted edge can be handled in parallel. Based on this key observation, we propose parallel algorithms for core maintenance in both cases of edge insertions and deletions. We conduct extensive experiments to evaluate the efficiency, stability, parallelism and scalability of our algorithms on different types of real-world and synthetic graphs. Comparing with sequential approaches, our algorithms can improve the core maintenance efficiency significantly. Copyright © 2017, The Authors. All rights reserved.

关键词： Maintenance

来源：评论

学校读者我要写书评

暂无评论

Scalable Hash Ripple Join on Spark

Scalable Hash Ripple Join on Spark

引用

International Conference on Parallel and Distributed systems (ICPADS)

作者： Hao Liu Jiang Xiao Fengchao Peng The Department of Computer Science and Engineering The Hong Kong University of Science and Technology Services Computing Technology and System Lab Cluster and Grid Computing Lab Shool of Computer Science and Technology Huazhong University of Science and Technology

ISBN: (纸本)9781538632086

Hash Ripple join is an online aggregation algorithm that can rapidly give good approximate join results increases with the progress of the join operation and converges to the real result when the join finishes. Luo et al. proposed a parallel hash ripple join (PHRJ) that runs in a distributed setting. However, the PHRJ has two drawbacks when handling large-scale data: 1) PHRJ updates approximate results in fine grain which induces extra communication cost in a distributed environment 2) When data is out of memory, PHRJ cannot provide unbiased approximate result. In this thesis, a scalable hash ripple join is proposed that 1) runs on a distributed framework that can process distributed data in coarse-grain to speed up the join performance; 2) continuously gives unbiased and consistent approximate join results even in the presence of memory overflow; and 3) has good scalability handling growing amount of data. We have implemented a prototype of the scalable hash ripple join (SHRJ) algorithm on Spark. Experiment results show that SHRJ can give good approximate join result while taking less than 10% of the time of Spark's own join operator.

关键词： Sparks Distributed databases Approximation algorithms clustering algorithms Indexes Standards Computer science

来源：评论

学校读者我要写书评

暂无评论

LaLDPC: Latency-aware LDPC for read performance improvement of solid state drives 33

LaLDPC: Latency-aware LDPC for read performance improvement ...

引用

33rd International Conference on Massive Storage systems and technology, MSST 2017

作者： Du, Yajuan Zou, Deqing Li, Qiao Shi, Liang Jin, Hai Xuey, Chun Jason Service Computing Technology and System Lab Cluster and Grid Computing Lab Big Data Technol. and Syst. Lab Sch. of Comp. Sci. and Technology Huazhong Univ. of Sci. and Technol. Wuhan430074 China Department of Computer Science City University of Hong Kong Kowloon Hong Kong College of Computer Science Chongqing University Chongqing China

High-density Solid State Drives (SSDs) have to use Low-Density Parity-Check (LDPC) codes to store data reliably. Current LDPC implementations apply multiple read-retry steps to find the appropriate set of multiple Reference Voltage (RVs) for successful decoding. These appropriate RVs, number of which is represented by read level, cannot be obtained in advance, instead, an iterative read-retry LDPC process happens that starts with the first read level with the smallest number of RVs and then increases the level until that the data have been successfully decoded. Only read-retry with the last read level, called the appropriate read level, is necessary. Read latency can be improved by avoiding read-retries. This becomes particularly important in the late stage of SSD life when high read levels are needed. To avoid unnecessary read-retries, this paper proposes Latency-aware LDPC (LaLDPC). We study read level characteristics along with data retention and observe that a single read level stays appropriate for a long time. During this time, all reads in the same page have probably the same appropriate read level, which we call the temporal read level locality. Using this value, LaLDPC estimates the starting read voltage level, which we store in the flash translation layer of the controller. As an example, we show how to integrate LaLDPC into the Demand-based Flash Translation Layer (DFTL). A new cache eviction algorithm is also proposed to leave entries with high read levels in the cache as long as possible. Experimental results show that LaLDPC saves 56% of read retries and improves SSD read performance by 18% on average compared with the existing LDPC method. © 33rd International Conference on Massive Storage systems and technology, MSST 2017. All rights reserved.

关键词： Forward error correction

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to “Fine-Grained Control-Flow Integrity Based on Points-to Analysis for CPS”

引用

Security and Communication Networks 2018年第1期2018卷

作者： Weizhong Qiang Shizhen Wang Hai Jin Jiangying Zhong Services Computing Technology and System Lab Cluster and Grid Computing Lab Big Data Security Engineering Research Center School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 ***

来源：评论

学校读者我要写书评

暂无评论

UiLog： Improving Log-Based Fault Diagnosis by Log Analysis

引用

Journal of Computer Science & technology 2016年第5期31卷 1038-1052页

作者： De-Qing Zou Services Computing Technology and System Laboratory Huazhong University of Science and Technology Wuhan ~3007~ China Big Data Technology and System Laboratory Huazhong University of Science and Technology Wuhan 430074 China Cluster and Grid Computing Laboratory Huazhong University of Science and Technology Wuhan 430074 China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

In modern computer systems, system event logs have always been the primary source for checking system status. As computer systems become more and more complex, the interaction between software and hardware increases frequently. The components will generate enormous log information, including running reports and fault information. The sheer quantity of data is a great challenge for analysis relying on the manual method. In this paper, we implement a management and analysis system of log information, which can assist system administrators to understand the real-time status of the entire system, classify logs into different fault types, and determine the root cause of the faults. In addition, we improve the existing fault correlation analysis method based on the results of system log classification. We apply the system in a cloud computing environment for evaluation. The results show that our system can classify fault logs automatically and effectively. With the proposed system, administrators can easily detect the root cause of faults.

关键词： fault diagnosis system event log log classification fault correlation analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：