In previous work we presented the DTRD algorithm, an optimistic synchronisation algorithm for parallel discrete event simulation of multi-agent systems, and showed that it outperforms Time Warp and time windows on ran...
详细信息
Systems Biology is aimed at analyzing the behavior and interrelationships of biological systems and is characterized by combining experimentation, theory, and computation. Multi-level models describe systems at differ...
详细信息
ISBN:
(纸本)0769526977
Systems Biology is aimed at analyzing the behavior and interrelationships of biological systems and is characterized by combining experimentation, theory, and computation. Multi-level models describe systems at different levels of organization and abstraction. To apply them in systems biology implies typically that concentration changes as well as the discrete behavior of single entities and their interactions need to be taken into account in modeling and simulation. A variety of approaches have been developed offering specific perspectives on cellular systems in modeling and simulation. We will explore how far multi-level aspects are already supported and identify challenges yet to be met.
A master/worker paradigm for executing large-scale parallel discrete event simulation programs over network-enabled computational resources is proposed and evaluated. In contrast to conventional approaches to parallel...
详细信息
In this work we present a novel architecture for distributed computing in a peer-to-peer network. In particular, we realize the Paderborn University BSP-based Web Computing Library (PUBWCL), which was formerly used as...
详细信息
ISBN:
(纸本)0769526977
In this work we present a novel architecture for distributed computing in a peer-to-peer network. In particular, we realize the Paderborn University BSP-based Web Computing Library (PUBWCL), which was formerly used as a centralized client-server architecture for scheduling and load balancing, as a pure peer-to-peer system. By using distributed heterogeneous hash tables (DHHT), our architecture-features scheduling and load balancing of tightly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style with a minimal number of migrations. Furthermore, our architecture is capable of heterogeneous BSP programs whereas the former version of PUBWCL could only handle homogeneous BSP programs.
simulation performance is dominated by lookahead in null message-based conservative time management of parallel discrete event simulation (PDES). This paper proposes a scheme for software execution path prediction to ...
详细信息
In optimistically synchronized parallel discrete event simulators, unlimited optimism can lead to excessive rollbacks and simulation thrashing. Artificially throttling the simulation is a well-known technique for impr...
详细信息
ISBN:
(纸本)0769526977
In optimistically synchronized parallel discrete event simulators, unlimited optimism can lead to excessive rollbacks and simulation thrashing. Artificially throttling the simulation is a well-known technique for improving the performance by avoiding the effects of uncontrolled optimism. simulation throttling has been attempted based on time or event Count beyond Global Virtual Time (GVT). In this paper, we carry Out a simulation study of both approaches within Time Warp as well as Breathing Time Warp (BTW) synchronization algorithms in the context of the SPEEDES simulation framework. We discover that anomalies arise when limiting optimism based on event count (as is the case in the default SPEEDES BTW algorithm) and that this gives rise to forced rollbacks that generally do not arise without simulation throttling. We implement a version of BTW that limits optimism based on time beyond GVT and show that it outperforms BTW for two large scale applications. We discuss initial experiences with adaptively estimating the optimism limit.
parallelsimulation techniques are designed to increase simulation model performance by exploiting model concurrency. Unfortunately, designing efficient parallelsimulations is not always an easy task. Most existing t...
详细信息
The Service Oriented Architecture (SOA) is used to support loosely-coupled integration of existing applications. We are investigating the possibility of creating entirely new applications based on SOA. We present a ca...
详细信息
The ever increasing speed of Internet connectious has led to a point where it is actually possible for every end user to seamlessly share data on Internet. Peer-To-Peer (P2P) network are typical of this evolution. The...
详细信息
ISBN:
(纸本)0769526977
The ever increasing speed of Internet connectious has led to a point where it is actually possible for every end user to seamlessly share data on Internet. Peer-To-Peer (P2P) network are typical of this evolution. The goal of our paper is to show that thanks to self-adaptive assignment ment techniques, server-less P2P networks can efficiently deal with very large environments such as met in the geo-visualisation area. our method takes advantage of a hierarchical and progressive data structure that describes the environment. In order to assess the global efficiency of this P2P technique, we have. implemented a dedicated real time simulator. Experimentation results are presented using a hierarchical LOD model of a very large urban environment.
Federation communities in distributedsimulation are attracting increasing interest in current works. distributed federation occurs especially when simulation space is partitioned into logically independent parts form...
详细信息
ISBN:
(纸本)0769526977
Federation communities in distributedsimulation are attracting increasing interest in current works. distributed federation occurs especially when simulation space is partitioned into logically independent parts forming, rather autonomous clusters. However, federates in a cluster may become logically related to other federates in other clusters, in time. The main idea of this work is to view a federation community as a set of federate clusters. In this case the intra-cluster synchronization is separated from the inter-cluster synchronization. Synchronization between clusters will be necessary only when the different federate clusters become close to each other, depending on their relative proximity, When they are distant to each other they are assumed not to interact with each other, thus acting autonomously. Allowing such a temporal partitioning should reduce network traffic required for logical time management mechanism and also decrease the blocking time of individual federates.
暂无评论