检索结果-内蒙古大学图书馆

An efficient virtual machine allocation algorithm for parallel and distributed simulation applications

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2019年第17期31卷 e5237-e5237页

作者： Yao, Feng Yao, Yiping Chen, Huangke Li, Tianlin Lin, Menglong Zhang, Xiaoxiong Natl Univ Def Technol Coll Syst Engn Changsha 410073 Hunan Peoples R China Univ Alberta Dept Elect & Comp Engn Edmonton AB Canada Univ Waterloo Dept Syst Design Engn Waterloo ON Canada Natl Univ Def Technol Changsha Hunan Peoples R China

Allocating appropriate resource for parallel and distributed simulation (PADS) applications in clouds is an intuitive way to improve their execution efficiency. However, the heterogeneity of virtual machine (VMs) in clouds with respect to both their computing power and network latency influences the execution efficiency of PADS applications on different combinations of VMs. Besides, frequent synchronization is one of the characteristics during the execution of PADS applications, which seriously challenges the prediction of the influence of VMs' computing power and network latency on their execution efficiency, and makes allocating appropriate VMs difficult as a result. This paper first proposes a revivification-based prediction model (ERP), which revives the execution based on statistical data from actual execution of PADS applications to predict the running time of PADS applications on different combinations of VMs. Then, an ERP-based Allocation algorithm, namely, ERPA, is raised to optimize VMs allocation to minimize the running time of PADS applications in clouds. A series of experiments are conducted to compare the proposed ERPA with three resource allocation algorithms, ie, Gang-scheduling-based, Makespan-based, and Max-Min-based algorithms, and the experimental results demonstrate the advantage of ERPA in improving execution efficiency of PADS applications in clouds. In particular, for communication-sensitive PADS applications, the advantage of ERPA is more significant.

关键词： execution revivification parallel and distributed simulation performance prediction resource allocation

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of parallel and distributed wargame simulation system and its evaluation

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2001年第10期E84D卷 1376-1384页

作者： Ozaki, A Furuichi, M Takahashi, K Matsukawa, H Mitsubishi Electr Corp Commun Syst Ctr Amagasaki Hyogo 6618661 Japan Mitsubishi Electr Corp Informat Technol R&D Ctr Kamakura Kanagawa 2478501 Japan Mitsubishi Electr Corp Kamakura Works Kamakura Kanagawa 2478520 Japan

simulation based education and training, especially wargame simulations, are being used widely in the field of defense modeling and in simulation communities. In order to efficiently train students and trainees, the wargame simulations must have both high performance and high fidelity In this paper, we discuss design and implementation issues for a prototype of a parallel and distributed wargame simulation system. This wargame simulation system is based on High Level Architecture (HLA) and employs some optimization to achieve both high performance and high fidelity in the simulation system. The results show that the proposed optimization method is effective when optimization is applied to 93.5% or less of the moving objects (PFs) within the range of detection (RofD) of both the red and blue teams. Specifically, when each team has 1000 PFs we found that if the percentage of PFs within RofD is less than 50% for both teams, our method is over two times better than for the situation where there is no optimization.

关键词： parallel and distributed simulation HLA wargame model design interactive simulation

来源：评论

学校读者我要写书评

暂无评论

Care HPS: A high performance simulation tool for parallel and distributed agent-based modeling

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2017年 68卷 59-73页

作者： Borges, Francisco Gutierrez-Milla, Albert Luque, Emilio Suppi, Remo Univ Autonoma Barcelona Dept Comp Architecture & Operating Syst Sch Engn Campus Bellaterra E-08193 Barcelona Spain

parallel and distributed simulation is a powerful tool for developing complex agent-based simulation. Complex simulations require parallel and distributed high performance computing solutions. It is necessary because their sequential solutions are not able to give answers in a feasible total execution time. Therefore, for the advance of computing science, it is important that High Performance Computing (HPC) techniques and solutions be proposed and studied. In literature, we can find some agent-based modeling and simulation tools that use HPC. However, none of these tools are designed to enable the HPC expert to be able to propose new techniques and solutions without great effort. In this paper, we introduce Care High Performance simulation (HPS), which is a scientific instrument that enables researchers to: (1) develop techniques and solutions of high performance distributed simulations for agent-based models;and, (2) study, design and implement complex agent-based models that require HPC solutions. Care HPS was designed to easily and quickly develop new agent-based models. It was also designed to extend and implement new solutions for the main issues of parallel and distributed solutions such as: synchronization, communication, load and computing balancing, and partitioning algorithms. We conducted some experiments with the aim of showing the completeness and functionality of Care HPS. As a result, we show that Care HPS can be used as a scientific instrument for the advance of the agent-based parallel and distributed simulations field. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Agent-based model Agent-based modeling and simulation High performance simulation High performance computing parallel and distributed simulation

来源：评论

学校读者我要写书评

暂无评论

Strip Partitioning for Ant Colony parallel and distributed Discrete-Event simulation

Strip Partitioning for Ant Colony Parallel and Distributed D...

引用

15th Annual International Conference on Computational Science (ICCS)

作者： Borges, Francisco Gutierrez-Milla, Albert Suppi, Remo Luque, Emilio Univ Autonoma Barcelona Dept Comp Architecture & Operating Syst E-08193 Barcelona Spain

Data partitioning is one of the main problems in parallel and distributed simulation. Distribution of data over the architecture directly influences the efficiency of the simulation. The partitioning strategy becomes a complex problem because it depends on several factors. In an Individual-oriented Model, for example, the partitioning is related to interactions between the individual and the environment. Therefore, parallel and distributed simulation should dynamically enable the interchange of the partitioning strategy in order to choose the most appropriate partitioning strategy for a specific context. In this paper, we propose a strip partitioning strategy to a spatially dependent problem in Individual-oriented Model applications. This strategy avoids sharing resources, and, as a result, it decreases communication volume among the processes. In addition, we develop an objective function that calculates the best partitioning for a specific configuration and gives the computing cost of each partition, allowing for a computing balance through a mapping policy. The results obtained are supported by statistical analysis and experimentation with an Ant Colony application. As a main contribution, we developed a solution where the partitioning strategy can be chosen dynamically and always returns the lowest total execution time.

关键词： parallel and distributed simulation parallel discrete-event simulation High performance distributed simulation Strip Partitioning Individual-oriented Model

来源：评论

学校读者我要写书评

暂无评论

Strip Partitioning for Ant Colony parallel and distributed Discrete-event simulation

引用

Procedia Computer Science 2015年 51卷 483-492页

作者： Francisco Borges Albert Gutierrez-Milla Remo Suppi Emilio Luque Department of Computer Architecture & Operating Systems Universitat Autonoma de Barcelona Bellaterra 08193 Barcelona Spain

关键词： parallel and distributed simulation parallel discrete-event simulation High performance distributed simulation Strip Partitioning Individual-oriented Model

来源：评论

学校读者我要写书评

暂无评论

Transparent three-phase Byzantine fault tolerance for parallel and distributed simulations

引用

simulation MODELLING PRACTICE AND THEORY 2016年 60卷 90-107页

作者： Li, Zengxiang Cai, Wentong Turner, Stephen John Qin, Zheng Goh, Rick Siow Mong Inst High Performance Comp Singapore 138632 Singapore Nanyang Technol Univ Singapore 639798 Singapore

A parallel and distributed simulation (federation) is composed of a number of simulation components (federates). Since the federates may be developed by different participants and executed on different platforms, they are subject to Byzantine failures. Moreover, the failure may propagate in the federation, resulting in epidemic effect. In this article, a three-phase (i.e., detection, location, and recovery) Byzantine Fault Tolerance (BFT) mechanism is proposed based on a transparent middleware approach. The replication, checkpointing and message logging techniques are integrated in the mechanism for the purpose of enhancing simulation performance and reducing fault tolerance cost. In addition, mechanisms are provided to remove the epidemic effects of Byzantine failures. Our experiments have verified the correctness of the three-phase BFT mechanism and illustrated its high efficiency and good scalability. For some simulation executions, the BFT mechanism may even achieve performance enhancement and Byzantine fault tolerance simultaneously. (C) 2015 Elsevier B.V. All rights reserved.

关键词： parallel and distributed simulation Byzantine fault tolerance Replication Checkpoint Epidemic effect Time synchronization

来源：评论

学校读者我要写书评

暂无评论

Using Programmable P4 Switches to Reduce Communication Costs of parallel and distributed simulations

Using Programmable P4 Switches to Reduce Communication Costs...

引用

IEEE Global Communications Conference (GLOBECOM)

作者： Wang, Shie-Yuan Kuo, Nai-En Natl Yang Ming Chiao Tung Univ Dept Comp Sci Hsinchu Taiwan

ISBN: (纸本)9781665435406

In the past, several time synchronization methods have been proposed for parallel and distributed simulation (PDS). Among them, one widely used conservative method is the Chandy-Misra-Bryant (CMB) algorithm. In the CMB algorithm, many null messages may be exchanged among logical processes to advance their clocks so that deadlock will not occur among them. In this work, using a data-plane programmable P4 hardware switch, we design and implement a data fusion-based approach inside the packet processing pipeline of the P4 switch. Our approach extracts the timestamp carried in exchanged null messages, computes the fusion results of these timestamps, drops unnecessary null messages inside the switch, generates new messages carrying the fusion results, and sends these generated messages to only the logical processes that can benefit from receiving these messages. Experimental results show that on an 8-host testbed, our approach can speed up a PDS by a factor of 2.75 and 1.65 when compared with the unicast and multicast approaches, respectively.

关键词： software-defined network P4 data-plane programmable switch parallel and distributed simulation

来源：评论

学校读者我要写书评

暂无评论

Efficient Master/Worker parallel Discrete Event simulation on Metacomputing Systems

引用

IEEE TRANSACTIONS ON parallel AND distributed SYSTEMS 2012年第5期23卷 873-880页

作者： Park, Alfred J. Fujimoto, Richard M. Oak Ridge Natl Lab Computat Sci & Engn Div Oak Ridge TN 37831 USA Georgia Inst Technol Coll Comp Computat Sci & Engn Div Atlanta GA 30332 USA

The master/worker (MW) paradigm can be used as an approach to parallel discrete event simulation (PDES) on metacomputing systems. MW PDES applications incur overheads not found in conventional PDES executions executing on tightly coupled machines. We introduce four optimization techniques in MW PDES systems on public resource and desktop grid infrastructures. Work unit caching, pipelined state updates, expedited message delivery, and adaptive work unit scheduling mechanisms in the context of MW PDES are described. These optimizations provide significant performance benefits when used in tandem. We present results showing that an optimized MW PDES system using these techniques can exhibit performance comparable to a traditional PDES system for queueing network and particle physics simulation applications while providing execution capability across metacomputing systems.

关键词： Discrete event simulation metacomputing systems parallel and distributed simulation simulation support systems master/worker

来源：评论

学校读者我要写书评

暂无评论

A framework for formalization and strictness analysis of simulation event orderings

引用

simulation-TRANSACTIONS OF THE SOCIETY FOR MODELING AND simulation INTERNATIONAL 2005年第4期81卷 325-335页

作者： Teo, YM Onggo, BSS Singapore Massachusetts Inst Technol Alliance Singapore 117576 Singapore Natl Univ Singapore Dept Comp Sci Singapore 117543 Singapore

This article advocates the use of a formal framework for analyzing simulation performance. simulation performance is characterized based on the three simulation development process boundaries: physical system, simulation model, and simulator implementation. First, the authors formalize simulation event ordering using partially ordered set theory. A simulator implements a simulation event ordering and incurs implementation overheads when enforcing event ordering at runtime. Second, they apply their formalism to extract and formalize the simulation event orderings of both sequential and parallel simulations. Third, they propose the relation stricter and a measure called strictness for comparing and quantifying the degree of event dependency of simulation event orderings, respectively. In contrast to the event parallelism measure, strictness is independent of time.

关键词： parallel and distributed simulation formalization event ordering strictness partially ordered set

来源：评论

学校读者我要写书评

暂无评论

An empirical evaluation of performance-memory trade-offs in Time Warp

引用

IEEE TRANSACTIONS ON parallel AND distributed SYSTEMS 1997年第2期8卷 210-224页

作者： Das, SR Fujimoto, RM GEORGIA INST TECHNOL COLL COMPATLANTAGA 30332

The performance of the Time Warp mechanism is experimentally evaluated when only a limited amount of memory is available to the parallel computation. An implementation of the cancelback protocol is used for memory management on a shared memory architecture, viz., KSR to evaluate the performance vs. memory tradeoff. The implementation of the cancelback protocol supports canceling back more than one memory object when memory has been exhausted (the precise number is referred to as the salvage parameter) and incorporates a non-work-conserving processor scheduling technique to prevent starvation. Several synthetic and benchmark programs are used that provide interesting stress cases for evaluating the limited memory behavior. The experiments are extensively monitored to determine the extent to which various factors may affect performance. Several observations are made by analyzing the behavior of Time Warp under limited memory: 1) Depending on the available memory and asymmetry in the workload, canceling back several memory objects at one time (i.e., a salvage parameter value of more than one) improves performance significantly, by reducing certain overheads. However, performance is relatively insensitive to the salvage parameter except at extreme values. 2) The speedup vs. memory curve for Time Warp programs has a well-defined knee before which speedup increases very rapidly with memory and beyond which there is little performance gain with increased memory;3) A performance nearly equivalent to that with large amounts of memory can be achieved with only a modest amount of additional memory beyond that required for sequential execution, if memory management overheads are small compared to the event granularity. These results indicate that contrary to the common belief, memory usage by Time Warp can be controlled within reasonable limits without any significant loss of performance.

关键词： discrete event simulation parallel and distributed simulation virtual time Time Warp rollback checkpointing memory management performance evaluation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：