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

16th ACM International Conference on Mobile systems, Applications, and Services,MobiSys 2018

作者： Li, Wenhao Luo, Shiyu Sun, Zhichuang Xia, Yubin Lu, Long Chen, Haibo Zang, Binyu Guan, Haibing Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University China Northeastern University United States

ISBN: (纸本)9781450357203

More and more malicious apps and mobile rootkits are found to perform sensitive operations on behalf of legitimate users without their awareness. Malware does so by either forging user inputs or tricking users into making unintended requests to online service providers. Such malware is hard to detect and generates large revenues for cybercriminals, which is often used for committing ad/click frauds, faking reviews/ratings, promoting people or business on social networks, etc. We find that this class of malware is possible due to the lack of practical and robust means for service providers to verify the authenticity of user-driven operations (i.e., operations supposed to be performed, or explicitly confirmed, by a user). We design and build the VButton system to fill this void. Our system introduces a class of attestation-enabled app UI widgets (called VButton UI). Developers can easily integrate VButton UI in their apps to allow service providers to verify that a user-driven operation triggered by a VButton UI is indeed initiated and intended by a real user. Our system contains an on-device Manager, and a server-side Verifier. Leveraging ARM TrustZone, our system can attest operation authenticity even in the presence of a compromised OS. We have implemented the VButton system on an ARM development board as well as a commercial off-the-shelf smartphone. The evaluation results show that the system incurs negligible overhead. © 2018 Association for computing Machinery.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

On the parallels between Paxos and Raft, and how to port optimizations (Extended Version)

arXiv

引用

arXiv 2019年

作者： Wang, Zhaoguo Zhao, Changgeng Mu, Shuai Chen, Haibo Li, Jinyang Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Institute of Parallel and Distributed Systems Shanghai Jiao Tong University Department of Computer Science New York University Department of Computer Science Stony Brook University

In recent years, Raft has overtaken Paxos as the consensus algorithm of choice. [53] While many have pointed out similarities between the two protocols, no one has formally mapped out their relationships. In this paper, we show how Raft and Paxos are formally related despite their surface differences. Based on the formal mapping between the two protocols, we show how to automatically port a certain class of optimizations from Paxos to Raft with guaranteed correctness. As case studies, we port and evaluate two optimizations, Mencius and Paxos Quorum Lease to Raft. Copyright © 2019, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Recovering Performance for Vector-based Machine Learning on Managed Runtime

引用

ACM SIGPLAN Notices 2017年第8期52卷 457-458页

作者： Wu, Mingyu Guan, Haibing Zang, Binyu Chen, Haibo Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China

来源：评论

学校读者我要写书评

暂无评论

Espresso: Brewing Java for More Non-Volatility with Non-volatile Memory

arXiv

引用

arXiv 2017年

作者： Wu, Mingyu Zhao, Ziming Li, Haoyu Li, Heting Chen, Haibo Zang, Binyu Guan, Haibing Shanghai Key Lab. of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University

Fast, byte-addressable non-volatile memory (NVM) em-braces both near-DRAM latency and disk-like persistence, which has generated considerable interests to revolutionize system software stack and programming models. However, it is less understood how NVM can be combined with managed runtime like Java virtual machine (JVM) to ease persistence management. This paper proposes Espresso1, a holistic ex-tension to Java and its runtime, to enable Java programmers to exploit NVM for persistence management with high perfor-mance. Espresso first provides a general persistent heap de-sign called Persistent Java Heap (PJH) to manage persistent data as normal Java objects. The heap is then strengthened with a recoverable mechanism to provide crash consistency for heap metadata. It then provides a new abstraction called Persistent Java Object (PJO) to provide an easy-to-use but safe persistent programming model for programmers to per-sist application data. The evaluation confirms that Espresso significantly outperforms state-of-art NVM support for Java (i.e., JPA and PCJ) while being compatible to existing data structures in Java programs. Copyright © 2017, The Authors. All rights reserved.

关键词： Nonvolatile storage

来源：评论

学校读者我要写书评

暂无评论

Secure Live Migration of SGX Enclaves on Untrusted Cloud

Secure Live Migration of SGX Enclaves on Untrusted Cloud

引用

International Conference on Dependable systems and Networks (DSN)

作者： Jinyu Gu Zhichao Hua Yubin Xia Haibo Chen Binyu Zang Haibing Guan Jinming Li Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Institute of Parallel and Distributed Systems (IPADS) Shanghai Jiao Tong University Huawei Technologies Inc.

ISBN: (纸本)9781538605431

The recent commercial availab.lity of Intel SGX (Software Guard eXtensions) provides a hardware-enabled building block for secure execution of software modules in an untrusted cloud. As an untrusted hypervisor/OS has no access to an enclave's running states, a VM (virtual machine) with enclaves running inside loses the capability of live migration, a key feature of VMs in the cloud. This paper presents the first study on the support for live migration of SGX-capable VMs. We identify the security properties that a secure enclave migration process should meet and propose a software-based solution. We leverage several techniques such as two-phase checkpointing and self-destroy to implement our design on a real SGX machine. Security analysis confirms the security of our proposed design and performance evaluation shows that it incurs negligible performance overhead. Besides, we give suggestions on the future hardware design for supporting transparent enclave migration.

关键词： Program processors Hardware Security Virtual machine monitors Cloud computing Context

来源：评论

学校读者我要写书评

暂无评论

Rethinking benchmarking for NVM-based file systems 16

Rethinking benchmarking for NVM-based file systems

引用

7th ACM SIGOPS Asia-Pacific Workshop on systems, APSys 2016

作者： Dong, Mingkai Yu, Qianqian Zhou, Xiaozhou Hong, Yang Chen, Haibo Zang, Binyu Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China

ISBN: (纸本)9781450342650

Fast, byte-addressable NVM promises near-cache latency and near memory bus throughput for file systems, which is evident by recent development of a number of NVM file systems (NVMFS). However, a key approach to measuring their performance, file system benchmarks, remains unchanged as those for disk-based file systems (DFS). In this paper, we analyze the pitfalls of using DFS benchmarks to evaluate NVMFS and propose several changes to existing DFS benchmarks to better characterize the performance of NVMFS. © 2016 ACM.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Bipartite-Oriented distributed Graph Partitioning for Big Learning

引用

Journal of Computer Science & Technology 2015年第1期30卷 20-29页

作者：陈榕施佳鑫陈海波臧斌宇 Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University Shanghai 200240 China

Many machine learning and data mining （MLDM] problems like recommendation, topic modeling, and medical diagnosis can be modeled as computing on bipartite graphs. However, inost distributed graph-parallel systems are oblivious to the unique characteristics in such graphs and existing online graph partitioning algorithms usually cause excessive repli- cation of vertices as well as significant pressure on network communication. This article identifies the challenges and oppor- tunities of partitioning bipartite graphs for distributed MLDM processing and proposes BiGraph, a set of bipartite-oriented graph partitioning algorithms. BiGraph leverages observations such as the skewed distribution of vertices, discriminated computation load and imbalanced data sizes between the two subsets of vertices to derive a set of optimal graph partition- ing algorithms that result in minimal vertex replication and network communication. BiGraph has been implemented on PowerGraph and is shown to have a performance boost up to 17.75X （from 1.16X） for four typical MLDM algorithnls, due to reducing up to 80% vertex replication, and up to 96% network traffic.

关键词： bipartite graph graph partitioning graph-parallel system

来源：评论

学校读者我要写书评

暂无评论

Efficient and availab.e in-memory KV-store with hybrid erasure coding and replication 16

Efficient and available in-memory KV-store with hybrid erasu...

引用

Proceedings of the 14th Usenix Conference on File and Storage Technologies

作者： Heng Zhang Mingkai Dong Haibo Chen Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University

ISBN: (纸本)9781931971287

In-memory key/value store (KV-store) is a key building block for many systems like databases and large websites. Two key requirements for such systems are efficiency and availab.lity, which demand a KV-store to continuously handle millions of requests per second. A common approach to availab.lity is using replication such as primary-backup (PBR), which, however, requires M + 1 times memory to tolerate M failures. This renders scarce memory unable to handle useful user *** paper makes the first case of building highly availab.e in-memory KV-store by integrating erasure coding to achieve memory efficiency, while not notably degrading performance. A main challenge is that an in-memory KV-store has much scattered metadata. A single KV put may cause excessive coding operations and parity updates due to numerous small updates to metadata. Our approach, namely Cocytus, addresses this challenge by using a hybrid scheme that leverages PBR for small-sized and scattered data (e.g., metadata and key), while only applying erasure coding to relatively large data (e.g., value). To mitigate well-known issues like lengthy recovery of erasure coding, Cocytus uses an online recovery scheme by leveraging the replicated metadata information to continuously serving KV requests. We have applied Cocytus to Memcached. Evaluation using YCSB with different KV configurations shows that Cocytus incurs low overhead for latency and throughput, can tolerate node failures with fast online recovery, yet saves 33% to 46% memory compared to PBR when tolerating two failures.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Mitigating sync amplification for copy-on-write virtual disk 16

Mitigating sync amplification for copy-on-write virtual disk

引用

Proceedings of the 14th Usenix Conference on File and Storage Technologies

作者： Qingshu Chen Liang Liang Yubin Xia Haibo Chen Hyunsoo Kim Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University Samsung Electronics Co. Ltd.

ISBN: (纸本)9781931971287

Copy-on-write virtual disks (e.g., qcow2 images) provide many useful features like snapshot, de-duplication, and full-disk encryption. However, our study uncovers that they introduce additional metadata for block organization and notably more disk sync operations (e.g., more than 3X for qcow2 and 4X for VMDK images). To mitigate such sync amplification, we propose three optimizations, namely per virtual disk internal journaling, dual-mode journaling, and adaptive-preallocation, which eliminate the extra sync operations while preserving those features in a consistent way. Our evaluation shows that the three optimizations result in up to 110% performance speedup for varmail and 50% for TPCC.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Powerlyra: Differentiated graph computation and partitioning on skewed graphs 15

Powerlyra: Differentiated graph computation and partitioning...

引用

10th European Conference on Computer systems, EuroSys 2015

作者： Chen, Rong Shi, Jiaxin Chen, Yanzhe Chen, Haibo Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China

ISBN: (纸本)9781450332385

Natural graphs with skewed distribution raise unique challenges to graph computation and partitioning. Existing graph-parallel systems usually use a "one size fits all" design that uniformly processes all vertices, which either suffer from notable load imbalance and high contention for high-degree vertices (e.g., Pregel and Graphlab., or incur high communication cost and memory consumption even for low-degree vertices (e.g., PowerGraph and GraphX). In this paper, we argue that skewed distribution in natural graphs also calls for differentiated processing on highdegree and low-degree vertices. We then introduce Power-Lyra, a new graph computation engine that embraces the best of both worlds of existing graph-parallel systems, by dynamically applying different computation and partitioning strategies for different vertices. PowerLyra further provides an efficient hybrid graph partitioning algorithm (hybrid-cut) that combines edge-cut and vertex-cut with heuristics. Based on PowerLyra, we design locality-conscious data layout optimization to improve cache locality of graph accesses during communication. PowerLyra is implemented as a separate computation engine of PowerGraph, and can seamlessly support various graph algorithms. A detailed evaluation on two clusters using graph-analytics and MLDM (machine learning and data mining) applications show that PowerLyra outperforms PowerGraph by up to 5.53X (from 1.24X) and 3.26X (from 1.49X) for real-world and synthetic graphs accordingly, and is much faster than other systems like GraphX and Giraph, yet with much less memory consumption. A porting of hybrid-cut to GraphX further confirms the efficiency and generality of PowerLyra. Copyright © 2015 ACM 978-1-4503-3238-5/15/04 $15.00.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：