Cellular automata (CA) are fully parallel computational models and are widely applied to numerical modelling for many complex systems or nonlinear systems, such as fluid dynamics. Those systems are often governed by n...
详细信息
ISBN:
(纸本)0818674601
Cellular automata (CA) are fully parallel computational models and are widely applied to numerical modelling for many complex systems or nonlinear systems, such as fluid dynamics. Those systems are often governed by nonlinear partial differential equations which are hard to solve by using traditional numerical methods. In this paper, based on CA, a general model for a kind of evolutionary physics systems is proposed. As an example, a CA-like model for nonlinear parabolic equation is built by using multi-scalar analysis. The model is applied to several typical problems and satisfactory results are achieved.
Simulation is an application area for which high speed computation is critical. Massive parallel computers have appeared so that it is now possible to execute very large-scale and complicated simulation without sacrif...
详细信息
Simulation is an application area for which high speed computation is critical. Massive parallel computers have appeared so that it is now possible to execute very large-scale and complicated simulation without sacrificing accuracy and simplifying problems. For a kind of problems in which the computation in each element depends on the data of all the other elements, a completely-connected network is required in order to simulate with high efficiency. However in massive parallel computers, efficient simulation of these problems is difficult to realize. Its cause is due to their network structure. In this paper, a new network topology which solves these problems with high efficiency and a computation method based on the topology are described.
A universal spatial automaton, called WAVE, for highly parallel processing in arbitrary distributed systems is described. The automaton is based on a virus principle where recursive programs, or waves, self-navigate i...
详细信息
ISBN:
(纸本)0818675829
A universal spatial automaton, called WAVE, for highly parallel processing in arbitrary distributed systems is described. The automaton is based on a virus principle where recursive programs, or waves, self-navigate in networks of data or processes in multiple cooperative parts while controlling and modifying the environment they exist in and move through. The layered general organisation of the automaton as well as its distributed implementation in computer networks have been discussed. As the automaton dynamically creates, modifies, activates and processes any knowledge networks arbitrarily distributed in computer networks, it can easily model any other paradigms for parallel and distributed computing. Comparison of WAVE with some known programming models and languages, and ideas of their possible integration have also been given.
One of the major impediments to the widespread use of large-scale, distributed memory multiprocessors is the difficulty of efficiently partitioning and mapping application algorithms onto these machines so as to extra...
详细信息
One of the major impediments to the widespread use of large-scale, distributed memory multiprocessors is the difficulty of efficiently partitioning and mapping application algorithms onto these machines so as to extract a large portion of the machines' peak performance. In this paper, we present the preliminary accomplishments of an ongoing effort aimed at automating the complex tasks of software partitioning and mapping during the system definition phase of application development for distributed memory multiprocessors. We describe a technique called the Augmented Task Dependency Graph (ATDG) for representing the high-level design of the application software. The ATDG allows one to express functional parallelism as well as data parallelism in a manner that facilitates automated partitioning and mapping. We propose a new strategy for searching through the possible space of design choices for partitioning and mapping. The proposed approach, called hierarchical hybrid search, organizes the search space as a hierarchy of sub-spaces. It permits the use of different search techniques for searching through different search sub-spaces. Examples of search techniques that could be employed in the proposed approach include hill-climbing, simulated annealing, and genetic algorithms.
With the proliferation of parallel system and the advances obtained in interprocedural analysis, exploiting functional parallelism has been attracted much attentions. This paper proposes a technique PRG for reference ...
详细信息
ISBN:
(纸本)0780335295
With the proliferation of parallel system and the advances obtained in interprocedural analysis, exploiting functional parallelism has been attracted much attentions. This paper proposes a technique PRG for reference analysis, and the idea of using PRG to detect procedure level parallelism in C++ programs is stated. Finally, the C++ implementation of virtual function considered in parallelism detection.
In this paper we present a robust scalable parallelization of a multitarget tracking algorithm developed for air traffic surveillance. We couple the state estimation and data association problems by embedding an Inter...
详细信息
ISBN:
(纸本)0818675829
In this paper we present a robust scalable parallelization of a multitarget tracking algorithm developed for air traffic surveillance. We couple the state estimation and data association problems by embedding an Interacting Multiple Model (IMM) state estimator into an optimization-based assignment framework. A SPMD distributed-memory parallelization is described, wherein the interface to the optimization problem, namely, computing the rather numerous gating and IMM state estimates, covariance calculations, and likelihood function evaluations (used as cost coefficients in the assignment problem), is parallelized. We describe several heuristic algorithms developed for the inherent task allocation problem, where in the problem is one of assigning track tasks, having uncertain processing costs and negligible communication costs, across a set of homogeneous processors to minimize workload imbalances. Using a measurement database based on two FAA air traffic control radars, courtesy of Rome Laboratory, we show that near linear speedups are obtainable on a 32-node Intel Paragon supercomputer using simple task allocation algorithms.
This paper presents the compilation technique to support the P&M (pipelining and multithreading) multithreaded program execution model on the SPARC processor, which has cyclic register windows. The program executi...
详细信息
ISBN:
(纸本)0818674601
This paper presents the compilation technique to support the P&M (pipelining and multithreading) multithreaded program execution model on the SPARC processor, which has cyclic register windows. The program execution model improves the performance by running multiple user-level threads on each processor and filling the idle cycles that would otherwise be wasted waiting for messages. The integrated compilation paradigm is described systematically. The generated code is efficient, which obtains rapid context switching without sacrificing the benefit of fast procedure call.
The growing interest in using clusters of workstations as the target platform for high-performance applications, has again emphasized the need for support tools that can be used during application design. In this pape...
详细信息
The growing interest in using clusters of workstations as the target platform for high-performance applications, has again emphasized the need for support tools that can be used during application design. In this paper we present a graphical technique, called ADL-D, that allows a developer to construct an application in terms of communicating processes. The technique distinguishes itself from others by its use of highly orthogonal concepts, and the support for automated code generation. Developers are encouraged to concentrate on designing components in isolation, making the complex design space more manageable than would otherwise be the case. ADL-D can be used from the early phases of application design through phases that concentrate on algorithmic design, and final implementation on some target platform. Rather than presenting details of ADL-D, we use it here as a vehicle for a more general discussion on design level support for parallel and distributed applications. In this discussion, an emphasis is put on the design of dynamic communication structure, i.e. structures that can change during runtime.
Data parallelism is often seen as a form of explicit parallelism for SIMD and vector machines, and data parallelprogramming as an explicit programming paradigm for these architectures. Data parallel languages possess...
详细信息
The proceedings contains 67 papers. Topics discussed include multimedia systems, parallel processing systems, distributed and parallelprogramming, metacomputing track, user interfaces, broadband networks, computer wo...
详细信息
The proceedings contains 67 papers. Topics discussed include multimedia systems, parallel processing systems, distributed and parallelprogramming, metacomputing track, user interfaces, broadband networks, computer workstations, computer programming language and algorithms, quality of service, distributed shared memory, network protocols, input/output systems and data storage, wide area distribution systems, asynchronous transfer mode networks.
暂无评论