We address the problem of distributed filtering in a wireless sensor network and develop distributed approximations of three variants of the ensemble Kalman filter. We express the update equations in an alternative in...
详细信息
ISBN:
(纸本)9781479914814
We address the problem of distributed filtering in a wireless sensor network and develop distributed approximations of three variants of the ensemble Kalman filter. We express the update equations in an alternative information form in order to formulate a distributed measurement update mechanism. the distributed filters use randomized gossip to reach consensus on the statistics needed to perform an update. simulation results suggest that in the case of linear measurements and high-dimensional nonlinear measurements (with measurement model parameters known network-wide) with nonlinear state dynamics the proposed schemes achieve accuracy comparable to state-of-the-art distributed filters while significantly reducing the communication overhead.
When dealing with communication-intensive systems, hardware/software co-simulation usually either requires the communication to be simulated with a uniformly low level of detail or it performs poorly. this problem man...
详细信息
ISBN:
(纸本)0818680644
When dealing with communication-intensive systems, hardware/software co-simulation usually either requires the communication to be simulated with a uniformly low level of detail or it performs poorly. this problem manifests itself even more strongly when considering geographically distributed co-simulation where designers take advantage of proprietary component simulation models that are made available over the Internet. In such systems, much of the communication can potentially occur over the Internet, with even more expensive and slower communication primitives. this paper presents a technique: called ''selective focus'', and a Java based tool which allow communication to be represented at various levels of abstraction thus giving the designer the ability to dynamically optimize inter-module communications and improve the performance of the co-simulation.
In this paper we present the application of an approach for the performance prediction of message passing programs, to a PVM code implementing an iterative solver based on the Successive OverRelaxation method. the app...
详细信息
Generalized proximity detection for moving objects in a logically correct parallel discrete-event simulation is an interesting and fundamentally challenging problem. Determining who can see whom in a manner that is fu...
详细信息
ISBN:
(纸本)1565550277
Generalized proximity detection for moving objects in a logically correct parallel discrete-event simulation is an interesting and fundamentally challenging problem. Determining who can see whom in a manner that is fully scalable in terms of CPU usage, number of messages, and memory requirements is highly non-trivial. A new scalable approach has been developed to solve this problem. this algorithm, called the Distribution List, has been designed and tested using the object-oriented Synchronous parallel Environment for Emulation and Discrete-Event simulation (SPEEDES) operating system. Preliminary results show that the Distribution List algorithm achieves excellent parallel performance.
distributed systems deliver a cost-effective and scalable solution to the increasing performance intensive applications by utilizing several shared resources. Gang scheduling is considered to be an efficient time-spac...
详细信息
distributed systems deliver a cost-effective and scalable solution to the increasing performance intensive applications by utilizing several shared resources. Gang scheduling is considered to be an efficient time-space sharing scheduling algorithm for parallel and distributed systems. In this paper we examine the performance of scheduling strategies of jobs which are bags of independent gangs in a heterogeneous system. A simulation model is used to evaluate the performance of bag of gangs scheduling in the presence of high priority jobs implementing migrations. the simulation results reveal the significant role of the implemented migration scheme as a load balancing factor in a heterogeneous environment. Another significant aspect of implementing migrations presented in this paper is the reduction of the fragmentation caused in the schedule by gang scheduled jobs and the alleviation of the performance impact of the high priority jobs. (C) 2010 Elsevier Inc. All rights reserved.
A delivery problem which reduces to the NP-complete set-partitioning problem is investigated. the sequential and parallel simulated annealing algorithms to solve the delivery problem are discussed. the objective is to...
详细信息
Utilizing desktop grid infrastructures is challenging for parallel discrete event simulation (PDES) codes due to characteristics such as inter-process messaging, restricted execution, and overall lower concurrency tha...
详细信息
ISBN:
(纸本)9781424415595
Utilizing desktop grid infrastructures is challenging for parallel discrete event simulation (PDES) codes due to characteristics such as inter-process messaging, restricted execution, and overall lower concurrency than typical volunteer computing projects. the Aurora2 system uses an approach that simultaneously provides both replicated execution support and scalable performance of PDES applications through public resource computing. this is accomplished through a multi-threaded distributed back-end system, low overhead communications middleware, and an efficient client implementation. this paper describes the Aurora2 architecture and issues pertinent to PDES executions in a desktop grid environment that must be addressed when distributing back-end services across multiple machines. We quantify improvement over the first generation Aurora system through a comparative performance study detailing PDES programs with various scalability characteristics for execution over desktop grids.
the paper describes a randomized distributed enumeration algorithm which (in contrast to deterministic solutions) works for all network topologies and with fully asynchronous communication. the algorithm correctness a...
详细信息
the event horizon is a very important concept that is useful for bothparallel and sequential discrete-event simulations. By exploiting the event horizon, parallelsimulations can process events in a manner that is ri...
详细信息
ISBN:
(纸本)9781565550278
the event horizon is a very important concept that is useful for bothparallel and sequential discrete-event simulations. By exploiting the event horizon, parallelsimulations can process events in a manner that is risk-free (i.e., no antimessages) in adaptable “breathing” time cycles with variable time widths. Additionally, exploiting the event horizon can greatly reduce the event list management overhead that is common to virtually all discrete-event *** paper develops an analytic model describing the event horizon from first principles using equilibrium considerations and the hold model (where each event, when consumed, generates a single new event with future-time statistics described by a known probability function). Exponential and Beta-density functions are used to verify the mathematics presented in this paper.
In this paper we make an analogy between the time that storage must be maintained in a optimistic simulation and the blocking time in a conservative simulation. By exploring this analogy, we design two new Global Virt...
ISBN:
(纸本)1565550277
In this paper we make an analogy between the time that storage must be maintained in a optimistic simulation and the blocking time in a conservative simulation. By exploring this analogy, we design two new Global Virtual Time (GVT) protocols for Time Warp systems. the first protocol is based on null message clock advancement in conservative approaches. Our main contribution is a new protocol inspired by Misra's circulating marker scheme for deadlock recovery. It is simple enough to be implemented in hardware, takes no overhead in the normal path, can be made to work over non-FIFO links, and its overhead can be dynamically tuned based on computational load.
暂无评论