the proceedings contains 32 papers. Topics discussed include algorithms for parallelization, distributed computer systems and networking, software tools and environments, parallel finite and boundary elements, applica...
详细信息
the proceedings contains 32 papers. Topics discussed include algorithms for parallelization, distributed computer systems and networking, software tools and environments, parallel finite and boundary elements, applications in fluid flour and applications in applied science.
the proceedings contains 36 papers from the Fifthinternationalsymposium 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 Fifthinternationalsymposium 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.
Previous work has shown the power of massively parallel configurable hardware (NGEN, [1, 2]) in conjunction with dataflow architectures for the simulation of evolving populations. NGEN is a flexible computer hardware ...
详细信息
Previous work has shown the power of massively parallel configurable hardware (NGEN, [1, 2]) in conjunction with dataflow architectures for the simulation of evolving populations. NGEN is a flexible computer hardware for rapid custom-circuit simulation of fine grained physical processes via a massively parallel architecture, e. g. 144 hardware configurable field programmable gate arrays (FPGAs, XC4008, Xilinx). NGEN is optimized to implement dataflow architectures and systolic algorithms for large problems and is confectioned with high speed distributed SRAM, 144*8*256kBit - 15ns access time, on the chip-to-chip interconnect.
distributedcomputing involves systems that operate across networks transparently, using the resources of multiple machines. the Open Software Foundation's distributedcomputing Environment (DCE) has evolved to ad...
详细信息
ISBN:
(纸本)0818677589
distributedcomputing involves systems that operate across networks transparently, using the resources of multiple machines. the Open Software Foundation's distributedcomputing Environment (DCE) has evolved to address the need for a vendor-neutral platform to which distributed applications can be developed, and upon which they can run. Central to the design philosophy of DCE is its reliance on the Remote Procedure Call (RPC) to facilitate communication among the entities in the distributed environment. Since it profoundly affects the performance of boththe DCE environment and applications running on top of it, the performance of RPCs is very much a concern of both application developers and system managers in a DCE installation this short paper reports some results from an ongoing empirical investigation of the OS/2 DCE RPC facility. Our interest in this project is the effect on end-to-end RPC performance of protocol processing, flow control mechanisms within DCE, other load on the network, and interoperation with multiple DCE platforms.
We consider the broadcasting operation in point-to-point packer-switched parallel and distributed networks of processors. We develop a general technique for the design of optimal broadcast algorithms on a wide range o...
详细信息
ISBN:
(纸本)0818680385
We consider the broadcasting operation in point-to-point packer-switched parallel and distributed networks of processors. We develop a general technique for the design of optimal broadcast algorithms on a wide range of such systems. Our technique makes it easier to design such algorithms and, furthermore, provides tools that can be used to derive precise analyses of their running times. As direct applications of this method we give an exact analysis of a known algorithm for the POSTAL model, and design and analyze an optimal broadcast algorithm for the MULTI_PORT MULTI_MEDIA model. We then show how our method can be applied to networks with different underlying topologies, by designing and giving an exact analysis of an optimal broadcast algorithm for the OPTICAL_RING.
parallel and distributed simulation techniques have been investigated in a number of studies as a way to decrease long execution times of personal communication system simulations. However most studies have omitted im...
详细信息
ISBN:
(纸本)0818677589
parallel and distributed simulation techniques have been investigated in a number of studies as a way to decrease long execution times of personal communication system simulations. However most studies have omitted important issues in radio propagation in the simulations. Including these radio propagation issues makes it significantly more difficult to partition a PCS model efficiently. In this paper we consider parallel simulation of PCS models using Time Warp and focus on the partitioning issue. We compare base station based partitioning with channel based partitioning for an F/TDMA system. Analytical and experimental results on a shared memory multiprocessor indicate that for realistic parameters the partitioning per channel will significantly outperform the partitioning per base station.
parallel Genetic Algorithms are suited to deal with problems with very large solution spaces and they can support efficient parallel distribution of work. In a PGA Island Model the migration strategy can take advantag...
详细信息
parallel Genetic Algorithms are suited to deal with problems with very large solution spaces and they can support efficient parallel distribution of work. In a PGA Island Model the migration strategy can take advantage of high latency communication channels in a distributed system. this approach suggests the use of networked workstation environments as a cost effective alternative to MPP systems. A Genetic Algorithm Programming System (GAPS) was developed to evaluate the proposed approach, which supports the design of parallel genetic programs and its execution in a distributed workstation environment. GAPS separates the specification of the problem and the user application interface, from the implementation and management details of the run-time environment;it also addresses fault tolerance, needed to recover from a fault that may occur in a dynamic network of heterogeneous workstations. GAPS uses PVM to implement a structural load balance strategy, which distributes complex evaluation functions with large chromosomes across a parallel machine. the proposed system showed to be effective when tested withthe knapsack problem.
the Laplace transform in time has been shown to provide an excellent alternative to the finite difference method for the solution of parabolic problems associated with partial differential equations. An implementation...
详细信息
the Laplace transform in time has been shown to provide an excellent alternative to the finite difference method for the solution of parabolic problems associated with partial differential equations. An implementation of the Laplace transform method in a parallel environment can provide a concurrent solution process with no communication overhead. the Laplace transform in time, when applied to the diffusion problem, results in a modified Helmholtz equation in the transform space. the diffusion problem is solved in a parallel environment in which the elliptic problem in transform space is solved using finite differences, finite elements, boundary elements, the method of fundamental solutions and Kansa's multiquadric method.
Load balancing is an important component in improving the efficiency of distributed systems because it distributes an even workload over all processors. this paper considers the problem of load balancing a conservativ...
详细信息
Load balancing is an important component in improving the efficiency of distributed systems because it distributes an even workload over all processors. this paper considers the problem of load balancing a conservative parallel simulation for execution on a multi-computer. the synchronization protocol makes use of Chandy-Misra null-messages. Earlier study conducted by Boukerche and Tropper showed that static load balancing for consecutive parallel simulation is effective when the workload can be sufficiently well characterized beforehand. In this paper, we present a dynamic load balancing algorithm which assumes no compile time knowledge about the workload parameters. It is based upon a process migration mechanism, and the notion of CPU-queue length, which indicates the workload at each processor. We discuss the algorithm, its implementation, and report on the performance results of simulation of FCFS queueing network models on an Intel Paragon A4.
Solving large computationally intensive problems requires significant processing power and the current trend in achieving this power is not by increasing the throughput of individual processors, but to sub-divide the ...
详细信息
Solving large computationally intensive problems requires significant processing power and the current trend in achieving this power is not by increasing the throughput of individual processors, but to sub-divide the problem into co-operating tasks so that many processors may be used to solve the problem. Stand-alone workstations, such as the PC and the SUN machines, delivering tens of millions of operations per second are common place, but to achieve high parallel efficiency, distributed systems must support rapid communication between a large number of processors on a single coherent network. parallel programming packages have been developed to assist in parallel program development, such as the parallel Virtual Machine (PVM) and High Performance Fortran (HPF). In this paper we present an analysis of PVM and HPF within the context of the boundary element method. Domain decomposition is used to sub-divide and distribute a two-dimensional potential problem onto a collection of networked stand-alone workstations using PVM and HPF. We observe that the development of parallel applications using HPF is very efficient and straight forward when compared with PVM. However, PVM offers a better performance efficiency and a greater degree of freedom than HPF, since PVM allows both coarse and fine-grained parallelism. the performance of PVM and HPF are further compared withthat of the 3L parallel Fortran on a T800 transputer network.
暂无评论