We introduce a new time warp system called ROSS: Rensselaer's Optimistic simulation System. ROSS is an extremely modular kernel that is capable of achieving event rates as high as 1,250,000 events per second when ...
详细信息
We introduce a new time warp system called ROSS: Rensselaer's Optimistic simulation System. ROSS is an extremely modular kernel that is capable of achieving event rates as high as 1,250,000 events per second when simulating a wireless telephone network model (PCS) on a quad processor PC server. In a head-to-head comparison, we observe that ROSS out performs the Georgia Tech Time Warp (GTW) system on the same computing platform by up to 180%. ROSS only requires a small constant amount of memory buffers greater than the amount needed by the sequential simulation for a constant number of processors. The driving force behind these high-performance and low memory utilization results is the coupling of an efficient pointer-based implementation framework, Fujimoto's (1989) fast GVT algorithm for shared memory multiprocessors, reverse computation and the introduction of kernel processes (KPs). KPs lower fossil collection overheads by aggregating processed event lists. This aspect allows fossil collection to be done with greater frequency, thus lowering the overall memory necessary to sustain stable, efficient parallel execution.
We examine various modeling and simulation applications of cluster computing using a Beowulf cluster. These applications are used to investigate the performance of our cluster in terms of computational speedup, scalab...
详细信息
We examine various modeling and simulation applications of cluster computing using a Beowulf cluster. These applications are used to investigate the performance of our cluster in terms of computational speedup, scalability, and communications. The applications include solution of linear systems by Jacobi iteration, distributed image generation, and the finite difference time domain solution of Maxwell's equations. It is observed that the computational load for these applications must be large compared to the communication overhead to take advantage of the speedup obtained using parallel computing. For the applications reviewed, this condition is increasingly satisfied as the problem size becomes larger or as higher resolution is required.
Wireless networking technologies and mobile cellular communication systems are growing at an ever faster rate, and this is likely to continue in the foreseeable future. Higher reliability, better coverage and services...
详细信息
Wireless networking technologies and mobile cellular communication systems are growing at an ever faster rate, and this is likely to continue in the foreseeable future. Higher reliability, better coverage and services, higher capacity, mobility management, and wireless multimedia are all parts of the potpourri. The evolution of new systems and improved designs will always depend on the ability to predict system performance using analytical or simulation methods. To date, mathematical analysis has brought some insight into the design of such systems, but analytical methods are often not general or detailed enough for evaluation and comparison of various proposed mobile and/or wireless systems and their services. distributedsimulation techniques have been investigated in a number of studies to decrease the execution times of PCS simulations. We study the load balancing problem for PCS wireless simulation systems, and focus upon static strategies in order to reduce the synchronization overhead of SWiMNet, a parallel PCS simulation testbed developed at UNT.
The introduction of Java in the mid nineties has revolutionised and revitalised interest in the construction of "supercomputers" from "off the shelf" components. Much of the research spawned by the...
详细信息
The introduction of Java in the mid nineties has revolutionised and revitalised interest in the construction of "supercomputers" from "off the shelf" components. Much of the research spawned by the introduction of Java is in the area of metacomputing, where projects that utilise the distributed capabilities of the World Wide Web are becoming more frequent. WebCom is one such system that implements a framework to harness these distributed resources. Although WebCom supports different models of computation, by incorporating them as distinct modular components, an implicitly parallel graph-based model is used. Visual programming tools for simulation steering are employed allowing the creation, submission and dynamic manipulation of programs.
We mainly study the parallelization aspects of the accelerated waveform relaxation algorithms for the transient simulation of semiconductor devices on paralleldistributed memory computers since these methods are comp...
详细信息
We mainly study the parallelization aspects of the accelerated waveform relaxation algorithms for the transient simulation of semiconductor devices on paralleldistributed memory computers since these methods are competitive with standard pointwise methods on serial machines, but are significantly faster on parallel computers. We propose an improved version of the quasi-minimal residual (IQMR) method by using the Lanczos process as a major component combining elements of numerical stability and parallel algorithm design, for solving the resulting sequence of time-varying sparse linear differential-algebraic initial-value problems (IVP) arising at each linearization step. For the Lanczos process stability is obtained by a coupled two-term procedure that generates Lanczos vectors scaled to unit length. The algorithm is derived such that all inner products and matrix-vector multiplications of a single iteration step are independent and communication time required for inner product can be overlapped efficiently with computation time. Therefore, the cost of global communication can be significantly reduced. Experimental results carried out on a Parsytec GC regarding a comparison with other accelerated approaches such as convolution SOR and waveform GMRES techniques on the waveform relaxation algorithm and pointwise methods are also described.
Network based distributed computing has been gaining popularity over the past decade. Many parallel programming languages and related parallel programming modes are becoming widely accepted. However, the execution of ...
详细信息
Network based distributed computing has been gaining popularity over the past decade. Many parallel programming languages and related parallel programming modes are becoming widely accepted. However, the execution of parallel applications on distributed systems has been hampered by the high communication overhead. To reduce the communication overhead and the completion time of a parallel application, we propose a key message model for parallel computing on network of workstations (NOWs). In the key message model, all messages generated in a key message path are prioritized. A key message path in a task graph is defined as the path that is optimized by the key message algorithm. All messages generated in a key message path are prioritized. Besides, the key message algorithm automatically finds the key message paths. In this paper, we first describe the algorithm that identifies the key messages to be prioritized in a parallel application, then analyze the cost of the algorithm, and finally evaluate the performance of the algorithm in a simulation. Our preliminary analysis of the algorithm shows improvement over the system which does not use prioritization scheme.
Introduces algorithms which can produce both optimal and suboptimal task assignments to minimize the probability of failure of an application executing on a heterogeneous distributed computing system. A cost function ...
详细信息
Introduces algorithms which can produce both optimal and suboptimal task assignments to minimize the probability of failure of an application executing on a heterogeneous distributed computing system. A cost function which defines this probability under a given task assignment is derived. To find optimal and suboptimal task assignments efficiently, a reliable matching and scheduling problem is converted into a state-space search problem in which the cost function derived is used to guide the search. The A* algorithm for finding optimal task assignments and the A*/sub m/ and hill-climbing algorithms for finding suboptimal task assignments are presented. simulation results are provided to confirm the performance of the proposed algorithms.
暂无评论