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

Timely virtual machine migration for pro-active fault tolerance

Timely virtual machine migration for pro-active fault tolera...

2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time distributed Computing Workshops, ISORCW 2011

作者： Polze, Andreas Tröger, Peter Salfner, Felix Operating Systems and Middleware Group Hasso-Plattner-Institute University of Potsdam Potsdam Germany Computer Organization and Communication Group Department of Computer Science Humboldt-University Berlin Berlin Germany

ISBN: (纸本)9780769543772

Next generation processor and memory technologies will provide tremendously increasing computing and memory capacities for application scaling. However, this comes at a price: Due to the growing number of transistors and shrinking structural sizes, overall system reliability of future server systems is about to suffer significantly. This makes reactive fault tolerance schemes less appropriate for server applications under reliability and timeliness constraints. We propose an architectural blueprint for managing server system dependability in a pro-active fashion, in order to keep service-level promises for response times and availability even with increasing hardware failure rates. We introduce the concept of anticipatory virtual machine migration that proactively moves computation away from faulty or suspicious machines. The migration decision is based on health indicators at various system levels that are combined into a global probabilistic reliability measure. Based on this measure, live migration techniques can be triggered in order to move computation to healthy machines even before a failure brings the system down. © 2011 IEEE.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

Puma: An aspect-oriented code analysis and manipulation framework for C and C++

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2011年 6580卷 141-162页

作者： Urban, Matthias Lohmann, Daniel Spinczyk, Olaf Pure-Systems GmbH Magdeburg Germany Computer Science 4 Distributed Systems and Operating Systems Friedrich-Alexander-University Erlangen Nuremberg Germany Computer Science 12 Embedded System Software Technische Universität Dortmund Germany

ISBN: (纸本)9783642220302

Puma is a framework for the development of applications that analyze and optionally transform C or C++ source code. It supports all standard ISO C and C++ language features as well as many language extensions of the GNU Compiler Collection and Microsoft Visual C++. Aspects played an important role during the design and implementation of the framework. It is written in the AspectC++ language. By employing AOSD concepts we gained clean separation of concerns and, thereby, very good configurability and extensibility. All these -ilities are of vital importance for our project, because the available manpower for maintenance tasks is limited. This paper describes the tools, which we used for the development, the principles behind the design of Puma, and its implementation. Even though criticized during the last few years, our experiences show that aspect technology has clear benefits for the development of complex industrial applications. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： Visual languages

来源：评论

学校读者我要写书评

暂无评论

Reservoir Production Settings Optimization under Model Uncertainties

Reservoir Production Settings Optimization under Model Uncer...

引用

2011 International Conference on Fuzzy systems and Neural Computing (FSNC 2011)

作者： E.Nwankwor A.K Nagar Intelligent and Distributed Systems Laboratory Department of Computer Science Liverpool Hope University Intelligent and Distributed Systems Laboratory Department of Computer Science University of Liverpool

Secondary recovery by engineered drives is a popular production process in the recovery of oil from subsurface reservoirs. It is mainly achieved by waterflooding technology – which involves the inject

关键词： Optimal control robust optimization reservoir simulation oil recovery waterflooding

来源：评论

学校读者我要写书评

暂无评论

Exchanging data agreements in the DaaS model

Exchanging data agreements in the DaaS model

引用

2011 IEEE Asia-Pacific Services Computing Conference, APSCC 2011

作者： Truong, Hong-Linh Dustdar, Schahram Götze, Joachim Fleuren, Tino Müller, Paul Tbahriti, Salah-Eddine Mrissa, Michael Ghedira, Chirine Distributed Systems Group Vienna University of Technology Austria Department of Computer Science University of Kaiserslautern Germany Université de Lyon CNRS UMR5205 France

ISBN: (纸本)9780769546247

Rich types of data offered by data as a service (DaaS) in the cloud are typically associated with different and complex data concerns that DaaS service providers, data providers and data consumers must carefully examine and agree with before passing and utilizing data. Unlike service agreements, data agreements, reflecting conditions established on the basis of data concerns, between relevant stakeholders have got little attention. However, as data concerns are complex and contextual, given the trend of mixing data sources by automated techniques, such as data mashup, data agreements must be associated with data discovery, retrieval and utilization. Unfortunately, exchanging data agreements so far has not been automated and incorporated into service and data discovery and composition. In this paper, we analyze possible steps and propose interactions among data consumers, DaaS service providers and data providers in exchanging data agreements. Based on that, we present a novel service for composing, managing, analyzing data agreements for DaaS in cloud environments and data marketplaces. © 2011 IEEE.

关键词： E-discovery Automated recording Data sources data types

来源：评论

学校读者我要写书评

暂无评论

EMMON: A WSN system architecture for large scale and dense real-time embedded monitoring

EMMON: A WSN system architecture for large scale and dense r...

引用

2011 IFIP 9th International Conference on Embedded and Ubiquitous Computing, EUC 2011

作者： Tennina, Stefano Bouroche, Mélanie Braga, Pedro Gomes, Ricardo Alves, Mario Mirza, Farrukh Ciriello, Vincenzo Carrozza, Gabriella Oliveira, Pedro Cahill, Vinny Porto Portugal Distributed Systems Group Department of Computer Science Trinity College Dublin Ireland Critical Software Coimbra Portugal SESM Scarl Giugliano in Campania Naples Italy

ISBN: (纸本)9780769545523

Wireless sensor networks (WSNs) have attracted growing interest in the last decade as an infrastructure to support a diversity of ubiquitous computing and cyber-physical systems. However, most research work has focused on protocols or on specific applications. As a result, there remains a clear lack of effective, feasible and usable system architectures that address both functional and non-functional requirements in an integrated fashion. In this paper, we outline the EMMON system architecture for large-scale, dense, real-time embedded monitoring. EMMON provides a hierarchical communication architecture together with integrated middleware and command and control software. It has been designed to use standard commercially-available technologies, while maintaining as much flexibility as possible to meet specific applications requirements. The EMMON architecture has been validated through extensive simulation and experimental evaluation, including a 300+ node test-bed, which is, to the best of our knowledge, the largest single-site WSN test-bed in Europe to date. © 2011 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Modeling and Analysis of Sharing Ratio Enforcement in Private BitTorrent Communities

Modeling and Analysis of Sharing Ratio Enforcement in Privat...

引用

IEEE International Conference on Communications (ICC)

作者： Adele L. Jia Lucia D'Acunto Michel Meulpolder Johan A. Pouwelse Parallel and Distributed Systems Group Department of Computer Science Delft University of Technology Netherlands

Providing incentives for user contribution has been one of the primary design goals of Peer-to-Peer systems. The newly-emerged BitTorrent private communities adopt Sharing Ratio Enforcement (SRE) on top of BitTorrent's incentive mechanism, Tit-For-Tat, in order to strictly enforce a minimum contribution a member has to provide, in relation to the amount of service it has received. In this paper, we provide a theoretical model to analyze 1) how SRE provides seeding incentives, and 2) how SRE influences the download performance in the system. Specifically, we study the influence of the SRE threshold (i.e., the minimum sharing ratio requirement) and the bandwidth heterogeneity of the peers in the system. In our analysis, we assume users to be rational, i.e., peers seed only the minimum amount required by SRE, and we show that the download performance as predicted by our model represents a lower bound for the actual performance that can be reached in a BitTorrent private community. Hence, following our model, community administrators can predict the minimum performance level their systems will be able to reach.

关键词： Thin film transistors Communities Analytical models Bandwidth Peer to peer computing Mathematical model Steady-state

来源：评论

学校读者我要写书评

暂无评论

Fast download but eternal seeding: The reward and punishment of Sharing Ratio Enforcement

Fast download but eternal seeding: The reward and punishment...

引用

International Conference on Peer-to-Peer Computing

作者： Adele L. Jia Rameez Rahman Tamás Vinkó Johan A. Pouwelse Dick H.J. Epema Parallel and Distributed Systems Group Department of Computer Science Delft University of Technology Netherlands

Many private BitTorrent communities employ Sharing Ratio Enforcement (SRE) schemes to incentivize users to contribute their upload resources. It has been demonstrated that communities that use SRE are greatly oversupplied, i.e., they have much higher seeder-to-leecher ratios than communities in which SRE is not employed. The first order effect of oversupply under SRE is a positive increase in the average downloading speed. However, users are forced to seed for extremely long times to maintain adequate sharing ratios to be able to start new downloads. In this paper, we propose a fluid model to study the effects of oversupply under SRE, which predicts the average downloading speed, the average seeding time, and the average upload capacity utilization for users in communities that employ SRE. We notice that the phenomenon of oversupply has two undesired negative effects: a) Peers are forced to seed for long times, even though their seeding efforts are often not very productive (in terms of low upload capacity utilization); and b) SRE discriminates against peers with low bandwidth capacities and forces them to seed for longer durations than peers with high capacities. To alleviate these problems, we propose four different strategies for SRE, which have been inspired by ideas in social sciences and economics. We evaluate these strategies through simulations. Our results indicate that these new strategies release users from needlessly long seeding durations, while also being fair towards peers with low capacities and maintaining high system-wide downloading speeds.

关键词： Communities Steady-state Peer to peer computing Bandwidth IEEE Communications Society Analytical models Thin film transistors

来源：评论

学校读者我要写书评

暂无评论

A comparison of Wireless Fidelity (Wi-Fi) fingerprinting techniques

A comparison of Wireless Fidelity (Wi-Fi) fingerprinting tec...

引用

2011 International Conference on ICT Convergence, ICTC 2011

作者： Del Mundo, Lersan B. Ansay, Rafael Lean D. Festin, Cedric Angelo M. Ocampo, Roel M. Networks and Distributed Systems Lab. Department of Computer Science University of the Philippines Diliman Quezon City 1101 Philippines Computer Networks Lab. Electrical and Electronics Engineering Institute University of the Philippines Diliman Quezon City 1101 Philippines

ISBN: (纸本)9781457712678

Among several techniques proposed for indoor positioning using IEEE 802.11 Wireless Fidelity (Wi-Fi) based networks, those that rely on fingerprinting have been demonstrated to outperform those based on lateration, angulation, and cell of origin in terms of accuracy. We compare and evaluate three Wi-Fi fingerprinting techniques that use the K-Nearest Neighbor (k-NN), Naive Bayes Classifier (NBC) and Support Vector Machine (SVM) algorithms. Our experiments show that SVM-based fingerprinting outperformed both k-NN and NBC-based fingerprinting, achieving accuracies of 2 meters or better within our testbed. © 2011 IEEE.

关键词： Indoor positioning systems

来源：评论

学校读者我要写书评

暂无评论

Improving location privacy in mix-zones for VANETs

Improving location privacy in mix-zones for VANETs

引用

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： Antonio M. Carianha Luciano Porto Barreto George Lima Distributed Systems Laboratory (LaSiD) Computer Science Department Federal University of Bahia Salvador Bahia Brazil

Providing location privacy to users is one of the important issues that must be addressed in Vehicular Ad-Hoc Networks. Recent solutions address it by using cryptographic “mix-zones”, which are anonymizing regions where nodes change their temporary identities (pseudonym) without being tracked. However, existing solutions are vulnerable to internal attackers since within a mix-zone messages are encrypted using a group secret key. In this paper we improve location privacy of mix-zones via extensions to the CMIX protocol. By carrying out extensive simulations, we investigate and compare the effective location privacy provided by the proposed approach.

关键词： Vehicles Cryptography Roads Privacy Protocols Kinematics Veins

来源：评论

学校读者我要写书评

暂无评论

NetworkCloudSim: Modelling Parallel Applications in Cloud Simulations

NetworkCloudSim: Modelling Parallel Applications in Cloud Si...

引用

IEEE International Conference on Utility and Cloud Computing (UCC)

作者： Saurabh Kumar Garg Rajkumar Buyya Cloud Computing and Distributed Systems (CLOUDS) Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia

As interest in adopting Cloud computing for various applications is rapidly growing, it is important to understand how these applications and systems will perform when deployed on Clouds. Due to the scale and complexity of shared resources, it is often hard to analyze the performance of new scheduling and provisioning algorithms on actual Cloud test beds. Therefore, simulation tools are becoming more and more important in the evaluation of the Cloud computing model. Simulation tools allow researchers to rapidly evaluate the efficiency, performance and reliability of their new algorithms on a large heterogeneous Cloud infrastructure. However, current solutions lack either advanced application models such as message passing applications and workflows or scalable network model of data center. To fill this gap, we have extended a popular Cloud simulator (CloudSim) with a scalable network and generalized application model, which allows more accurate evaluation of scheduling and resource provisioning policies to optimize the performance of a Cloud infrastructure.

关键词： Computational modeling Data models Cloud computing Network topology Bandwidth Processor scheduling Virtual machining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：