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

Eighth ieee international symposium on object-oriented real-time distributed computing, ISORC 2005

作者： Ezhilchelvan, Paul Hélary, Jean-Michel Raynal, Michel Dept of Computing Science University of Newcastle NE1 7RU United Kingdom IRISA Campus de Beaulieu 35042 Rennes Cedex France

ISBN: (纸本)0769523560

this paper is on the construction of a fault-tolerant and responsive server subsystem in an application context where the subsystem is accessed through an asynchronous network by a large number of clients. the server is made fault-tolerant by the Triple Modular Redundancy (TMR) technique: at least two server processes behave correctly, while the third one can behave arbitrarily. An essential requirement for process replication is that the client inputs be delivered to server replicas for processing in an identical order. Moreover, in order to cope with process' memory requirement, a time bound constraint is imposed: no client input can stay in the local memory of a server process more than Σ units of time. Based on known technologies, two assumptions are made: (1) the network delivers a given client input to any two server processes within a known bounded time (D), and (2), there is an Ordered timed Atomic Broadcast protocol built on top of the TMR system with timeliness Δ. the paper presents two results. the first is a protocol that delivers an ordered stream of client inputs, such that every client input is delivered exactly once to each correct server, thus eliminating redundant verification. It works under the assumption Σ > D + Δ. the second is an impossibility result, namely there can be no ordering protocol when Σ < D + Δ, where Δ is the minimum timeliness of any reliable broadcast protocol that can be implemented on top of the TMR server (Δ &le Δ).

关键词： Servers

来源：评论

学校读者我要写书评

暂无评论

the real-time Systems Compiler: migrating event-triggered systems to time-triggered systems

引用

SOFTWARE-PRACTICE & EXPERIENCE 2011年第12期41卷 1491-1515页

作者： Scheler, Fabian Schroeder-Preikschat, Wolfgang Univ Erlangen Nurnberg Dept Comp Sci Distributed Syst & Operating Syst 4 Erlangen Germany

In this paper, we present a prototype of the real-time Systems Compiler (RTSC). the RTSC is a compiler-based tool that enables the migration from event-triggered to time-triggered real-time systems. this is achieved by replacing the real-time systems architecture of a given real-time system. the real-time systems architecture governs the structural properties of the white-box view of a real-time system: how are tasks attached to events and how are dependencies between different tasks implemented. the RTSC uses an abstraction called Atomic Basic Blocks (ABBs) to hide the real-time systems architecture and capture all relevant dependencies of an event-triggered system in a global ABB-graph. the RTSC automatically extracts that ABB-graph from an event-triggered real-time system given as source code, transforms that ABB-graph appropriately, and maps it to a statically computed schedule that could be executed by standard time-triggered real-time operating systems. Important temporal properties of the physical environment of the real-time system needed for that transformation are stored in a system model provided as additional input to the RTSC. Furthermore, we demonstrate the applicability of our approach and the operation of our prototype by transforming an event-triggered control application into a time-triggered equivalent. Copyright (C) 2011 John Wiley & Sons, Ltd.

关键词： real-time systems time-triggered systems event-triggered systems

来源：评论

学校读者我要写书评

暂无评论

Research of context situation awareness technology

Research of context situation awareness technology

引用

作者： Shi, Dianxi Wu, Zhendong Ding, Bo Yan, Huining National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769546698

Context situation, which means a snapshot of the status of the real world, is formed by integrating a large amount of contexts collected from various resources. How to get the context situation and use the situation to provide better services is a challenging issue. In this paper, we focused on this challenge on the basis of the mobile cloud computing architecture. An abstract model is proposed in this paper to uniformly collect the context and send them to cloud. A rule-based large-scale context aggregation algorithm is also proposed which utilizes the MapReduce computing paradigm. Finally, a large-scale context management framework based on the abstract model and the context aggregation algorithm is proposed, and a real-time traffic demo is implemented to verify the validity of the framework. © 2012 ieee.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Design space exploration of object caches with cross-profiling

Design space exploration of object caches with cross-profili...

引用

作者： Schoeberl, Martin Binder, Walter Villazón, Alex Department of Informatics and Mathematical Modeling Technical University of Denmark Denmark Faculty of Informatics University of Lugano Switzerland Universidad Privada Boliviana Bolivia

ISBN: (纸本)9780769543680

To avoid data cache trashing between heap-allocated data and other data areas, a distinct object cache has been proposed for embedded real-time Java processors. this object cache uses high associativity in order to statically track different object pointers for worst-case execution-time analysis. However, before implementing such an object cache, an empirical analysis of different organization forms is needed. We use a cross-profiling technique based on aspect-oriented programming in order to evaluate different object cache organizations with standard Java benchmarks. From the evaluation we conclude that field access exhibits some temporal locality, but almost no spatial locality. therefore, filling long cache lines on a miss just introduces a high miss penalty without increasing the hit rate enough to make up for the increased miss penalty. For an object cache, it is more efficient to fill individual words within the cache line on a miss. © 2011 ieee.

关键词： Aspect oriented programming

来源：评论

学校读者我要写书评

暂无评论

A QoS-negotiable middleware system for reliably multicasting messages of arbitrary size

A QoS-negotiable middleware system for reliably multicasting...

引用

9th ieee international symposium on object and Component-oriented real-time distributed computing

作者： Di Ferdinando, Antonio Ezhilchelvan, Paul Dales, Michael Crowcroft, Jon Univ Newcastle Sch Comp Sci Newcastle Upon Tyne NE1 7RU Tyne & Wear England Intel Res Lab Cambridge CB3 0FD England Univ Cambridge Comp Lab Cambridge CB2 1TN England

ISBN: (纸本)076952561X

e-Business organizations commonly trade services together with Quality of Service (QoS) guarantees that are often dynamically agreed upon prior to service provisioning. Violating agreed QoS levels incurs penalties and hence service providers agree to QoS requests only after assessing the resource availability. thus the system should, in addition to providing the services, (i) monitor resource availability, (ii) assess the affordability of a requested QoS level, and (iii) adapt autonomically to QoS perturbations which might undermine any assumptions made during assessment. this paper will focus on building such a system for reliably multicasting messages of arbitrary size over a loss-prone network of arbitrary topology such as the Internet. the QoS metrics of interest will be reliability, latency and relative latency. We meet the objectives (i) - (iii) by describing a network monitoring scheme, developing two multicast protocols, and by analytically estimating the achievable latencies and reliability in terms of controllable protocol parameters. Protocol development involves extending in two distinct ways an existing QoS-adaptive protocol designed for a single packet. Analytical estimation makes use of experimentally justified approximations and their impact is evaluated through simulations. As the protocol extension approaches are complementary in nature, so are the application contexts they are found best suited to;e.g., one is suited to small messages while the other to large messages.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

the NetLogger methodology for high performance distributed systems performance analysis 7

The NetLogger methodology for high performance distributed s...

引用

7th international symposium on High Performance distributed computing

作者： Tierney, B Johnston, W Crowley, B Hoo, G Brooks, C Gunter, D Univ Calif Berkeley Lawrence Berkeley Lab Comp Sci Directorate Berkeley CA 94720 USA

ISBN: (纸本)0818685794

We describe a methodology that enables the real-time diagnosis of performance problems in complex high-performance distributed systems. the methodology includes tools for generating precision event logs that can be used to provide detailed end-to-end application and system level monitoring;a Java agent-based system for managing the large amount of lagging data;and tools for visualizing the log data and real-time state of the distributed system. We developed these tools for analyzing a high-performance distributed system centered around the transfer of large amounts of data at high speeds from a distributed storage sewer to a remote visualization client. However this methodology should be generally applicable to any distributed system. this methodology called NetLogger has proven invaluable for diagnosing problems in networks and in distributed systems code. this approach is novel in that it combines network, host, and application-level monitoring, providing a complete view of the entire system.

关键词： Data visualization

来源：评论

学校读者我要写书评

暂无评论

A Parallel Framework for object Detection and Recognition for Secure Vehicle Parking 17

A Parallel Framework for Object Detection and Recognition fo...

引用

2015 ieee 17th international Conference on High Performance computing and Communications (HPCC)

作者： Mahmood, Zahid Khan, Muhammad Usman Shahid Jawad, Muhammad Khan, Samee U. Yang, Laurence T. North Dakota State Univ Dept Elect & Comp Engn Fargo ND 58102 USA St Francis Xavier Univ Dept Comp Sci Antigonish NS B2G 2W5 Canada

ISBN: (纸本)9781479989379

Image analytics, biometrics access control, security, and surveillance applications utilize complex machine learning and computer vision algorithms, such as face detection and recognition. Speedup and accuracy are two important factors that need to be addressed in all such complex applications. Parallel computing breaks down the complex tasks into discrete fragments to be solved concurrently on multiple processors. the parallel computing procedure significantly reduces the execution time with improved speedup. this paper presents a parallel framework for object detection and recognition for a secure vehicle parking. the proposed framework is divided in to three steps: (1) vehicle detection at the parking entry junction, (2) driver's face detection, and (3) identification of driver's face from the huge database of stored facial images. On successful identification of authorized person, vehicle is allowed to enter in the parking-lot. the adaptive boosting algorithm is used for vehicle and face detection, while Eigenfaces based approach is employed for face recognition. Moreover, the scalability comparison of parallely executed driver face recognition algorithm indicates high speedup compared to serial execution. Furthermore, the results of the proposed framework reveal promising performance and encourage outcomes to be deployed in real-time at entrance/exits of the public/private vehicle parking areas.

关键词： Eigenfaces Face Recognition Haar Classifiers Parallel Processing

来源：评论

学校读者我要写书评

暂无评论

distributed resource selection in grid using decision theory 07

Distributed resource selection in grid using decision theory

引用

7th ieee international symposium on Cluster computing and the Grid

作者： Nassif, Lilian Noronha Nogueira, Jose Marcos de Andrade, Flavio Vinicius Univ Fed Minas Gerais Belo Horizonte MG Brazil

ISBN: (纸本)9780769528335

Grid technology allows resource sharing among several entities, but selecting the best resource to run a specific job remains one of its main problems. the challenges for the best resource selection involve analysis of several factors such as prediction time to run a job, access restriction to resources, and cost to use resources. this paper presents a resource selection model using decision theory for combining these influential factors in the resource selection process. the model is based on a multi-attribute utility function that maximizes the user preference. this model forms part of a multi-agent system deploying distributed and parallel processing for job execution prediction, access policy verification, and resource selection models. All models of this paper were verified through experiments using real machines. they have presented appropriate functional behaviors and positive performance results.

关键词： Decision theory Predictive models Multiagent systems Costs Uncertainty Resource management Diversity reception Error probability Parallel processing Middleware

来源：评论

学校读者我要写书评

暂无评论

the real-time Systems Compiler: migrating event-triggered systems to time-triggered systems

The Real-Time Systems Compiler: migrating event-triggered sy...

引用

13th ieee international symposium on object/Component/Service-oriented real-time distributed computing (ISORC)

作者： Scheler, Fabian Schroeder-Preikschat, Wolfgang Univ Erlangen Nurnberg Dept Comp Sci Distributed Syst & Operating Syst 4 Erlangen Germany

关键词： real-time systems time-triggered systems event-triggered systems

来源：评论

学校读者我要写书评

暂无评论

Scaling Service-oriented Applications into Geo-distributed Clouds

Scaling Service-oriented Applications into Geo-distributed C...

引用

ieee 7th international symposium on Service-oriented System Engineering (SOSE)

作者： Zhu, Jieming Zheng, Zibin Zhou, Yangfan Lyu, Michael R. Chinese Univ Hong Kong Dept Comp Sci & Engn Shatin Hong Kong Peoples R China Chinese Univ Hong Kong Shenzhen Res Inst Shenzhen Peoples R China Natl Univ Def Technol Sch Comp Sci Changsha Peoples R China

ISBN: (纸本)9780769549446;9781467356596

With the significant prevalence of cloud computing, more and more data centers are built to host and deliver various online services. However, a key challenge faced by service providers is how to scale their applications into geo-distributed data centers to improve application performance as well as minimizing the operational cost. While most existing deployment methods ignore the service dependencies in an application, this paper proposes a general dynamic service deployment framework to bridge this gap, in which a deployment manager and a local scheduler are designed to optimize data center selection and auto-scale the service instances in each data center respectively. More specifically, we formulate the deployment problem across multiple data centers as a compact minimization model, which can be solved efficiently by a genetic algorithm. To evaluate the performance of our approach, extensive experiments are conducted based on a large-scale real-world latency dataset. the experimental results show that our approach substantially outperforms the other existing methods.

关键词： Dynamic deployment service-oriented application geo-distributed clouds genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：