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

PERFORMANCE OF parallel SPANNING TREE ALGORITHMS ON LINEAR ARRAYS OF TRANSPUTERS AND UNIX SYSTEMS

parallel computing 1991年第4-5期17卷 527-551页

作者： DAS, SK YANG, CQ Center for Research in Parallel and Distributed Computing Department of Computer Sciences University of North Texas P.O. Box 13886 Denton TX 76203-3886 USA

This paper presents empirical performance of parallel algorithms for connected graphs on the transputer and Unix systems, where processes are configured as a one-dimensional array. We conduct experiments for implementing (i) spanning tree algorithm (SPT-list) with unordered list of edges as input, (ii) SPT algorithm with adjacency matrix, (iii) minimum spanning tree algorithm (MST) with weight matrix as input, and (iv) SPT algorithm derived from MST algorithm by assigning each edge-weight equal to 1. The empirical study is performed with a wide range of random graphs, generated for various (uniformly distributed) edge-densities (d) for a given number (n) of vertices. We plot curves for resulting speedups as functions of n, d, and p. The edge-density d is varied between 0.1 and 0.9;maximum number of vertices (or edges) considered are 300 (or 40 000) and 500 (or 110 000) for transputer and Unix systems, respectively;and the number of processors p varies from 1 through 8 in the transputer system while 1 through 4 in the Unix system. A maximum speedup of 2.98 is obtained on transputers, and that for the Unix system is 3.0. We observe that the speedups of all algorithms vary with increasing number of vertices or edge-density. However, employing more processing units in an algorithm does not necessarily enhance its speedup because of additional communication overhead.

关键词： TRANSPUTERS LINEAR ARRAY PERFORMANCE STUDY parallel GRAPH ALGORITHM SPANNING TREE MINIMUM SPANNING TREE

来源：评论

学校读者我要写书评

暂无评论

Design of an AI framework for MOUTbots

Design of an AI framework for MOUTbots

引用

14th Conference on Behavior Representation in Modeling and Simulation 2005

作者： Shen, Zhuoqian Zhou, Suiping Chin, Chee Yung Luo, Linbo Parallel and Distributed Computing Center School of Computer Engineering Nanyang Technological University Singapore Singapore

ISBN: (纸本)9781604238952

Creating human-like behaviors in a virtual warfare environment is still a challenging task to date. This paper presents our ongoing work on designing an AI framework for the bots in Military Operations on Urban Terrain (MOUT) simulations. Our framework is designed to be flexible, extensible, integrable and independent of simulation platforms. For fast prototyping, the AI framework is implemented on the Unreal Tournament (UT) game engine. A case study has been conducted which shows that the framework is effective and efficient in creating realistic bot behaviors in various combat scenarios.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Cloning agent-based simulation on GPU 15

Cloning agent-based simulation on GPU

引用

3rd ACM Conference on SIGSIM-Principles of Advanced Discrete Simulation, SIGSIM-PADS 2015

作者： Li, Xiaosong Cai, Wentong Turner, Stephen John Parallel and Distributed Computing Center School of Computer Engineering Nanyang Technological University Singapore Singapore

ISBN: (纸本)9781450335836

Simulation cloning is an efficient way to analyze multiple configurations in a parameter exploration task. This paper presents a generic approach to perform incremental agentbased simulation cloning and discusses its implementation on GPU. Compared with the incremental cloning of parallel and distributed simulation (PADS), cloning agent-based simulation (ABS) has new challenges due to the unique way how ABS is executed. In this paper, to support incremental cloning, mechanisms for both actively and passively cloning agents are proposed. A scheme to maintain the correct context of each cloned ABS instance is developed. In addition, a strategy to restrain the propagation of passive cloning in order to maximize computation sharing amongst cloned ABS instances is also investigated. The implementation of our proposed approach on GPU supports concurrent execution of agents within each simulation instance as well as concurrent execution of multiple simulation instances. Performance of the proposed approach is evaluated and analyzed using a case study of an agent-based evacuation simulation on a NVIDIA Quadro 2000 GPU. Our experiment results demonstrate that cloning can significantly speed up the overall parameter exploration task. The proposed approach achieves 2.4 to 5.1 times speedup for parameter exploration tasks containing 8 to 125 simulation instances that evaluate different parameter configurations. © 2015 ACM.

关键词： speedup agent-based simulation gpu cloning

来源：评论

学校读者我要写书评

暂无评论

Evolutionary design of agent-based simulation experiments

Evolutionary design of agent-based simulation experiments

引用

10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011

作者： Decraene, James Lee, Yew Ti Zeng, Fanchao Chandramohan, Mahinthan Cheng, Yong Yong Low, Malcolm Yoke Hean Parallel and Distributed Computing Center School of Computer Engineering Nanyang Technological University Singapore Singapore

ISBN: (纸本)9781618391018

We present CASE (complex adaptive systems evolver), a framework devised to conduct the design of agent-based simulation experiments using evolutionary computation techniques. This framework enables one to optimize complex agent-based systems, to exhibit pre-specified behavior of interest, through the use of multi-objective evolutionary algorithms and cloud computing facilities. Copyright © 2011, International Foundation for Autonomous Agents and Multiagent Systems (***). All rights reserved.

关键词： Design of experiments

来源：评论

学校读者我要写书评

暂无评论

GPU accelerated three-stage execution model for event-parallel simulation 13

GPU accelerated three-stage execution model for event-parall...

引用

2013 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, SIGSIM-PADS 2013

作者： Li, Xiaosong Cai, Wentong Turner, Stephen John Parallel and Distributed Computing Center School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore

ISBN: (纸本)9781450319201

This paper introduces the concept of event-parallel discrete event simulation (DES) and its corresponding implementation on the GPU platform. Inspired by the typical spatial-parallel DES and time-parallel DES, the event-parallel approach on GPU uses each thread to process one of the N events, where N is the total number of events. By taking advantage of the high parallelism of GPU threads, this approach achieves greater speedup. The GPU architecture is adopted in the execution of the event-parallel approach, so as to take advantage of the parallel processing capability provided by the massively large number of GPU threads. A three-stage execution model composing of generating events, sorting events and processing events in parallel is proposed. This execution model achieves good speedup. Compared with the event scheduling approach on CPU, we achieve up to 22.80 speedup in our case study. © 2013 ACM.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

SOAr-DSGrid: Service-oriented architecture for distributed simulation on the grid 06

SOAr-DSGrid: Service-oriented architecture for distributed s...

引用

20th Workshop on Principles of Advanced and distributed Simulation, PADS 2006

作者： Chen, Xinjun Cai, Wentong Turner, Stephen J. Wang, Yong Parallel and Distributed Computing Center School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore

ISBN: (纸本)0769525873

Simulation is a low cost alternative to experimentation on real-world physical systems. Grid technology enables coordinated use of and secure access to distributed computing resources and data sources. The service-oriented architecture (SOA) is an ideal paradigm for next generation computing. The loose coupling among services in the SOA relieves service consumers from detailed knowledge of implementation, implementation language, and execution platform of the services to be consumed. In this paper, we propose a framework for developing a component-based distributed simulation and executing the simulation in a service-oriented architecture on the Grid. This framework consists of the schemas for developing simulation components and simulation applications, and underlying base component service modules for constructing a simulation component as a service. The use of component interfaces and schemas enables collaborative development of simulation applications, and the deployment of simulation components as services takes advantage of the SOA (e.g., loose coupling, heterogeneity, and transport neutrality). This paper discusses the motivation for developing such a framework and describes the details of its development. © 2006 IEEE.

关键词： Computer networks

来源：评论

学校读者我要写书评

暂无评论

On the Complexity of Learning with a Small Number of Nodes

On the Complexity of Learning with a Small Number of Nodes

引用

1992 International Joint Conference on Neural Networks, IJCNN 1992

作者： Parberry, Ian Center for Research in Parallel and Distributed Computing Department of Computer Sciences University of North Texas United States

ISBN: (纸本)0780305590

It is shown that the loading pioblem foi a 6 node neural netwoik with node function set AC^ (that is, the conjunction or disjunction of a subset of the inputs or their complements) is AiV complete. It can be deduced from this observation that the loading problem for a 6 node analog neural network is AfV hard. ©1992 IEEE

关键词：

来源：评论

学校读者我要写书评

暂无评论

Research advances in Automated Red Teaming 10

Research advances in Automated Red Teaming

引用

Proceedings of the 2010 Spring Simulation Multiconference

作者： Decraene, James Zeng, Fanchao Low, Malcolm Yoke Hean Zhou, Suiping Cai, Wentong Parallel and Distributed Computing Center School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore

ISBN: (纸本)9781450300698

We present, combine and apply novel research advances to Automated Red Teaming (ART). ART is an automated vulnerability assessment tool which is employed to uncover the hard-to-predict and potentially critical elements of military operations. ART is principally based on the use of agent-based modelling/simulation, data farming and evolutionary computation. In this paper, we present two distinct computational methods to address multiple issues of ART: constraint handling and computing budget. These novel techniques originate from the research fields of evolutionary computation and cloud computing. These techniques are applied to a military toy model which was developed with the agent-based simulation platform MANA. We then discuss another potential bottleneck of ART: many-objective optimization. The aim of this research is to optimize ART to best assist defense experts in operational analysis and, ultimately, in critical decision making. © 2010 SCS.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

A hybrid interest management mechanism for peer-to-peer networked virtual environments

A hybrid interest management mechanism for peer-to-peer netw...

引用

24th IEEE International parallel and distributed Processing Symposium, IPDPS 2010

作者： Pan, Kec Cai, Wentong Tang, Xueyan Zhou, Suiping Turner, Stephen John Parallel and Distributed Computing Center School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore

ISBN: (纸本)9781424464432

An Interest Management (IM) mechanism eliminates irrelevant status updates transmitted in Networked Virtual Environments (NVE). However, IM itself involves both computation and communication overhead, of which the latter is the focus of this paper. Traditionally, there are area-based and cell-based IM mechanisms. This paper proposes a hybrid IM mechanism for peer-to-peer NVEs, that utilizes the cell-based mechanism to reduce Area-Of-Interest (AOI) updates in the area-based mechanism so as to reduce its communication overhead. To compare the new mechanism with the two traditional approaches, a multiplayer game scenario is simulated. The performance results show that, compared to the traditional mechanisms, the hybrid mechanism reduces the upload bandwidth consumption by more than 25.28 percent, reduces the overhead ratio from more than 67.54 percent to only 25.17 percent, and allows more than 5000 players in the Internet to join the same game with today's network upload bandwidth. © 2010 IEEE.

关键词： Environmental management

来源：评论

学校读者我要写书评

暂无评论

Splitting Overlay Network for Peer-to-Peer-based Massively Multiplayer Online Games 9

Splitting Overlay Network for Peer-to-Peer-based Massively M...

引用

9th International Conference on Innovative Internet Community Systems, I2CS 2009

作者： Liu, Cheng Cai, Wentong Parallel and Distributed Computing Center School of Computer Engineering Nanyang Technological University Singapore639798 Singapore

ISBN: (纸本)9783885792420

Massively Multiplayer Online Games (MMOGs) gradually become one of the most popular internet applications. Traditional client-server architecture is widely used in MMOGs’ deployment, but its scalability and maintenance are limited mostly by servers. Peer-to-Peer (P2P) architecture, which attempts to make use of computer resources from the computers in the network, is considered to be a candidate infrastructure for MMOGs. In this paper, we investigate some related work and propose an algorithm to split overlay network for P2P-based MMOGs. We show the benefit of splitting the overlay network in reducing lookup latency of game objects through experiments and analytical analysis. © 2009 Gesellschaft fur Informatik (GI). All rights reserved.

关键词： Overlay networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：