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

Proceedings of the 2011 ACM Symposium on Applied computing

作者： Zhu, Min Yu, Miao Xia, Mingyuan Li, Bingyu Yu, Peijie Gao, Shang Qi, Zhengwei Liu, Liang Chen, Ying 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 IBM Research China China

ISBN: (纸本)9781450301138

Numerous operating systems have been designed to manage and control system resources with large and complicated features, so they need high security protection. However, previous security applications can not provide adequate protection due to the untrusted execution environment. Furthermore, these security strategies cannot support a universal cross-platform system security requirements. This paper presents VASP, a hypervisor based monitor which allows a trusted execution environment to monitor various malicious behaviors in the operating system. This is achieved by taking advantage of ×86 hardware virtualization and self-transparency technology, and providing a unified security protection to unmodified operating systems such as Linux and Windows. Our design is targeted at establishing a security monitor which resides completely outside of the target OS environment with a negligible overhead. According to the security analysis and performance experiment result, our approach can effectively protect applications and the kernel at a modest overhead of only 0.9% average in Windows XP and 2.6% average in Linux. © 2011 ACM.

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

Private cloud system based on BOINC with support for parallel and distributed simulation

Private cloud system based on BOINC with support for paralle...

引用

9th IEEE Int. Conf. on Dependable, Autonomic and Secure Comput., DASC 2011, incl. 9th Int. Conf. on Pervasive Intelligence and computing, PICom 2011, 9th Int. Symp. on Embedded computing, EmbeddedCom 2011, 1st Int. Conf. on Cloud and Green Comput.CGC

作者： Wu, Yihua Cao, Jian Li, Minglu Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China

ISBN: (纸本)9780769546124

Cloud computing provides an efficient way to expose computing capabilities as sophisticated services that can be accessed remotely. It eliminates the need for organizations to maintain extensive infrastructures. Parallel and distributed simulation over cloud will bring us not only the increased productivity and efficiency but also the lower barrier for usage. This paper introduces a private cloud system based on BOINC which supports parallel and distributed simulation. The design idea and implementation method of each component for our system is discussed in detail. © 2011 IEEE.

关键词： BOINC parallel and distributed simulation private cloud Parallel Lines design concept Distribute simulating Cloud computing

来源：评论

学校读者我要写书评

暂无评论

A distributed application component placement approach for cloud computing environment

A distributed application component placement approach for c...

引用

作者： Jin, Zhicheng Cao, Jian Li, Minglu Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China

ISBN: (纸本)9780769546124

In cloud computing environment, it is common for a multi-component application to be deployed into the IT infrastructure on demand. Although the Application Component Placement Problem or ACP has been studied both in the academy and industry for some years, so far these approaches all rely on a centralized node to collect the information about the network topology and hosts of the targeting environment so that it can make the optimized decision. In cloud environment, computing resources are shared by many applications and the IT infrastructure is dynamically changing, which makes collecting the dynamic information of the environment a more difficult task. In addition, when two or more clouds are involved in the deployment, there may exist privacy concern between different clouds so that a centralized approach cannot be applied. In this paper, we propose a distributed approach to solve the ACP problem. In our approach, we transform the ACP into a Distributed Constraint Optimization Problem or DCOP and solving the ACP becomes solving the DCOP. The detail of the algorithm and experiments are given. © 2011 IEEE.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

A power and performance management framework for virtualized server clusters

A power and performance management framework for virtualized...

引用

2011 IEEE/ACM International Conference on Green computing and Communications, GreenCom 2011

作者： Gao, Yongqiang Qi, Zhengwei Wu, Yubin Wang, Rui Liu, Liang Xu, Jitao Guan, Haibing Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai 200240 China IBM Research - China Beijing 100193 China

ISBN: (纸本)9780769544663

Nowadays, one of the most important goals of data center management is to maximize their profit by minimizing power consumption and service-level agreement (SLA) violations of hosted applications. System dynamics make it difficult to implement optimization in both aspects on shared infrastructures. A majority of existing works either focused on one aspect or applied models that are trained offline for application-specific workload. In addition, virtualization is being widely used in large-scale data centers to attain basic benefits like fault and performance isolation, and to improve system manageability. A key challenge that comes with virtualization is to dynamically provisioning resources for virtual machines and optimize their capacity for meeting service level objectives at the lowest possible cost. In this paper, we present a hierarchical management framework to assure application-level performance while minimizing power consumption for virtualized data centers. A novelty of the management framework is to combine control theory with linear programming technique. Empirical results show that the proposed framework brings substantial energy saving, while ensuring application performance. Especially, the integration of the performance controller and the energy optimizer results in an energy saving of 43% on our hardware testbed. © 2011 IEEE.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

A PSO-inspired multi-robot search algorithm independent of global information

A PSO-inspired multi-robot search algorithm independent of g...

引用

IEEE Swarm Intelligence Symposium, SIS

作者： Qian Zhu Alei Liang Haibing Guan School of Software and Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai China Department of Computer Science and Shanghai Key Laboratory of Scalable Computing and Systems Scalable Computing and Systems Shanghai China

This paper presents an algorithm that coordinates mobile robots to find the desired targets without depending on precise global information. We compare the abstract solution space in PSO and physical environment that robots will explore. According to similarities and differences between them, we introduce a PSO-inspired search algorithm to guide robots to complete the search mission. Moreover, a novel method based on Cartesian geometry for unifying relative coordinate systems will be adopted to improve system's robustness and efficiency.

关键词： Robot kinematics Robot sensing systems Particle swarm optimization Force Manganese

来源：评论

学校读者我要写书评

暂无评论

ONETA: Prior-free and Truthful Auctions with Adaptive Reserve Price for High Revenue in Dynamic Spectrum Access Networks

引用

电子学报(英文版) 2012年第2期21卷

作者： WU Xiaobing CHEN Guihai State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing 210093 China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai 200240 China

来源：评论

学校读者我要写书评

暂无评论

On Optimal Relay Placement for Urban Vehicular Networks

On Optimal Relay Placement for Urban Vehicular Networks

引用

IEEE International Conference on Communications Workshops

作者： Youchen Bao Yanmin Zhu Shanghai Jiao Tong University Shanghai Key Lab of Scalable Computing and Systems

ISBN: (纸本)9781612842325

This paper considers the problem of optimal relay placement for urban monitoring in wireless vehicular networks. The placement of relays is greatly impacted by vehicle distribution and mobility, which makes it difficult to determine the optimal locations. We theoretically prove that the relay placement problem (RPP) is NP-hard even when the vehicle traces are assumed as a priori knowledge. We first propose an approximate algorithm for the RPP with given vehicle traces (D-RPP). This algorithm is proved to achieve an approximation ratio of (1-1/e), where e is the natural logarithm base. To solve the RPP without a priori knowledge about future vehicle traces (N-RPP), we first show that there is strong regularity with vehicle mobility by entropy analysis. Then, we propose an algorithm for solving the N-RPP, which exploits regularity extracted from historical traces. Extensive simulations based on real trace datasets show that the D-RPP algorithm produces performance close to the optimum. keywords-wireless vehicular networks, wireless relays, optimal placement, approximation algorithms.

关键词： Wireless vehicular networks Wireless relays Optimal placement Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Performance of a Multi-channel MAC Protocol Implemented in Multi-robot System

Performance of a Multi-channel MAC Protocol Implemented in M...

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Feng Zhang Alei Liang Haibing Guan School of Software and Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai China Department of Computer Science and Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai China

In the wireless network, the throughput decreases rapidly with increasing the number of nodes while using single-channel communication simultaneously. Using multi-channel schemes is a solution of boosting throughput. In this paper, we present a protocol implementation, utilizing multiple channels in an autonomous multi-robot system which consists of several simple physical robots, in order to improve throughput. Each robot equipped with a single 802.15.4 radio transceiver which provides 16 channels for use. Our schemes employ a common control-channel and data channels. A simple approach based on RTS / CTS message at control-channel is used to dynamically allocate channels for robots in such distributed network. Some practical experiments were done to check whether control channel congestion can occur when the proposed protocols implemented in our robot systems. As a result, the proposed multi-channel protocol can provide a relatively stable and higher throughput than that obtained by using the CSMA with a single-channel, with increasing the number of simultaneous sending robots.

关键词： Throughput Media Access Protocol Multiaccess communication Robot sensing systems Receivers

来源：评论

学校读者我要写书评

暂无评论

An Improved Content-Based Data Dissemination In Human Contact-Based Network

An Improved Content-Based Data Dissemination In Human Contac...

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Chao Jiang Tao Peng Alei Liang Haibing Guan School of Software and Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai China Department of Computer Science and Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai China

Limited wireless communication devices carried by individuals make up human contact-based network. Such network often suffers from intermittent connectivity. This fact decreases successful ratio of information spreading and prolongs data delivery process. To get good performance on delivery ratio and transmission delay, providing effective data dissemination algorithm among large-scale human contact-based network is very important. In this paper, we develop an Improved Content-based Data Dissemination algorithm, which efficiently resolves data dissemination as data sources and interested receivers are agnostic of each other. In our algorithm, nodes exchange information according to respective interests with each other, simultaneously, exploit gathered history neighbor interests to dynamically adjust the probability of requesting messages not of interest to themselves and make distributed decisions on whether storing messages or not to benefit other nodes. Compared with the Epidemic algorithm and Opportunistic Content-Based Dissemination algorithm, simulation results have confirmed that our algorithm obtains the highest delivery ratio and almost the lowest transmission delay, as the buffer size and bandwidth are restricted.

关键词： Vectors Algorithm design and analysis Heuristic algorithms Delay Receivers Mobile communication History

来源：评论

学校读者我要写书评

暂无评论

A translation framework for executing the sequential binary code on CPU/GPU based architectures

Journal of Software

引用

Journal of Software 2011年第12 SPEC. ISSUE期6卷 2331-2340页

作者： Zhu, Erzhou Guan, Haibing Dong, Guoxing Yang, Yindong Yang, Hongbo Department of Computer Science and Engineering Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai China

The method of using DBT (dynamic binary translation) to execute the source ISAs binary code on target platforms has been perplexed by low overhead for many years. GPU as a many-core processor has tremendous computational power. Employing GPU as a coprocessor to parallel execute the hot spot of binary code hold a great promise of substantially reduce the overhead of DBT. This paper presents a novel translation framework for constructing the virtual execution environment aiming at accelerating the process of DBT on CPU/GPU based architectures. With parallelizable parts (hot spots) of binary code and their related information, the framework converts the sequential code into PTX form and executes them on GPUs. Under the framework, we need not to rewrite the source code, and the binary compatibility issues between different GPUs are also resolved properly. Experimental results on several programs from CUDA SDK Code Samples and Parboil Benchmark Suite show that the framework can significantly improve the performance, usually have 10X speedup on average compared to X86 native platforms. Especially, when the scale of input become larger, the performance becomes even better. © 2011 Academy Publisher.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：