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

Generic systolic array for genetic algorithms

IEE PROCEEDINGS-computerS AND DIGITAL TECHNIQUES 1997年第2期144卷 107-119页

作者： Megson, GM Bland, IM Department of Computer Science Algorithm Engineering Research Group Parallel Emergent and Distributed Architectures Laboratory (PEDAL) University of Reading Reading United Kingdom

The authors present a systolic design for a simple GA mechanism which provides high throughput and unidirectional pipelining by exploiting the inherent parallelism in the genetic operators. The design computes in O(N + G) time steps using O(N-2) cells where N is the population size and G is the chromosome length. The area of the device is independent of the chromosome length and so can be easily scaled by replicating the arrays or by employing fine-grain migration. The array is generic in the sense that it does not rely on the fitness function and can be used as an accelerator for any GA application using uniform crossover between pairs of chromosomes. The design can also be used in hybrid systems as an complement existing designs and fitness function acceleration and island-style population management.

关键词： field programmable gate array optimisation algorithm systolic array

来源：评论

学校读者我要写书评

暂无评论

Performance comparison and analysis of ad hoc routing algorithms

Performance comparison and analysis of ad hoc routing algori...

引用

IEEE International Conference on Performance, Computing and Communications (IPCCC)

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

ISBN: (纸本)0780370015

A mobile ad-hoc network (Manet) is a system of wireless mobile nodes dynamically self-organizing in arbitrary and temporary network topologies. People and vehicles can thus be internetworked in areas without a pre-existing communication infrastructure, or when the use of such infrastructure requires wireless extension. 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. We focus upon routing protocols for ad hoc networks. We study and compare the performance of several routing protocols. A variety of workload and scenarios using a variety of mobility, load and size of the ad hoc network were simulated.

关键词： Performance analysis Algorithm design and analysis Ad hoc networks Network topology Routing protocols Vehicles Internet Mobile communication Wireless sensor networks Sensor systems

来源：评论

学校读者我要写书评

暂无评论

A distributed synchronization scheme for multimedia streams in mobile systems: proof and correctness

A distributed synchronization scheme for multimedia streams ...

引用

Conference on Local computer Networks (LCN)

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

ISBN: (纸本)0769513212

The rapid development in portable computing platforms, distributed multimedia systems and wireless communication technologies has led to a significant interest in mobile multimedia and wireless networking. Video entertainment and multimedia Internet access over wireless networks are examples of future wireless personal communication systems. These, however, incur challenging technological issues. The synchronization of the multimedia objects among mobile clients is one of the most important of these issues. The task of synchronization in wireless multimedia systems is to eliminate variations and delays incurred during the transmission of multiple-media streams and to maintain the temporal order among the various media streams. We propose an efficient distributed multimedia synchronization algorithm for wireless and mobile multimedia systems to ensure and facilitate mobile clients' access to multimedia objects. We discuss the algorithm and provide its formal proof and correctness.

关键词： Streaming media Multimedia systems Wireless communication computer networks distributed computing Portable computers Communications technology Mobile computing Multimedia computing IP networks

来源：评论

学校读者我要写书评

暂无评论

Performance comparison of data distribution management strategies 01

Performance comparison of data distribution management strat...

引用

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

作者： A. Boukerche C. Dzermajko Parallel Simulation and Distributed Systems PARADISE Research Laboratory Department of Computer Science University of North Texas USA

Abstract: Data Distribution Management (DDM) is a High Level Architecture/Run-time Infrastructure (HLA/RTI) service that manages the distribution of state updates and interaction information in large scale distributed simulations, limits and controls the volume of data exchanged during the simulation. In this paper we focus upon the following three DDM schemes: Region-Based, Fixed and Dynamic Grid-Based techniques. In an effort to determine the most efficient model for applying the DDM service, we developed a mini-RTI Kit framework and propose a set of benchmarks to compare these DDM schemes. Using the RTI Kit, we performed extensive simulation experiments and present our analysis of the results of numerous federation executions.

关键词： distributed decision making Computational modeling computer simulation Discrete event simulation Subscriptions Filtering computer science Large-scale systems Analytical models Performance analysis

来源：评论

学校读者我要写书评

暂无评论

A simulation based study of on-demand routing protocols for ad hoc wireless networks

A simulation based study of on-demand routing protocols for ...

引用

Annual Symposium on simulation

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

ISBN: (纸本)0769510922

Ad hoc networks are wireless, mobile networks that can be set up anywhere and anytime without the aid of any established infrastructure or centralized administration. Because of the limited range of each host's wireless transmission, to communicate with hosts outside its transmission range, a host needs to enlist the aid of its nearby hosts in forwarding packets to the destination. However, since there is no stationary infrastructure such as base stations, each host has to act as a router for itself. A routing protocol for ad hoc networks is executed on every host and is therefore subject to the limit of the resources at each mobile host. A good routing protocol should minimize the computing load on the host as well as the traffic overhead on the network. Therefore, a number of routing protocols have been proposed for ad hoc wireless networks. We focus upon on-demand schemes. We study and compare the performance of the following three routing protocols AODV, CBRP and DSR. A variety of workload and scenarios, as characterized by mobility, load and size of the ad hoc network were simulated. Our results indicate that despite its improvement in reducing route request packets, CBRP has a higher overhead than DSR because of its periodic hello messages while AODV's end-to-end packet delay is the shortest when compared to DSR and CBRP.

关键词： Routing protocols Wireless networks Ad hoc networks Computational modeling computer simulation Wireless communication Base stations computer networks Laboratories computer science

来源：评论

学校读者我要写书评

暂无评论

Partitioning parallel simulation of wireless networks

Partitioning parallel simulation of wireless networks

引用

simulation Winter Conference

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

We present a simulation testbed for wireless and mobile telecommunication systems, a two-stage PCS parallel simulation testbed which makes use of a conservative scheme at stage 1, and of time warp at stage 2. While time warp is considered to be an effective synchronization mechanism in parallel and distributed discrete event simulation (PDES) it is also well known for its instability due to rollbacks and its devastating effect, i.e., series of cascading rollbacks, among other factors. Thus, our primary goal is to study the impact and the importance of partitioning in our PCS model while reducing significantly the number of rollbacks.

关键词： Wireless networks Personal communication networks Time warp simulation Computational modeling System testing Solid modeling Telecommunication traffic Traffic control Memory management computer simulation

来源：评论

学校读者我要写书评

暂无评论

Tinman: Eliminating confidential mobile data exposure with security oriented offloading 15

Tinman: Eliminating confidential mobile data exposure with s...

引用

10th European Conference on computer systems, EuroSys 2015

作者： Xia, Yubin Liu, Yutao Tan, Cheng Ma, Mingyang Guan, Haibing Zang, Binyu Chen, Haibo Shanghai Key Laboratory of Scalable Computing and Systems China Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China Department of Computer Science Shanghai Jiao Tong University China

ISBN: (纸本)9781450332385

The wide adoption of smart devices has stimulated a fast shift of security-critical data from desktop to mobile devices. However, recurrent device theft and loss expose mobile devices to various security threats and even physical attacks. This paper presents TinMan, a system that protects confidential data such as web site password and credit card number (we use the term cor to represent these data, which is short for Confidential Record) from being leaked or abused even under device theft. TinMan separates accesses of cor from the rest of the functionalities of an app, by introducing a trusted node to store cor and offloading any code from a mobile device to the trusted node to access cor. This completely eliminates the exposure of cor on the mobile devices. The key challenges to TinMan include deciding when and how to efficiently and transparently offload execution;Tin-Man addresses these challenges with security-oriented offloading with a low-overhead tainting scheme called asymmetric tainting to track accesses to cor to trigger offloading, as well as transparent SSL session injection and TCP payload replacement to offload accesses to cor. We have implemented a prototype of TinMan based on Android and demonstrated how TinMan protects the information of user's bank account and credit card number without modifying the apps. Evaluation results also show that TinMan incurs only a small amount of performance and power overhead. Copyright © 2015 ACM.

关键词： Crime

来源：评论

学校读者我要写书评

暂无评论

Density estimation with adaptive sparse grids for large data sets 14

Density estimation with adaptive sparse grids for large data...

引用

14th SIAM International Conference on Data Mining, SDM 2014

作者： Peherstorfer, Benjamin Pflüger, Dirk Bungartz, Hans-Joachim Aerospace Computational Design Laboratory AeroAstro Massachusetts Institute of Technology United States Simulation of Large Systems Group Institute for Parallel and Distributed Systems University of Stuttgart Germany Scientific Computing Group Department of Computer Science Technische Universität München Germany

ISBN: (纸本)9781510811515

Nonparametric density estimation is a fundamental problem of statistics and data mining. Even though kernel density estimation is the most widely used method, its performance highly depends on the choice of the kernel bandwidth, and it can become computationally expensive for large data sets. WTe present an adaptive sparse-grid-based density estimation method which discretizes the estimated density function on basis functions centered at grid points rather than on kernels centered at the data points. Thus, the costs of evaluating the estimated density function are independent from the number of data points. We give details on how to estimate density functions on sparse grids and develop a cross validation technique for the parameter selection. We show numerical results to confirm that our sparse-grid-based method is well-suited for large data sets, and, finally, employ our method for the classification of astronomical objects to demonstrate that it is competitive to current kernel-based density estimation approaches with respect to classification accuracy and runtime. Copyright © SIAM.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：