This paper presents two new versions of the Critical Channel Traversing (CCT) algorithm. CCT is a conservative parallel discrete event simulation algorithm that has been shown to achieve very high performance when use...
详细信息
ISBN:
(纸本)0769516084
This paper presents two new versions of the Critical Channel Traversing (CCT) algorithm. CCT is a conservative parallel discrete event simulation algorithm that has been shown to achieve very high performance when used in a wide area computer network simulator The first of the new algorithms called simple sender side CCT is similar to the original, but busy waiting is eliminated. Results presented show that simple sender side CCT avoids performance problems that can be caused by busy waiting. The second new algorithm called receive side CCT employs a different strategy for updating channel clocks and determining which objects should be scheduled on critical channels. Performance results show that this version provides better scaling with respect to the connectivity of the model, at the expense of some added complexity.
This paper focuses on conservative simulation using distributed-shared memory for inter-processor communication. JavaSpaces, a special service of Java Jini, provides a shared persistent memory for simulation message c...
ISBN:
(纸本)0769516084
This paper focuses on conservative simulation using distributed-shared memory for inter-processor communication. JavaSpaces, a special service of Java Jini, provides a shared persistent memory for simulation message communication among processors. Two benchmark programs written using our SPaDES/Java parallelsimulation library are used. The first program is a linear pipeline system representing a loosely-coupled open system. The PHOLD program represents a strongly-connected closed system. Experiments are carried out using a cluster of Pentium II PCs. We used a combination of Wood Turner carrier null, flushing and demand-driven algorithms for null message synchronization. To optimize message communication, we replace SPaDES/Java inter-processor communication implemented using Java's Remote Method Invocation (RMI) with one JavaSpace. For PHOLD (16x16, 16) running on eight processors, this change reduces simulation runtime by more than half, null message overhead reduces by a further 15%, and event rate more than doubled. Based on our memory analysis methodology, the memory, cost of null message synchronization for PHOLD is less than 9% of the total memory needed by, the simulation.
parallelsimulations using optimistic synchronization strategies such as Time Warp, operate with no regard to global synchronization since this results in greater parallelism and lower synchronization cost. However, l...
ISBN:
(纸本)0769516084
parallelsimulations using optimistic synchronization strategies such as Time Warp, operate with no regard to global synchronization since this results in greater parallelism and lower synchronization cost. However, like virtual memory, the parallel simulators may end up thrashing instead of performing useful work. The complication in using a Time Warp simulator is then to configure it suitably for good performance and avoid thrashing. Unfortunately, the optimal configuration is not generally static among different applications or even throughout an entire run of a single application. Thus, online feedback control systems are deployed to govern the adjustment of input parameters in our Time Warp simulation kernel. The design and implementation of effective feedback control systems can be difficult;the extra processing is pure overhead that must be absorbed by an), performance gains delivered. The problem is further complicated when attempting to build a simulation kernel that is designed efficiently to operate with many different applications. In this paper, we introduce a control-centric architecture that is used to monitor and manage different parts of a Time Warp simulator Specifically, we extend concepts from control theory such as adaptive control and stability, to better understand and design hierarchically-distributed run-time control systems for Time Marp based parallelsimulation.
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.
A real-time fault-tolerant multicast protocol is necessary for obtaining high performance in operating distributed real-time computing systems. The purpose of this paper is to show the efficiency of RFRM (Release-time...
详细信息
ISBN:
(纸本)0769515762
A real-time fault-tolerant multicast protocol is necessary for obtaining high performance in operating distributed real-time computing systems. The purpose of this paper is to show the efficiency of RFRM (Release-time based Fault-tolerant Real-time Multicast) protocol which is based on the idea of attaching the official release time to each multicast message. As a part of this, a real-time simulation based on the TMO structuring scheme is conducted to evaluate the proposed approach. We experiment a real-time multicast model which does not receive ack-messages toward reducing the message traffic on the network by employing fault detection mechanism. simulation results promised the efficiency of the proposed real-time multicast protocol.
Faster-than-real-time simulation (FRTS) can be used for the performance evaluation of systems behavior in real time, providing significant capabilities for studying systems with a time-varying behavior. FRTS enables m...
ISBN:
(纸本)0769516084
Faster-than-real-time simulation (FRTS) can be used for the performance evaluation of systems behavior in real time, providing significant capabilities for studying systems with a time-varying behavior. FRTS enables model validation through comparing simulation results with the corresponding system observations. However, experimentation proves to be rather demanding, as both delivering output results and ensuring their reliability must be accomplished within a predetermined time frame. Output analysis of system observations and model results and relevant timing issues are discussed. A method is introduced that determines whether it is possible to execute the "optimal" faster-than-real-time experiment, in which case multiple replications are scheduled for execution, or a compromise has to be made between the ability to predict for the long future and the degree of reliability achieved for predictions. FRTS experimental results are also presented to support the effectiveness of the proposed method.
We investigate the causality issue in distributed virtual environments. Causality has been widely studied in parallel and distributed systems. However, most of the work in causality detection and preservation are from...
详细信息
Of critical importance to any real-time system is the issue of predictability. We divide overall system predictability into two parts: algorithmic and systemic. Algorithmic predictability is concerned with ensuring th...
ISBN:
(纸本)0769516084
Of critical importance to any real-time system is the issue of predictability. We divide overall system predictability into two parts: algorithmic and systemic. Algorithmic predictability is concerned with ensuring that the parallelsimulation engine and model from a complexity point of view are able to consistently yield results within a real-time deadline. Systemic predictability is concerned with ensuring that OS scheduling, interrupts and virtual memory overheads are consistent over a real-time period. To provide a framework for investigating systemic predictability, we define a new class of parallelsimulation called Extreme simulation or XSim. An XSim is any analytic parallelsimulation that is able to generate a statistically valid result by a real-time deadline. Typically, this deadline is between 10 and 100 milliseconds. XSims are expected to provide decision support to existing complex, realtime systems. As a new design and implementation methodology for realizing XSims, we embed a state-of-the-art optimistic simulator into the Linux operating system. In this operating environment, OS scheduling and interrupts are disabled. Given a 50 millisecond model completion deadline, we observe that the XSim has a systemic predictability, measure of 98% compared with only 56% for the same Time Warp system operating in user-level.
parallel Discrete Event simulation (PDES) on a cluster of workstations is a fine grained application where the communication performance can dictate the effiency of the simulation. The high performance Local/System Ar...
详细信息
ISBN:
(纸本)0769516084
parallel Discrete Event simulation (PDES) on a cluster of workstations is a fine grained application where the communication performance can dictate the effiency of the simulation. The high performance Local/System Area Networks used in high-end clusters are capable of delivering data with high bandwidth and low latency. Unfortunately, the communication rate far out-paces the capabilities of workstation nodes to handle it (I/O bus, memory bus, CPU resources). For this reason, many vendors are offering a programmable processor on the NIC to allow application specific optimization of the communication path. This invites a new implementation model for distributed applications where: (i) application specific communication optimizations can be implemented on the NIC;(ii) portions of the application that are most heavily communicating can be migrated to the NIC;(iii) some messages can be filtered out at the NIC without burdening the primary processor resources;and (iv) critical events are detected and handled early. The aim of our research is to investigate the utility of this model for PDES and to gain initial experiences in the implementation challenges and potential performance improvement. In this paper, we present our experiences with Early Cancellation - an optimization for Time- Varp that cancels messages in place upon early discovery of a rollback. We believe that there is a large scope for additional optimizations using this model.
Composite events are required for many applications that require obtaining events from various sources, correlating them, and activating appropriate actions. One of the major issues in composite event system is scalab...
详细信息
ISBN:
(纸本)0769515886
Composite events are required for many applications that require obtaining events from various sources, correlating them, and activating appropriate actions. One of the major issues in composite event system is scalability. This paper reports on a research that follows the situation concept of the Amit system, and proposes a parallel execution model for the event composition. The paper describes the model and its difficulties, and shows its usefulness using simulation results.
暂无评论