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

International Symposium on parallel and distributed Processing (IPDPS)

作者： A. Boukerche Sungbum Hong T. Jacob Parallel Simulation and Distributed Systems PARADISE Research Lab Department of Computer Sciences University of North Texas USA

来源：评论

学校读者我要写书评

暂无评论

A risk-free multiversion temporally correct algorithm

A risk-free multiversion temporally correct algorithm

引用

International Symposium on parallel and distributed Processing (IPDPS)

作者： A. Boukerche T. Tuck Department of Computer Sciences Parallel Simulation and Distributed Systems (PARADISE) Research Laboratory University of North Texas USA

来源：评论

学校读者我要写书评

暂无评论

Dynamic grid-based multicast group assignment in data distribution management

Dynamic grid-based multicast group assignment in data distri...

引用

International Workshop/Symposium on distributed simulation and Real-Time Applications (DS-RT)

作者： A. Boukerche A. Roy N. Thomas Parallel Simulation and Distributed Systems (PARADISE) Research Lab Computer Science Department University of North Texas USA

Data distribution management (DDM) is one of the services defined by the DoD High Level Architecture. DDM is necessary to provide efficient, scalable mechanisms for distributing state updates and interaction information in large scale distributed simulations. We describe data distribution management mechanisms (also known as filtering) used for real time training simulations. We propose a new DDM approach to multicast group allocation, which we refer to as a dynamic grid-based allocation. Our scheme is based on a combination of a fixed grid-based method, known for its low overhead and ease of implementation, and a sender-based strategy, which uses fewer multicast groups than the fixed grid-based method. We describe our DDM algorithm, its implementation, and report on the performance results that we have obtained using the RTI-Kit framework. These results include the outcome of experiments comparing our approach to the fixed grid-based method, and they show that our scheme is scalable and significantly reduces the message overhead of previous grid-based allocation schemes.

关键词： distributed decision making Computational modeling Management training Discrete event simulation computer simulation computer science computer architecture Large-scale systems Filtering Multicast algorithms

来源：评论

学校读者我要写书评

暂无评论

An adaptive partitioning algorithm for conservative parallel simulation

An adaptive partitioning algorithm for conservative parallel...

引用

International Symposium on parallel and distributed Processing (IPDPS)

作者： A. Boukerche Parallel Simulation and Distributed Systems PARADISE Research Laboratory Department of Computer Sciences University of North Texas Denton TX USA

来源：评论

学校读者我要写书评

暂无评论

PERFORMANCE OF GZRP AD HOC ROUTING PROTOCOL

引用

Journal of Interconnection Networks 2001年第1期2卷 31-48页

作者： AZZEDINE BOUKERCHE STEVE ROGERS Parallel Simulations and Distributed Systems (PARADISE) Research Laboratory Department of Computer Sciences University of North Texas Denton TX 76203 USA

Ad hoc networks are useful for providing communication support where no fixed infrastructure exists or the deployment of a fixed infrastructure is not economically profitable, and movement of communicating parties is allowed. Therefore, such networks are designed to operate in widely varying environments, from military networks to low-power sensor networks and other embedded systems. Frequent topology changes caused by node mobility make routing in ad hoc wireless networks a challenging problem. In this paper, we propose an efficient ad hoc routing algorithm, which we refer to as GZRP, a hybrid protocol that makes use of the ZRP scheme and the Global Positioning System (GPS). As opposed to the ZRP original scheme, our GZRP scheme consists of propagating the routing (query) messages only to the nodes that are further away from the query source. We discuss the algorithm, its implementation, and report on the performance of GZRP scheme, and compare it to the ZRP routing protocol using an extensive simulation experiment. Our results indicate clearly that GZRP outperforms ZRP by reducing significantly the number of route query messages, and thereby increases the efficiency of the network load. Furthermore, we show that careful GPS screening angle is an important factor in the success of the GZRP ad hoc routing protocol.

关键词： Wireless Networks Ad Hoc Routing Protocol Zone Routing Protocol

来源：评论

学校读者我要写书评

暂无评论

LOAD BALANCING FOR parallel PCS NETWORK simulationS

引用

Journal of Interconnection Networks 2000年第3期1卷 173-193页

作者： AZZEDINE BOUKERCHE Parallel Simulations and Distributed Systems (PARADISE) Research Laboratory Department of Computer Sciences University of North Texas Denton TX 76203 USA

parallel and distributed simulation techniques have been investigated in a number of studies to decrease the execution times of PCS network simulations. In this paper, we consider distributed simulation of PCS models using a two-state PCS simulation testbed which makes use of a conservative scheme at Stage 1, and of Time Warp at Stage 2, and focus upon the load balancing issue. We investigate and study several load balancing schemes for TDMA systems. Extensive simulation experiments were conducted on a cluster of workstations using a real suburban area serviced by an FCA-based PCS networks. Our results indicate clearly that careful load balancing scheme is important in the success of the PCS simulation model.

关键词： PCS Wireless Networks Time Warp Partitioning parallel simulation

来源：评论

学校读者我要写书评

暂无评论

distributed dynamic channel allocation for mobile communication systems

Distributed dynamic channel allocation for mobile communicat...

引用

International Symposium on Modeling, Analysis and simulation of computer and Telecommunication systems (MASCOTS)

作者： A. Boukerche Sungbum Hong T. Jacob Parallel Simulations and Distributed Systems Research(PARAD1SE) Lab Department of Computer Sciences University of North Texas USA

We present an efficient distributed dynamic channel allocation algorithm for mobile communications systems. The algorithm is based upon the mutual exclusion model, where the channels are grouped by the number of cells in a cluster and each group of channels cannot be shared concurrently within the cluster. We discuss the algorithm and prove its correctness. We also show that the algorithm requires at most (worst case) O(N/sub g/*N/sub n/logN/sub n/) messages, where N/sub g/ is the number of groups and N/sub n/ is the number of neighbors. This is compared to Choy's (1995) algorithm which requires O(N/sub g//sup 2/*N/sub n/), where N/sub g/ is the number of groups. Our simulation experiments indicate that the DDRA algorithm outperforms previous schemes. A 5% reduction in the denial rate, and a 10-30% reduction in the acquisition time channel were obtained using our algorithm when compared to the previous algorithm.

关键词： Channel allocation Mobile communication Clustering algorithms distributed computing Resource management Wireless communication Jacobian matrices Computational modeling computer networks Telecommunication computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：