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

22nd ACM International Symposium on High-Performance Parallel and Distributed computing, HPDC 2013

作者： Yu, Miao Zhang, Chao Qi, Zhengwei Yao, Jianguo Wang, Yin Guan, Haibing School of Software Shanghai Jiao Tong University Shanghai China HP Labs. Palo Alto CA United States Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai China Cylab Carnegie Mellon University United States

ISBN: (纸本)9781450319102

Fueled by the maturity of virtualization technology for Graphics Processing Unit (GPU), there is an increasing number of data centers dedicated to GPU-related computation tasks in cloud gaming. However, GPU resource sharing in these applications is usually poor. This stems from the fact that the typical cloud gaming service providers often allocate one GPU exclusively for one game. To achieve the efficiency of computational resource management, there is a demand for cloud computing to employ the multi-task scheduling technologies to improve the utilization of GPU. In this paper, we propose VGRIS, a resource management framework for Virtualized GPU Resource Isolation and Scheduling in cloud gaming. By leveraging the mature GPU paravirtualization architecture, VGRIS resides in the host through library API interception, while the guest OS and the GPU computing applications remain unmodified. In the proposed framework, we implemented three scheduling algorithms in VGRIS for different objectives, i.e., Service Level Agreement (SLA)-aware scheduling, proportional-share scheduling, and hybrid scheduling that mixes the former two. By designing such a scheduling framework, it is possible to handle different kinds of GPU computation tasks for different purposes in cloud gaming. Our experimental results show that each scheduling algorithm can achieve its goals under various workloads. © 2013 ACM.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

HYBit: A hybrid taint analyzing framework for binary programs

HYBit: A hybrid taint analyzing framework for binary program...

引用

4th International Conference on Advances in Swarm Intelligence, ICSI 2013

作者： Zhu, Erzhou Guan, Haibing Liang, Alei Xu, Rongbin Li, Xuejian Liu, Feng Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei 230601 China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai 200240 China

ISBN: (纸本)9783642387142

For the purpose of discovering security flaws in software, many dynamic and static taint analyzing techniques have been proposed. The dynamic techniques can precisely find the security flaws of the software;but it suffers from substantial runtime overhead. On the other hand, the static techniques require no runtime overhead;but it is often not accurate enough. In this paper, we propose HYBit, a novel hybrid framework which integrates dynamic and static taint analysis to diagnose the security flaws for binary programs. In the framework, the source binary is first analyzed by the dynamic taint analyzer;then, with the runtime information provided by its dynamic counterpart, the static taint analyzer can process the unexecuted part of the target program easily. Furthermore, a taint behavior filtration mechanism is proposed to optimize the performance of the framework. We evaluate our framework from three perspectives: efficiency, coverage, and effectiveness, and the results are encouraging. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

An energy-efficient and scalable eDRAM-based register file architecture for GPGPU 13

An energy-efficient and scalable eDRAM-based register file a...

引用

40th Annual International Symposium on Computer Architecture, ISCA 2013

作者： Jing, Naifeng Shen, Yao Lu, Yao Ganapathy, Shrikanth Mao, Zhigang Guo, Minyi Canal, Ramon Liang, Xiaoyao Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai China School of Microelectronics Shanghai Jiao Tong University Shanghai China Universitat Politecnica de Catalunya Barcelona Spain

ISBN: (纸本)9781450320795

The heavily-threaded data processing demands of streaming multiprocessors (SM) in a GPGPU require a large register file (RF). The fast increasing size of the RF makes the area cost and power consumption unaffordable for traditional SRAM designs in the future technologies. In this paper, we propose to use embedded-DRAM (eDRAM) as an alternative in future GPGPUs. Compared with SRAM, eDRAM provides higher density and lower leakage power. However, the limited data retention time in eDRAM poses new challenges. Periodic refresh operations are needed to maintain data integrity. This is exacerbated with the scaling of eDRAM density, process variations and temperature. Unlike conventional CPUs which make use of multi-ported RF, most of the RFs in modern GPGPU are heavily banked but not multi-ported to reduce the hardware cost. This provides a unique opportunity to hide the refresh overhead. We propose two different eDRAM implementations based on 3T1D and 1T1C memory cells. To mitigate the impact of periodic refresh, we propose two novel refresh solutions using bank bubble and bank walk-through. Plus, for the 1T1C RF, we design an interleaved bank organization together with an intelligent warp scheduling strategy to reduce the impact of the destructive reads. The analysis shows that our schemes present better energy efficiency, scalability and variation tolerance than traditional SRAM-based designs. Copyright 2013 ACM.

关键词： Static random access storage

来源：评论

学校读者我要写书评

暂无评论

VGRIS: virtualized GPU resource isolation and scheduling in cloud gaming 13

VGRIS: virtualized GPU resource isolation and scheduling in ...

引用

Proceedings of the 22nd international symposium on High-performance parallel and distributed computing

作者： Miao Yu Chao Zhang Zhengwei Qi Jianguo Yao Yin Wang Haibing Guan Shanghai Key Laboratory of Scalable Computing and Systems. School of Software Shanghai Jiao Tong University Shanghai China HP Labs Palo Alto USA

ISBN: (纸本)9781450319102

Fueled by the maturity of virtualization technology for Graphics Processing Unit (GPU), there is an increasing number of data centers dedicated to GPU-related computation tasks in cloud gaming. However, GPU resource sharing in these applications is usually poor. This stems from the fact that the typical cloud gaming service providers often allocate one GPU exclusively for one game. To achieve the efficiency of computational resource management, there is a demand for cloud computing to employ the multi-task scheduling technologies to improve the utilization of *** this paper, we propose VGRIS, a resource management framework for Virtualized GPU Resource Isolation and Scheduling in cloud gaming. By leveraging the mature GPU paravirtualization architecture, VGRIS resides in the host through library API interception, while the guest OS and the GPU computing applications remain unmodified. In the proposed framework, we implemented three scheduling algorithms in VGRIS for different objectives, i.e., Service Level Agreement (SLA)-aware scheduling, proportional-share scheduling, and hybrid scheduling that mixes the former two. By designing such a scheduling framework, it is possible to handle different kinds of GPU computation tasks for different purposes in cloud gaming. Our experimental results show that each scheduling algorithm can achieve its goals under various workloads.

关键词： GPU scheduling cloud gaming resource management

来源：评论

学校读者我要写书评

暂无评论

Efficient public key cryptosystem resilient to key leakage chosen ciphertext attacks 1

引用

Cryptographers' Track at the RSA Conference 2013, CT-RSA 2013

作者： Liu, Shengli Weng, Jian Zhao, Yunlei Dept. of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China Department of Computer Science Emergency Technology Research Center of Risk Evaluation and Prewarning on Public Network Security Jinan University China Software School Fudan University Shanghai 201203 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai China

ISBN: (数字)9783642360954

ISBN: (纸本)9783642360947

Leakage-resilient public key encryption (PKE) schemes are designed to resist "memory attacks", i.e., the adversary recovers the cryptographic key in the memory adaptively, but subject to constraint that the total amount of leaked information about the key is bounded by some parameter λ. Among all the IND-CCA2 leakage-resilient PKE proposals, the leakage-resilient version of the Cramer-Shoup cryptosystem (CS-PKE), referred to as the KL-CS-PKE scheme proposed by Naor and Segev in Crypto09, is the most practical one. But, the key leakage parameter λ and plaintext length m of KL-CS-PKE are subject to λ + m ≤ log q - ω(log κ), where κ is security parameter and q is the prime order of the group on which the scheme is based. Such a dependence between λ and m is undesirable. For example, when λ (resp., m) approaches to log q, m (resp., λ) approaches to 0. In this paper, we designed a new variant of CS-PKE that is resilient to key leakage chosen ciphertext attacks. Our proposal is λ ≤ log q - ω(log κ) leakage-resilient, and the leakage parameter λ is independent of the plaintext space that has the constant size q (exactly the same as that in CS-PKE). The performance of our proposal is almost as efficient as the original CS-PKE. As far as we know, this is the first leakage-resilient CS-type cryptosystem whose plaintext length is independent of the key leakage parameter, and is also the most efficient IND-CCA2 PKE scheme resilient to up to log q - ω(log κ) leakage. © 2013 Springer-Verlag.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

Dynamic monitoring of optimal locations in road network databases

引用

The VLDB Journal 2013年第5期23卷 697-720页

作者： Bin Yao Xiaokui Xiao Feifei Li Yifan Wu Department of Computer Science and Engineering Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai China School of Computer Engineering Nanyang Technological University Singapore Singapore School of Computing University of Utah Salt Lake City USA

Optimal location (OL) queries are a type of spatial queries that are particularly useful for the strategic planning of resources. Given a set of existing facilities and a set of clients, an OL query asks for a location to build a new facility that optimizes a certain cost metric (defined based on the distances between the clients and the facilities). Several techniques have been proposed to address OL queries, assuming that all clients and facilities reside in an $$L_p$$ space. In practice, however, movements between spatial locations are usually confined by the underlying road network, and hence, the actual distance between two locations can differ significantly from their $$L_p$$ distance. Motivated by the deficiency of the existing techniques, this paper presents a comprehensive study on OL queries in road networks. We propose a unified framework that addresses three variants of OL queries that find important applications in practice, and we instantiate the framework with several novel query processing algorithms. We further extend our framework to efficiently monitor the OLs when locations for facilities and/or clients have been updated. Our dynamic update methods lead to efficient answering of continuous optimal location queries. We demonstrate the efficiency of our solutions through extensive experiments with large real data.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Static program analysis assisted dynamic taint tracking for software vulnerability discovery

Static program analysis assisted dynamic taint tracking for ...

引用

作者： Zhang, Ruoyu Huang, Shiqiu Qi, Zhengwei Guan, Haibing School of Software Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University China School of Electronic Information and Electrical Engineering Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University China

The evolution of computer science has exposed us to the growing gravity of security problems and threats. Dynamic taint analysis is a prevalent approach to protect a program from malicious behaviors, but fails to provide any information about the code which is not executed. This paper describes a novel approach to overcome the limitation of traditional dynamic taint analysis by integrating static analysis into the system and presents framework SDCF to detect software vulnerabilities with high code coverage. Our experiments show that SDCF is not only able to provide efficient runtime protection by introducing an overhead of 4.16× based on the taint tracing technique, but is also capable of discovering latent software vulnerabilities which have not been exploited, and achieve code coverage of more than 90%. © 2011 Elsevier Ltd. All rights reserved.

关键词： Data flow analysis

来源：评论

学校读者我要写书评

暂无评论

An Algorithm for Cost-Effectively Storing Scientific Datasets with Multiple Service Providers in the Cloud

An Algorithm for Cost-Effectively Storing Scientific Dataset...

引用

IEEE International Conference on e-Science and Grid computing

作者： Dong Yuan Xiao Liu Lizhen Cui Tiantian Zhang Wenhao Li Dahai Cao Yun Yang Centre for Computing Engineering and Software Systems Swinburne University of Technology Melbourne Australia Shanghai Key Laboratory of Trustworthy Computing Software Engineering Institute of East China Normal University Shanghai China School of Computer Science and Technology Shandong University Jinan China School of Computer Science and Technology Anhui University Hefei China

The proliferation of cloud computing allows scientists to deploy computation and data intensive applications without infrastructure investment, where large generated datasets can be flexibly stored with multiple cloud service providers. Due to the pay-as-you-go model, the total application cost largely depends on the usage of computation, storage and bandwidth resources, and cutting the cost of cloud-based data storage becomes a big concern for deploying scientific applications in the cloud. In this paper, we propose a novel algorithm that can automatically decide whether a generated dataset should be 1) stored in the current cloud, 2) deleted and re-generated whenever reused or 3) transferred to cheaper cloud service for storage. The algorithm finds the trade-off among computation, storage and bandwidth costs in the cloud, which are three key factors for the cost of storing generated application datasets with multiple cloud service providers. Simulations conducted with popular cloud service providers' pricing models show that the proposed algorithm is highly cost-effective to be utilised in the cloud.

关键词： Bandwidth Cloud computing Computational modeling Algorithm design and analysis Finite element analysis Data models Educational institutions

来源：评论

学校读者我要写书评

暂无评论

High availability through output continuity

High availability through output continuity

引用

2012 IEEE International Conference on Cluster computing Workshops, Cluster Workshops 2012

作者： Ye, Wei Dong, Yaozu Ma, Ruhui Liang, Alei Guan, Haibing Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China Intel China Software Center Shanghai 200241 China

ISBN: (纸本)9780768548449

Virtual machine (VM) based state machine approaches, i.e. VM replication, provide high availability without source code modifications, unfortunately, existing VM replication approaches suffer from excessive replication overheads. On the other hand, machine state replication is an overly strong (and therefore less efficient) requirement for high availability in the networked client-server system. In this paper, we propose a generic and highly efficient high availability solution through output continuity. Output continuity considers a backup server as a valid replica as long as the responses generated so far are the same between the backup and primary servers, the server state is propagated from the primary server to the backup server if and only if the previous outputs from the backup and primary servers are different. © 2012 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Selective opening chosen ciphertext security directly from the DDH assumption

Selective opening chosen ciphertext security directly from t...

引用

6th International Conference on Network and System Security, NSS 2012

作者： Liu, Shengli Zhang, Fangguo Chen, Kefei Dept. of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China School of Information Science and Technology Sun Yat-sen University Guangzhou 510006 China State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai China

ISBN: (纸本)9783642346002

Chosen-ciphertext security has been well-accepted as a standard security notion for public key encryption. But in a multi-user surrounding, it may not be sufficient, since the adversary may corrupt some users to get the random coins as well as the plaintexts used to generate ciphertexts. The attack is named "selective opening attack". We study how to achieve full-fledged chosen-ciphertext security in selective opening setting directly from the DDH assumption. Our construction is free of chameleon hashing, since tags are created for encryptions in a flexible way to serve the security proof. © 2012 Springer-Verlag.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：