The proceedings contains 36 papers from the Fifth International Symposium on Modeling, Analysis and simulation of Computer and Telecommunication Systems. Topics discussed include: load sharing and scheduling in distri...
详细信息
The proceedings contains 36 papers from the Fifth International Symposium on Modeling, Analysis and simulation of Computer and Telecommunication Systems. Topics discussed include: load sharing and scheduling in distributed systems;parallel and distributed system simulation;high-speed communication network controllers;teletraffic modeling methodology;scientific visualization tools;asynchronous transfer mode (ATM) networks;multiprocessing systems design and analysis;network topology design and modeling;and fault-tolerant systems.
Advanced distributedsimulation (ADS) is an enabling concept to support the networked interaction of models and real-world elements resident at geographically dispersed sites planned for next-generation simulation env...
详细信息
It is well known that Time Warp may suffer from poor performance due to excessive rollbacks caused by overly optimistic execution. Here we present a simple flow control mechanism using only local information and GVT t...
详细信息
It is well known that Time Warp may suffer from poor performance due to excessive rollbacks caused by overly optimistic execution. Here we present a simple flow control mechanism using only local information and GVT that limits the number of uncommitted messages generated by a processor, thus throttling overly optimistic TW execution. The flow control scheme is analogous to traditional networking flow control mechanisms. A `window' of messages defines the maximum number of uncommitted messages allowed to be scheduled by a process. Committing messages is analogous to acknowledgments in networking flow control. The initial size of the window is calculated using a simple analytical model that estimates the instantaneous number of messages that a process will eventually commit. This window is expanded so that the process may progress up to the next commit point (generally the next fossil collection), and to accommodate optimistic execution. The expansions to the window are based on monitoring TW performance statistics so the window size automatically adapts to changing program behaviors. The flow control technique presented here is simple and fully automatic. No global knowledge or synchronization (other than GVT) is required. We also develop an implementation of the flow control scheme for shared memory multiprocessors that uses dynamically sized pools of free message buffers. Experimental data indicates that the adaptive flow control scheme maintains high performance for `balanced workloads', and achieves as much as a factor of 7 speedup over unthrottled TW for certain irregular workloads.
Computer simulations are used in landscape ecology to simulate the effects of human land-use decisions on the environment. Such decisions are influenced by both ecological and socioeconomic factors which can be repres...
详细信息
ISBN:
(纸本)9781581130171
Computer simulations are used in landscape ecology to simulate the effects of human land-use decisions on the environment. Such decisions are influenced by both ecological and socioeconomic factors which can be represented by spatially explicit multidisciplinary data. The Land-Use Change Analysis System (or LUCAS) was developed to study the effects of land-use on landscape structure in such areas as the Little Tennessee River Basin in western North Carolina and the Olympic Peninsula of Washington state. These effects include land-cover change and species habitat suitability. Using a geographic information system (GIS) to store, display and analyze map layers derived from remotely sensed images, census and ownership maps, topological maps, and output from econometric models, a parallel/distributed version of LUCAS (pLUCAS) was developed for simulations on a network of workstations. Targeting distributed computational environments reflects the resources available to most land-use planners, forestry personnel, and wildlife managers. A performance evaluation of two pLUCAS distributed models on an ATM-based network of 12 SUN Ultra-2 workstations is presented.
Load balancing is a critical issue for parallel database systems. There are two common load balancing methods, access equalization and data equalization approaches. In this paper, we present a new data equalization lo...
详细信息
Load balancing is a critical issue for parallel database systems. There are two common load balancing methods, access equalization and data equalization approaches. In this paper, we present a new data equalization load balancing approach for the hybrid-range partitioning scheme. The algorithm is an extension of the conventional hybrid-range partitioning and features variable-size fragments to counter the data skew problem, which was not addressed in the conventional scheme. The algorithm load balancing costs and the performance improvements are testified by using a simple simulation.
In this contribution, I report on a molecular-dynamics algorithm for the simulation of the self-organization of longitudinal polymer liquid crystals on the fully-distributed computer system. The peculiarities of the h...
详细信息
In this contribution, I report on a molecular-dynamics algorithm for the simulation of the self-organization of longitudinal polymer liquid crystals on the fully-distributed computer system. The peculiarities of the hardware and software for this system are disscussed. It is shown that the parallelization of algorithm is carryed out by the distribution of all the particles incorporated into a macromolecule among several processors connected to each other in the framework of selected virtual topology and by the parallel execution of several program copies by these processors. The timing of execution at the system of different processor numbers is discussed.
The time warp mechanism is one of the most important synchronization protocols for parallelsimulation. However for most applications, the successful use of time warp requires the careful selection of time warp optimi...
详细信息
Interactive simulation of battles is a valuable took for training. The behavior and movement of hundreds or thousands of entities (tanks, trucks, airplanes, missiles, etc.) is currently simulated using dozens or more ...
详细信息
ISBN:
(纸本)0818678798
Interactive simulation of battles is a valuable took for training. The behavior and movement of hundreds or thousands of entities (tanks, trucks, airplanes, missiles, etc.) is currently simulated using dozens or more workstations on geographically distributed LANs connected by WANs. The simulated entities can move, fire weapons, receive ''radio'' messages, etc. The terrain that they traverse may change dynamically, for example due to rains turning dirt roads into mud or bombs forming craters. Thus the entities need to receive frequent information about the state of the terrain and the location and state of other entities. Typically, information is updated several times a second. As the number of simulated entities grows, the number of messages that need to be sent per unit of time can grow to unmanageable numbers. One approach to reducing the number of messages is to keep track of what entities need to know about which other entities and only send information to the entities that need to know. For example, tanks in Germany need not know about a change of course of a ship in the Pacific. This technique for reducing messages is known as interest management. Caltech and its Jet Propulsion Laboratory have implemented a simulation of this type on several large-scale parallel computers, exploiting both the compute pourer and the fast messaging fabric of such systems. The application is implemented using a heterogeneous approach. Some nodes are used to simulate entities, some to manage a database of terrain information, some to provide interest management functions, and some to route messages to the entities that do need to receive the information. Some of these tasks require more memory than others, some require faster processing capability. Thus the application is heterogeneous both in its functional decomposition and to a smaller extent in the characteristics of the hardware that is used to run each function. In addition, workstations are used to run the Graphical User
The paper presents the tolerant, hybrid synchronization schema and its benefits for the parallel and distributedsimulation of interconnected computer networks. The hybrid schema combines conservative and optimistic s...
详细信息
The paper presents the tolerant, hybrid synchronization schema and its benefits for the parallel and distributedsimulation of interconnected computer networks. The hybrid schema combines conservative and optimistic synchronization approaches by using lookahead for scheduling special events and using the flexibility of time warp in certain cases. In addition to these classical approaches the introduction of the "tolerance" allows the distributed modules to simulate further ahead than guaranteed by the conservative synchronization schema. This results in significantly smaller simulation runtimes and many other benefits.
We revisit the notion of event simultaneity in the context of parallel and distributedsimulation. Although the simulation community has recognized this problem for years, it has focused mainly on the mechanics of bre...
详细信息
We revisit the notion of event simultaneity in the context of parallel and distributedsimulation. Although the simulation community has recognized this problem for years, it has focused mainly on the mechanics of breaking event-time ties and has neither measured its extent nor considered its implications. Exant simulators (both serial and parallel) prohibit simultaneity either by user-specified event priorities or by an arbitrary (but well-documented) tie-breaking mechanism. We show, theoretically and empirically, that these strategies may lead to an invalid simulation. In doing so, we introduce the threshold of event simultaneity and use it to understand the semantics of simultaneity.
暂无评论