This paper introduces a Coloured Petri Nets formalism -TCPN- which is suitable for modelling and simulation of complex systems. Novel in TCPN is (i) a timing model which accommodates both unordered and ordered (queue)...
详细信息
ISBN:
(纸本)0769518532
This paper introduces a Coloured Petri Nets formalism -TCPN- which is suitable for modelling and simulation of complex systems. Novel in TCPN is (i) a timing model which accommodates both unordered and ordered (queue) places;(ii) the adoption of Java as the net inscription language. TCPN is supported by a graphical tool RAINBOW - which allows model design, testing and simulation. A large TCPN model can be split into regions (subnets) whose execution is assigned to different LP/processors of a networked simulator. distributedsimulation relies on TUTW an agent-based time Warp algorithm capable of exploiting temporal uncertainty for improving simulation performance. The paper describes TCPN and its distributed execution kernel. The practical use of TCPN is demonstrated through an example and some experimental results.
In this paper we discuss and compare three different causality inconsistency tracking mechanisms in support Of preemptive rollback in optimistic parallel simulation on myrinet clusters. These mechanisms exhibit differ...
详细信息
ISBN:
(纸本)0769518532
In this paper we discuss and compare three different causality inconsistency tracking mechanisms in support Of preemptive rollback in optimistic parallel simulation on myrinet clusters. These mechanisms exhibit different communication/processing overhead and also different effectiveness in revealing causality inconsistency of the currently executed, simulation event. By the results of an empirical study on a classical simulation benchmark we have found some trade-offs between these mechanisms, pointing out indications of application contexts for which each mechanism is expected to be well tailored.
Cycles and knots in directed graphs are problems that can be associated with deadlocks in database and communication systems. Many algorithms to detect cycles and knots in directed graphs were proposed. Boukerche and ...
详细信息
ISBN:
(纸本)0769518532
Cycles and knots in directed graphs are problems that can be associated with deadlocks in database and communication systems. Many algorithms to detect cycles and knots in directed graphs were proposed. Boukerche and Tropper have proposed a distributed algorithm that solve the problem in a efficient away. Their algorithm has a message complexity of 2m vs. (at least) 4m for the Chandy and Misra algorithm, where in is the number of links in the graph, and requires 0 (n log n) bits of memory, where n is the number of nodes. We have implemented Boukerche and Tropper's algorithm according to the construction of processes of the CSP model. Our implementation was done. using JCSP, an implementation of CSP for Java, and the results are presented.
Many simulations and other applications need to interact seamlessly with distributed data resources. The Agent-Based Environment for Linking simulations (ABELS) allows the formation of a dynamic "data and simulat...
详细信息
ISBN:
(纸本)0769518532
Many simulations and other applications need to interact seamlessly with distributed data resources. The Agent-Based Environment for Linking simulations (ABELS) allows the formation of a dynamic "data and simulation cloud" that links a heterogeneous collection of networked resources. ABELS consists of three major types of components: user entities that serve as data producers and/or consumers, a brokering system for organizing and linking the various participants, and generic local agents that connect simulations and data resources to the cloud of participants. This paper presents the design of the distributed brokering system, which is implemented using Java and Sun Microsystems' Jini technology.
The High Level Architecture allows simulation components Of various hypes to be joined together into a federation to create a common virtual environment. However with the increased complexity of simulations, not all u...
详细信息
ISBN:
(纸本)0769518532
The High Level Architecture allows simulation components Of various hypes to be joined together into a federation to create a common virtual environment. However with the increased complexity of simulations, not all user requirements can be satisfied by a flat federation. The requirement of selective information hiding naturally suggests a Hierarchical Federations Architecture (HFA) where federations are organized into hierarchies so that a federation appears as a federate in an upper level federation. In order to provide reusability and interoperability at the federation level, a federation should be able to participate in different super-federations without requiring code modification. In this paper we present an approach to automatically construct the HFA. We describe the information that must be provided by the participating user federations and how this is used to construct the Universal Object Model (UOM) used by the super-FOMs (the FOMs of super-federations). We show how the structure for selective information hiding is generated from the user information and how gateway federates are automatically constructed to support super-FOM independence.
This paper discusses a wireless multiple access protocol for multimedia traffic called DMMA (distributed control Multimedia Multiple Access). The protocol is used where a number of users dynamically migrate to/from an...
详细信息
ISBN:
(纸本)0769516688
This paper discusses a wireless multiple access protocol for multimedia traffic called DMMA (distributed control Multimedia Multiple Access). The protocol is used where a number of users dynamically migrate to/from an adhoc network to communicate multimedia messages. The protocol have four features. 1) Since the protocol doesn't need a center station, it can construct an adhoc wireless network. 2) The protocol assigns a transmission slot periodically for real-time data, while for non-real-time data it assigns as many slots as possible to enhance efficiency. 3) The protocol col uses a stable continual tree algorithm for slot reservation to reduce admission delay. 4) Every transmission data includes the control data indicating requiring slots successively, which enables a terminal to join and leave the network dynamically. The protocol is evaluated by simulation to show fair throughput for any multimedia data.
The proceedings contain 20 papers. The topics discussed include: a load management system for running HLA-based distributedsimulations over the grid;PERFOSIM: a performance evaluation tool for HLA distributed simulat...
ISBN:
(纸本)0769518532
The proceedings contain 20 papers. The topics discussed include: a load management system for running HLA-based distributedsimulations over the grid;PERFOSIM: a performance evaluation tool for HLA distributedsimulations;bridging the HLA: problems and solutions;a next-generation internet federation object model for the HLA;automatic construction of hierarchical federations architecture;trade-offs in overhead vs. effectiveness of causality inconsistency tracking for preemptive rollback in optimistic simulation;performance evaluation of realtime schedulers for a multicomputer;performance trade-off in distributedsimulation;using a software architecture description language to model the architecture and run-time performance of a federate;and software design for implementation of the selectively reliable multicast protocol.
Large Rapid-Prototyping Systems comprising several FPGAs become more and more the tool at hand to verify complete hardware systems at an early stage of development for first time success. Although hardware capability ...
详细信息
ISBN:
(纸本)076951703X
Large Rapid-Prototyping Systems comprising several FPGAs become more and more the tool at hand to verify complete hardware systems at an early stage of development for first time success. Although hardware capability is growing rapidly the appropriate software tools are lacking in mapping performance and quality. It is especially difficult to meet certain real-time constraints when a design is distributed among several FPGAs. We propose a macro-based partitioning methodology that significantly improves turnaround times and leads to very compact hardware realizations. We demonstrate the benefits of our approach for a real-time video processing application. In addition, compilation time and hardware resources could be reduced by 35% and 45%, respectively.
The proceedings contain 26 papers. The special focus in this conference is on Adaptive Networks, Collaborative Systems, Languages for the Web and Adaptive distributed Systems. The topics include: A middleware architec...
ISBN:
(纸本)3540003010
The proceedings contain 26 papers. The special focus in this conference is on Adaptive Networks, Collaborative Systems, Languages for the Web and Adaptive distributed Systems. The topics include: A middleware architecture for personalized communities of devices;a general purpose model for presence awareness;research on reliable communication in real-time collaborative designing systems;efficient connection management for web applications;QOS performance improvement for web applications;an efficient algorithm for application-layer anycasting;experimenting with Gnutella communities;interactive group audio with complementary symbolic control;a group-based time-stamping scheme for the preservation of group intentions;a user-centred consistency model in real-time collaborative editing systems;a rule-driven approach for defining the behaviour of negotiating software agents;distributed transaction management in a peer-to-peer process-oriented environment;using xml schemas to create and encode interactive 3-d audio scenes for multimedia and virtual reality applications;the design of high-level database access method in a web-based 3d object authoring tool;language standardization for the semantic web;a metalanguage for scripting versionable hypertexts;enabling technologies for communities at web shops;client migration in a continuous data network and using Jini to integrate home automation in a distributed software-system.
暂无评论