共查询到20条相似文献,搜索用时 15 毫秒
1.
随着系统规模的不断扩大,系统复杂度大大提高,采用单一的仿真程序已不能满足大规模复杂系统仿真的需求,采用分布式结构进行雷达系统仿真逐渐成为一种解决复杂系统仿真的主要方法。仿真引擎机制的研究是雷达仿真系统设计的关键,有利于深化和提升雷达仿真的效率。阐述了雷达仿真系统模型,采用分布式结构,提出了基于消息服务中心MSC和运行监控中心SC两层控制结构的仿真引擎机制,将用户接口服务与消息传递服务分离开来,增强了雷达仿真软件的灵活性和易操作性。在这种机制下,进一步提出了消息传递算法MPA并进行了系统性能测试和验证,仿真实验结果表明,MPA算法可以快速、可靠地实现雷达系统内部各执程体间的互连互通,准确地完成雷达仿真过程的控制与监视。 相似文献
2.
High‐performance application development remains challenging, particularly for scientists making the transition to a heterogeneous grid environment. In general areas of computing, virtual environments such as Java and .Net have proved to be successful in fostering application development, allowing users to target and compile to a single environment, rather than a range of platforms, instruction sets and libraries. However, existing runtime environments are focused on business and desktop computing and they do not support the necessary high‐performance computing (HPC) abstractions required by e‐Scientists. Our work is focused on developing an application‐runtime that can support these services natively. The result is a new approach to the development of an application‐runtime for HPC: the Motor system has been developed by integrating a high‐performance communication library directly within a virtual machine. The Motor message passing library is integrated alongside and in cooperation with other runtime libraries and services while retaining a strong message passing performance. As a result, the application developer is provided with a common environment for HPC application development. This environment supports both procedural languages, such as C, and modern object‐oriented languages, such as C#. This paper describes the unique Motor architecture, presents its implementation and demonstrates its performance and use. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
3.
4.
T. Fahringer K. Sowa‐Pieko P. Czerwiski P. Brezany M. Bubak R. Koppler R. Wismüller 《Concurrency and Computation》2002,14(2):103-136
Debuggers play an important role in developing parallel applications. They are used to control the state of many processes, to present distributed information in a concise and clear way, to observe the execution behavior, and to detect and locate programming errors. More sophisticated debugging systems also try to improve understanding of global execution behavior and intricate details of a program. In this paper we describe the design and implementation of SPiDER, which is an interactive source‐level debugging system for both regular and irregular High‐Performance Fortran (HPF) programs. SPiDER combines a base debugging system for message‐passing programs with a high‐level debugger that interfaces with an HPF compiler. SPiDER, in addition to conventional debugging functionality, allows a single process of a parallel program to be expected or the entire program to be examined from a global point of view. A sophisticated visualization system has been developed and included in SPiDER to visualize data distributions, data‐to‐processor mapping relationships, and array values. SPiDER enables a programmer to dynamically change data distributions as well as array values. For arrays whose distribution can change during program execution, an animated replay displays the distribution sequence together with the associated source code location. Array values can be stored at individual execution points and compared against each other to examine execution behavior (e.g. convergence behavior of a numerical algorithm). Finally, SPiDER also offers limited support to evaluate the performance of parallel programs through a graphical load diagram. SPiDER has been fully implemented and is currently being used for the development of various real‐world applications. Several experiments are presented that demonstrate the usefulness of SPiDER. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
5.
6.
With the use of state and memory reduction techniques in verification by explicit state enumeration, runtime becomes a major limiting factor. We describe a parallel version of the explicit state enumeration verifier Mur for distributed memory multiprocessors and networks of workstations using the message passing paradigm. In experiments with three complex cache coherence protocols on an Sp2 multiprocessor and on a network of workstations at UC Berkeley, parallel Mur shows close to linear speedups, which are largely insensitive to communication latency and bandwidth. There is some slowdown with increasing communication overhead, for which a simple yet relatively accurate approximation formula is given. Techniques to reduce overhead and required bandwidth and to allow heterogeneity and dynamically changing load in the parallel machine are discussed, which we expect will allow good speedups when using conventional networks of workstations. 相似文献
7.
Distributed Model Checking (DMC) is based on several distributed algorithms, which are often complex and error prone. In this paper, we consider one fundamental aspect of DMC design: message passing communication, the implementation of which presents hidden tradeoffs often dismissed in DMC related literature. We show that, due to such communication models, high level abstract DMC algorithms might face implicit pitfalls when implemented concretely. We illustrate our discussion with a generic distributed state space generation algorithm. 相似文献
8.
9.
随着许多工程领域的计算量在不断加大,就提出了并行计算技术问题。而在目前高性能计算机系统中,最广泛使用的一种标准是MPI,它已成为一种并行程序的标准。MPI的理念就是需要将问题的并行求解算法转化为特定的适合并行计算模型的并行算法。麦克斯韦旋度方程的数值分析有多种方法,但其中的时域有限差分法是一种较好的方法。在用时域有限差分法进行数值计算时,需要进行大量的数据采集与计算。在这里,采用并行的方法给予实现,提高计算速度。 相似文献
10.
PVM并行调试环境的现状与技术分析 总被引:1,自引:0,他引:1
本文通过分析目前并行调试技术的研究和发展,阐述了并行调试环境所应具备的基本功能,并在此基础上探讨了PVM并行调试环境的设计和关键技术。 相似文献
11.
为实现机场管理信息系统(AMIS)中各业务子系统之间互操作和无缝连接,基于JMS规范的消息系统首先需要解决的就是消息可靠性问题,在针对JMS规范的两种消息传递模型,结合机场消息中事件固有的先后顺序关系,提出了一种更高效更适合机场业务的保障消息可靠性的方法,并给予了实现。 相似文献
12.
Cluster architectures are increasingly used to solve high‐performance computing applications. To build more computational power, sets of clusters, interconnected by high‐speed networks, can be used in an elaboration to form a cluster grid. In this type of architecture, it is difficult to exploit all the internal resources of a cluster, because each one can be shielded by a firewall and is usually configured with machines where there is only one visible IP front‐end node that hides all its internal nodes from the external world. The exploitation of resources is even more complicated if we consider the general case where each internal node of a cluster can be a front‐end node of an another cluster. This type of architecture has been defined as a multilayer cluster grid. In this paper, a Parallel Virtual Machine (PVM) extension is presented which, through a middleware solution based on the H2O distributed metacomputing framework, permits the building of a parallel virtual machine in a multilayer cluster grid environment. In addition, the existing code written for PVM can be executed into this environment without modifications. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
13.
传统并行软件系统的设计和实现存在着开发效率低、质量难以保证和可移植性差等问题。针对这些问题,采用开发标准并行库的方法加以解决。借鉴高性能嵌入式计算软件计划(high performance embedded computing software initiative,HPEC_SI)的解决方法,基于消息传递接口(message passing interface,MPI)的消息传递机制,对图像/信号处理中的一些典型并行算法以类组件的方式进行封装,设计和实现了具有面向对象特征的、用于图像/信号处理的并行向量库,提供给应用软件开发人员一个良好的开发环境。通过测试和实验证明,该库可以高效地实现相应的向量矩阵并行算法,并具有简单易用、可复用性和可移植性强、效率高的特点。 相似文献
14.
John S. Conery 《LISP and Symbolic Computation》1994,7(1):111-133
Continuations are used to define the flow of messages between low level tasks in a parallel logic programming language. A combination of compiler and runtime operations reduces message traffic by up to 50% when success continuations are passed as parameters in messages that start new processes. Continuations are also the key to fast task switching, a critical operation in this fine grain parallel system. Data from sample programs shows the effectiveness of continuations in reducing message traffic and the speed with which task switches are performed on a typical host architecture.Supported by NSF Grant CCR-8707177 and grants from Motorola, Inc, and Hewlett-Packard Corp. 相似文献
15.
《International Journal of Parallel, Emergent and Distributed Systems》2012,27(4):291-303
In the past few years, there have been significant developments in the area of distributed and parallel processing. More powerful and new hardware architectures are being produced at a rapid rate, such as distributed-memory MIMD computers, which have provided enormous computing power to the software engineers. These multiprocessors may provide a significant speed-up over the serial execution of an algorithm. However, this requires careful partitioning and allocation of data and control to the processor set. Matrix multiplication is a fundamental parallel algorithm which can be effectively executed on a distributed-memory multiprocessor and can show significant improvement in the speed-up over the serial execution. Ideally, we should be able to achieve a linear speed up with increase in the number of processors, but in practice the speed up is much less, and in fact increasing the number of processors beyond a certain number may result in degradation of the completion time. This degradation is caused by increased communications between modules. Therefore, the optimum speed-up is a function of the number of processors and the communication cost. To find the optimum performance, a user need to experiment with all the available processors on a multiprocessor. In this paper, we studied the detailed performance of the parallel matrix multiplication algorithm. The study defines the factors that control the performance of this class of algorithms and shows how to use these factors to optimize the algorithm's execution time. Also, an analytic approach is described which can eliminate a trial and effort method to actually determine the size of processor set. 相似文献
16.
对JIAJIA和MPI (message passing interface)是进行了比较.JIAJIA和MPI分别代表共享存储和消息传递的编程模式.MPI显式进行数据传输,编程复杂;JIAJIA由底层维护数据一致性,并附加提供简单的消息传递函数,编程容易、灵活.JIAJIA分配共享内存时开销较大,初始化时间比MPI长.提出了一个关于并行加速比与进程数目之间关系的近似经验公式,推出JIAJIA和MPI性能差距随着进程数目的增多而增大的结论.测试结果表明,大部分应用程序的JIAJIA和MPI版本的并行性能差距不超过10%.对于通信量很小的应用程序,其JIAJIA和MPI的性能差距较小,而通信量本身较大的应用程序,其JIAJIA和MPI的性能差距主要取决于运行时产生的实际通信量. 相似文献
17.
Supporting Cost-Effective Fault Tolerance in Distributed Message-Passing Applications with File Operations 总被引:1,自引:0,他引:1
In this paper we present an approach to reliable distributed computing, which incorporates fault tolerance into applications at low cost, in terms of both run-time performance and programming effort required to construct reliable application software. In our model fault tolerance is based on distributed consistent checkpointing and rollback-recovery integrated with a user-level reliable transmission protocol. By employing novel techniques 8and algorithms, our approach is distinguished from other consistent checkpointing schemes by the following features: first, minimum communication overhead for constructing a consistent distributed checkpoint and catching messages in transit during checkpointing; second, tolerance to message losses due to site failures or unreliable non-FIFO networks; and third, efficient checkpointing and recovery of persistent state, i.e., user files. Based on the model, a software library prototype called Libra has been implemented for supporting fault tolerance in distributed message-passing applications with file operations. The library provides an easy to use programming interface including message-passing and file I/O primitives, which hides the complexity of both fault-tolerant network communications and checkpointing and recovering user files from the application level. Experience with a number of long-running distributed applications shows that Libra can provide fault tolerance in a cost-effective manner. 相似文献
18.
说明如何利用并行自适应有限元软件平台PHG 求解生物分子溶液体系的非线性Poisson-Boltzmann方程,并介绍一种解决这类问题的方法,它将网格生成与自适应计算过程结合在一起,可自动产生合适的网格,避免复杂的曲面网格生成步骤.之前的网格生成工作有:(1) TMSmesh生成高斯曲面的三角网格; (2) TransforMesh删除自相交的三角网格; (3) ISO2Mesh提高表面网格质量3个步骤.而基于PHG的自适应加密模块可以在逐次调整网格的同时保持动态负载平衡,高效地得到计算网格用于近似求解非线性Poisson-Boltzmann方程.计算了小球模型和AChE系统,分别从误差指示子下降阶和溶剂化能收敛的角度验证了方法的有效性,并且还将网格生成算法成功地应用于gA离子通道. 相似文献
19.
针对多片TMS320C64 DSP构成的多计算机体系结构的实时图像识别系统,设计并实现了面向并行图像处理的实时分布式操作系统PIPORTDOS(Parallel image processing-oriented real-time distributed operating system).PIPORTDOS基于微内核体系结构,包括硬件抽象层、系统核心层、分布式消息通信机制和系统服务层四个层次.其多任务内核实现了基于优先级的抢先式调度、任务闻的同步和通信原语、实时的中断处理以及面向应用的缓存管理机制.为了实现对分布式并行图像处理的支持,PIPORTDOS采用了基于消息传递(Message Passing)的方式,并在实现中充分考虑了上层图像处理算法的应用需求以及DSP的硬件功能.相关性能指标表明,本文设计实现的PIPORTDOS完全可以满足系统的强实时性要求.在功能上也能适应算法对不同并行结构的需求. 相似文献
20.
数据重分布是实现消息传递环境下负载平衡的重要手段,提出了数据交错分布的模型问题及模型问题的并行计算模型,分析了模型问题在消息传递环境下的实现,讨论了性能和适用条件,给出了分析结果,讨论了通信与计算的时间重叠问题,将数据交错重分布负载平衡技术应用到非平衡刚性动力学方程组的并行计算中,获得了很好的负载平衡效果。 相似文献