首页> 外文学位 >DISTRIBUTED SIMULATION, ALGORITHMS AND PERFORMANCE ANALYSIS (LOAD BALANCING, DISTRIBUTED PROCESSING)
【24h】

DISTRIBUTED SIMULATION, ALGORITHMS AND PERFORMANCE ANALYSIS (LOAD BALANCING, DISTRIBUTED PROCESSING)

机译:分布式仿真,算法和性能分析(负载平衡,分布式处理)

获取原文
获取原文并翻译 | 示例

摘要

Simulation is one example of an application that shows great potential benefits from distributed processing. The conventional approach to simulation, that of sequentially processing the events, does not exploit the natural parallelism existing in some simulation models. This is particularly true in large models, where submodels often interact weakly and can be simulated in parallel. The decreasing cost of multiprocessor systems also suggests that a distributed approach to simulation can be workable. Moreover, such an approach can be very attractive, since time and memory limitations, often major constraints with simulation programs, may be alleviated by distributing the load among several processors.;Distributed simulation requires a set of processors that can communicate by sending messages along the links of a communication network or via a shared memory. The processors each simulate a submodel of the overall model and interact when necessary. Submodel interactions produce the interprocessor communication in the simulator.;Two methods for distributed simulation are studied in this thesis. Both methods are applicable to discrete time simulation models and are fully distributed in the sense that they require no central control. In one method, each processor can simulate independently as long as it is certain that no events will arrive that belongs to the past of the simulation process. In the second method, processors are not concerned about future arriving events. They simulate independently and roll back if an event arrives that belongs to the past.;The thesis consists of two parts. The first presents some centralized and distributed algorithms for efficient utilization of the second method. The issue of load balancing is also discussed in this part and some heuristic algorithms are presented.;The second part of the work consists of mathematical modeling and analysis of models of both methods. The analysis gives some insight into the effects of different system parameters on the performance. The performance of each method is compared with the other and also with single processor simulation. The mathematical models are then confirmed and complemented with the simulation results. Finally, results of the implementation of the second method are presented.
机译:仿真是应用程序的一个示例,它显示了分布式处理的巨大潜在优势。传统的模拟方法(顺序处理事件)没有利用某些模拟模型中存在的自然并行性。这在大型模型中尤其如此,在大型模型中,子模型通常相互作用较弱,可以并行模拟。多处理器系统成本的降低也表明,分布式仿真方法是可行的。此外,这种方法可能非常有吸引力,因为时间和内存限制(通常是仿真程序的主要限制)可以通过在多个处理器之间分配负载来缓解。分布式仿真需要一组处理器,这些处理器可以通过沿处理器发送消息进行通信。通信网络或通过共享内存的链接。每个处理器都模拟整个模型的子模型,并在必要时进行交互。子模型的交互在模拟器中产生处理器间的通信。本文研究了两种分布式仿真方法。两种方法都适用于离散时间仿真模型,并且在不需要中央控制的意义上说是完全分布式的。在一种方法中,每个处理器可以独立进行仿真,只要可以确定不会出现属于仿真过程过去的事件即可。在第二种方法中,处理器不关心将来的到达事件。它们独立地进行模拟,并在属于过去的事件到来时回滚。论文由两部分组成。第一种方法提供了一些集中式和分布式算法,可有效利用第二种方法。本部分还讨论了负载平衡的问题,并提出了一些启发式算法。第二部分工作包括数学建模和两种方法模型的分析。通过分析,可以深入了解不同系统参数对性能的影响。将每种方法的性能与其他方法以及单处理器仿真进行了比较。然后确定数学模型并与仿真结果互补。最后,介绍了第二种方法的实现结果。

著录项

  • 作者

    SAMADI, BEHROKH.;

  • 作者单位

    University of California, Los Angeles.;

  • 授予单位 University of California, Los Angeles.;
  • 学科 Computer science.
  • 学位 Ph.D.
  • 年度 1985
  • 页码 240 p.
  • 总页数 240
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号