We describe a novel approach to scalability and efficiency of parallel network simulation that partitions the networks into domains and simulation time into intervals. Each domain is simulated independently of and con...
详细信息
ISBN:
(纸本)9780769516080
We describe a novel approach to scalability and efficiency of parallel network simulation that partitions the networks into domains and simulation time into intervals. Each domain is simulated independently of and concurrently with the others over the same simulation time interval. At the end of each interval, packet delays and drop rates for each inter-domain flow are exchanged between domain simulators. The simulators iterate over the same time interval until the exchanged information converges to a constant value within the prescribed precision. After convergence, all the domain simulators progress to the next time interval. This approach allows the parallelization with infrequent *** biggest challenge for this method is to ensure iteration convergence for protocols, such as TCP, that adjust source rate to the current network conditions. The main contribution of this paper is to demonstrate that by judicious design of the domain processing and information exchange, the proposed approach efficiently parallelizes network simulation with TCP flows.
A new model for communication in MANET is presented: Instead of omnidirectional transmissions, as assumed in most papers and all existing systems, the members are allowed to submit data in a fixed number of different ...
详细信息
ISBN:
(纸本)0769514448
A new model for communication in MANET is presented: Instead of omnidirectional transmissions, as assumed in most papers and all existing systems, the members are allowed to submit data in a fixed number of different directions (sector subdivision) and to adjust the transmission power in each sector separately. A simulation environment (simulation environment for ad hoc networks, SAHNE) is presented that allows simulation of communication strategies in MANET that use sector subdivision, and simulation results are shown where communication paths are selected via hop-minimization or geometric spanner properties. SAHNE is based on C++ and common libraries, which ensures that it can be used on many different platforms. The experiments show the influence of different parameters in realistic scenarios, and using geometric routing seemed to be better than using hop-minimization.
There are many mapping schemes proposed in previous research on parallel proxy servers. The operations of these schemes are mainly URL-based, and therefore cannot fully benefit from the new persistent connection featu...
详细信息
There are many mapping schemes proposed in previous research on parallel proxy servers. The operations of these schemes are mainly URL-based, and therefore cannot fully benefit from the new persistent connection feature of HTTP/1.1. We propose a site-based mapping scheme that forwards all requests targeting on the same Web site to the same proxy server. The scheme then allows the proxy to use a single persistent connection to serve many client requests. The major advantage of the scheme is the reduction in the number of connection establishments. This reduction can save network bandwidth and reduce the user-experienced latency. simulation results show that the proposed site-based scheme reduces 40%-70% of the connection setups and teardowns when compared to a traditional URL-based mapping scheme.
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:
(纸本)9780769516080
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.
Decentralized control is composed of more than two subsystems. Subsystems communicate each other to control the whole system. In this paper, information of mechanical constraint for a parallel manipulator is analyzed....
详细信息
Decentralized control is composed of more than two subsystems. Subsystems communicate each other to control the whole system. In this paper, information of mechanical constraint for a parallel manipulator is analyzed. When some joints of multi-degrees of freedom parallel manipulators are set to be passive, excessive interference force can be reduced. A case where one joint of 3-linked arms is set to be passive is treated. The influence of a passive joint to the tip of the arm is derived by the configuration and the calculated reference torque. In the active joints, the interference force information from other joints are used to compensate the effect of passive joint. Such information is also used for switching passive joints. As a result, the avoidance of singular point is realized. Taking advantage of a parallel manipulator which has redundant drive joints, fault compensation is achieved by extending the communication of subsystems. Comparison with centralized control represents the availability of the decentralized control system by simulation.
This paper discusses distributed checkpointing with "Time Warp techniques", a typical uncoordinated checkpointing technique that is often used in the parallel and distributedsimulations. Relaxing the assump...
详细信息
This paper discusses distributed checkpointing with "Time Warp techniques", a typical uncoordinated checkpointing technique that is often used in the parallel and distributedsimulations. Relaxing the assumption of the previous model of Soliman et al., we show a discrete time model where the number of available checkpoints each process can hold is finite. In addition, we propose an adaptive distributed checkpointing technique, that gives an effective time arrangement of checkpoints for a recovery point distribution, and we give numerical examples.
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:
(纸本)9780769516080
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 *** 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.
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:
(纸本)9780769516080
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, real-time 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:
(纸本)9780769516080
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/0 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-Warp 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.
Faster-than-real-time simulation (FRTS) can be used for performance evaluation of systems behavior in real time, providing significant capabilities for studying systems with a time-varying behavior. FRTS enables model...
ISBN:
(纸本)9780769516080
Faster-than-real-time simulation (FRTS) can be used for 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 are also presented to support the effectiveness of the proposed method.
暂无评论