Particle swarm optimization (PSO) is a powerful technique for computer aided prediction of proteins' three-dimensional structure. In this work, employing an all-atom force field we demonstrate the efficiency of th...
详细信息
As High Level Architecture (HLA) standard widely used in underwater warfare simulation applications, it is imperative that we should meet the need for the adaptation to the changing warfare requirements and improve de...
详细信息
ISBN:
(纸本)9780769529097
As High Level Architecture (HLA) standard widely used in underwater warfare simulation applications, it is imperative that we should meet the need for the adaptation to the changing warfare requirements and improve development efficiency and reusability of simulation software, especially when developing a federate, known as a node in HLA-based distributedsimulation. To address this problem, we present a dynamic reconfigurable adaptive software architecture for federate in this paper. the architecture has capability of self-adaptation to simulation requirements, and separates function realization from configuration control. It is composed of four layers, interface communication, requirement management, adaptation management and function realization. In this architecture, we partition the federate into several functional parts in terms of a definite granularity with Component-Based Software Development (CBSD) methodology. the architecture can adjust dynamically the configuration of federate to the new requirements while the simulation requirements change. Finally, we take a general sonar federate as an example to illustrate the presented architecture's support for adaptation.
the reconstruction of angiographic images can be seen as a discrete optimization problem where a blind search is not suitable. A branch-and-bound algorithm can be used to explore the space state using a priori informa...
详细信息
Standard groupware products do not fulfill the specific requirements of various application areas, due to technical restrictions, lack of flexibility or non-availability of adapted interfaces. In view of this situatio...
详细信息
Testing distributed applications over the Internet is fraught with problems: due to the inability, to control a wide area network consistent, reproduceable performance experiments are not possible. Here a system is de...
详细信息
Testing distributed applications over the Internet is fraught with problems: due to the inability, to control a wide area network consistent, reproduceable performance experiments are not possible. Here a system is described that uses a parallel discrete event simulator that can act as a real-time network emulator. Real Internet Protocol (IP) traffic generated by application programs running on user workstations can interact with modelled traffic in the emulator, thus providing a controlled test environment for distributed applications. parallel execution enables the emulator to simulate large virtual networks and to model traffic interactions that could not be done in real-time sequentially. this paper gives an overview of the emulator and explores the various external data routing methods that the emulator supports. these routing methods allow the emulator to be operated in shared environments with certain constraints, as well as in dedicated test environments. Preliminary performance results are included.
Dynamic parallel Schedules (DPS) is a high-level framework for developing parallel applications on distributed memory computers (e.g. clusters of PCs). Its model relies on compositional customizable split-compute-merg...
详细信息
ISBN:
(纸本)076951880X
Dynamic parallel Schedules (DPS) is a high-level framework for developing parallel applications on distributed memory computers (e.g. clusters of PCs). Its model relies on compositional customizable split-compute-merge graphs of operations (directed acyclic flow graphs). the graphs and the mapping of operations to processing nodes are specified dynamically at runtime. DPS applications are pipelined and multithreaded by construction, ensuring a maximal overlap of computations and communications. DPS applications can call parallel services exposed by other DPS applications, enabling the creation of reusable parallel components. the DPS framework relies on a C++ class library. thanks to its dynamic nature, DPS offers new perspectives for the creation and deployment of parallel applications running on server clusters.
Conservative parallel discrete event simulation takes a connection-oriented approach to inter-process communication. Conservative processes modeling physical entities are connected via channels that represent physical...
详细信息
ISBN:
(纸本)0769521118
Conservative parallel discrete event simulation takes a connection-oriented approach to inter-process communication. Conservative processes modeling physical entities are connected via channels that represent physical links in the target system. By contrast, optimistic strategy and its implementation in Time Warp machine, take a connectionless approach where a process can communicate freely with any other process without prior connection. this paper presents the case for a connection-oriented optimistic approach and provides a data structure for the event set of Time Warp processes that significantly reduces the cost of event scheduling and cancellation under connection-oriented operation. Detailed description of the proposed implementation is given and performance of the structure in forward event scheduling and backward event cancellation is tested and the results are discussed.
this paper presents the results of an experimental study to evaluate the effectiveness of parallelsimulation in reducing the execution time of gate-level models of VLSI circuits. Specific contributions of this paper ...
详细信息
this paper presents the results of an experimental study to evaluate the effectiveness of parallelsimulation in reducing the execution time of gate-level models of VLSI circuits. Specific contributions of this paper include (i) the design of a gate-level parallel simulator that can be executed, without any changes on bothdistributed memory and shared memory parallel architectures, (ii) demonstrated speedups with both conservative and optimistic simulation protocols (almost all previous studies on circuit simulation have failed to extract speedups with conservative protocols);in particular we showed that a speedup of about 3 was obtained on 8 processors of a Sparc1000 for conservative algorithms and about 2 for optimistic algorithms for circuits in the ISCAS85 benchmark suite;and (iii) performance comparison between shared memory and distributed memory implementations of the simulator.
In the design and analysis of discrete event systems, the validation of their models is often addressed via simulation. Petri nets have been applied widely Lookahead computation is a good method that improves the dist...
详细信息
ISBN:
(纸本)9780769529097
In the design and analysis of discrete event systems, the validation of their models is often addressed via simulation. Petri nets have been applied widely Lookahead computation is a good method that improves the distributedsimulation performance of Timed Transition Petri Nets (TTPN). the approach is based on a part of optimism computed on the prediction time each logical process can determine for its advancement. Timed Petri nets meet these requirements, and use the lookahead to analyze the TTPN model for finding the concurrency and blocking structure, thereby making certain the logical process (LP). Based on the specialties of lookahead, the lookahead was applied in parallelsimulation, and acquire the sufficient condition about the TTPN model existing concurrency According to the condition parallel program can be partitioned into several logical processes, and the partition algorithm that can decide quickly the mapping project on the mapping process-processor is presented.
暂无评论