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

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

来源：评论

学校读者我要写书评

暂无评论

A distributed heuristic for decentralized workflow scheduling in global grids

A distributed heuristic for decentralized workflow schedulin...

引用

2009 10th IEEE/ACM International Conference on Grid Computing, Grid 2009

作者： Rahman, Mustafizur Ranjan, Rajiv Buyya, Rajkumar Grid Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia Service Oriented Computing Research Group School of Computer Science and Engineering University of New South Wales Australia

ISBN: (纸本)9781424451494

Efficient scheduling is a key concern for the effectual execution of performance driven Grid applications, such as workflows. Many list heuristics have been developed for scheduling workflows in centralized Grid environment. However, in this paper, we present a distributed list heuristic for decentralized scheduling of workflow applications in global Grids. The simulation results show that the proposed scheduling approach is scalable with respect to increased workload on the system. © 2009 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

A taxonomy of autonomic application management in grids

A taxonomy of autonomic application management in grids

引用

16th IEEE International Conference on parallel and distributed systems, ICPADS 2010

作者： Rahman, Mustafizur Ranjan, Rajiv Buyya, Rajkumar Cloud Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia Service Oriented Computing Research Group School of Computer Science and Engineering University of New South Wales Australia

ISBN: (纸本)9780769543079

In this paper, we propose a taxonomy that characterizes and classifies different components of autonomic application management in Grids. We also survey several representative Grid systems developed by various projects world-wide to demonstrate the comprehensiveness of the taxonomy. The taxonomy not only highlights the similarities and differences of state-of-the-art technologies utilized in autonomic application management from the perspective of Grid computing, but also identifies the areas that require further research initiatives. © 2010 IEEE.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Dependable workflow scheduling in global grids

Dependable workflow scheduling in global grids

引用

2009 10th IEEE/ACM International Conference on Grid Computing, Grid 2009

ISBN: (纸本)9781424451494

In this paper, a reputation-based Grid workflow scheduling algorithm is proposed to counter the effect of inherent unreliability and temporal characteristics of computing resources in large scale, decentralized Grid overlays. The proposed approach builds upon structured peer-to-peer indexing and overlay networking techniques to create a scalable wide-area networking of Grid sites for supporting dependable scheduling of applications. The scheduling algorithm considers reliability of a Grid resource as a statistical property, which is globally computed in the decentralized Grid overlay based on dynamic feedbacks or reputation scores assigned by individual service consumers (Grid Resource Brokers). The proposed algorithm can dynamically adapt to changing resource conditions and offer significant performance gains as compared to traditional approaches in the event of unsuccessful job execution or resource failure. We evaluate and demonstrate the feasibility of our approach through an extensive trace driven simulation. The results show that our scheduling technique can reduce the makespan up to 50% and successfully isolate the failure-prone resources from the system. © 2009 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

T3C: a temporally correct concurrency control algorithm for distributed databases

T3C: a temporally correct concurrency control algorithm for ...

引用

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

作者： A. Boukerche T.W. Tuck Parallel Simulations and Distributed Systems (PARADISE) Research Laboratory Department of Computer Science University of North Texas Denton TX USA

In some scenarios involving online transaction processing within a distributed database, it is desirable to synchronize transactions in a manner that guarantees conflict equivalence with a serial schedule ordered by original transaction start times while providing each transaction with an anomaly-serializable isolation. Few theoretical concurrency control algorithms guarantee such a conflict equivalence, and we are unaware of any protocol that accomplishes this while supporting real-world issues such as out-of-order transaction messages, out-of-order operation executions and out-of-order transaction committals without the burden of explicit read-set and write-set declarations. We describe an algorithm called T3C (Temporally Correct Concurrency Control) that provides this guarantee and supports these issues while requiring only table-level write-set declarations.

关键词： Concurrency control distributed databases Transaction databases Processor scheduling Protocols Out of order Concurrent computing Partitioning algorithms Computational modeling computer science

来源：评论

学校读者我要写书评

暂无评论

Scalable detection of MPI-2 remote memory access inefficiency patterns

Scalable detection of MPI-2 remote memory access inefficienc...

引用

作者： Hermanns, Marc-André Geimer, Markus Mohr, Bernd Wolf, Felix Laboratory for Parallel Programming German Research School for Simulation Sciences GmbH 52425 Jülich Germany Forschungszentrum Jülich Jülich Supercomputing Centre Germany Department of Computer Science RWTH Aachen University Germany

Wait states in parallel applications can be identified by scanning event traces for characteristic patterns. In our earlier work we defined such inefficiency patterns for MPI-2 one-sided communication, although still based on a serial trace-analysis scheme with limited scalability. In this article we show how wait states in one-sided communications can be detected in a more scalable fashion by taking advantage of a new scalable trace-analysis approach based on a parallel replay, which was originally developed for MPI-1 point-to-point and collective communication. Moreover, we demonstrate the scalability of our method and its usefulness for the optimization cycle with applications running on up to 32,768 cores. © The Author(s) 2012.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

Load balancing study in PCS wireless networks

Load balancing study in PCS wireless networks

引用

International Conference on parallel Processing Workshops (ICPPW)

作者： A. Boukerche A. Fabbri Parallel Simulations and Distributed Systems (PARADISE) Research Laboratory Department of Computer Scienceu University of North Texas USA

Wireless networking technologies and mobile cellular communication systems are growing at an ever faster rate, and this is likely to continue in the foreseeable future. Higher reliability, better coverage and services, higher capacity, mobility management, and wireless multimedia are all parts of the potpourri. The evolution of new systems and improved designs will always depend on the ability to predict system performance using analytical or simulation methods. To date, mathematical analysis has brought some insight into the design of such systems, but analytical methods are often not general or detailed enough for evaluation and comparison of various proposed mobile and/or wireless systems and their services. distributed simulation techniques have been investigated in a number of studies to decrease the execution times of PCS simulations. We study the load balancing problem for PCS wireless simulation systems, and focus upon static strategies in order to reduce the synchronization overhead of SWiMNet, a parallel PCS simulation testbed developed at UNT.

关键词： Load management Personal communication networks Wireless networks Cellular networks Telecommunication network reliability Mobile radio mobility management System performance Performance analysis Analytical models Predictive models

来源：评论

学校读者我要写书评

暂无评论

Laser-driven inertial ion focusing

引用

Physical Review E 2009年第1期79卷 015401(R)-015401(R)页

作者： H. B. Zhuo Wei Yu M. Y. Yu H. Xu X. Wang B. F. Shen Z. M. Sheng J. Zhang National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 China Shanghai Institute of Optics and Fine Mechanics Chinese Academy of Sciences Shanghai 201800 China Institute for Fusion Theory and Simulation Zhejiang University Hangzhou 310027 China Institute for Theoretical Physics I Ruhr University Bochum D-44780 Germany Department of Physics Jiaotong University Shanghai 200240 China

A Hohlraum-like configuration is proposed for realizing a simple compact source for neutrons. A laser pulse enters a tiny thin-shelled hollow-sphere target through a small opening and is self-consistently trapped in the cavity. The electrons in the inner shell-wall region are expelled by the light pressure. The resulting space-charge field compresses the local ions into a thin layer that becomes strongly heated. An inward expansion of ions into the shell cavity then occurs, resulting in the formation at the cavity center of a hot spot of ions at high density and temperature, similar to that in inertial electrostatic confinement.

关键词： laser fusion neutron sources particle beam focusing ELECTROSTATIC CONFINEMENT FUSION DEVICE

来源：评论

学校读者我要写书评

暂无评论

Toward a reference architecture based science gateway framework with embedded e-learning support

Toward a reference architecture based science gateway framew...

引用

作者： Pierantoni, Gabriele Kiss, Tamas Bolotov, Alexander Kagialis, Dimitrios DesLauriers, James Ullah, Amjad Chen, Huankai Fee, David Chan You Dang, Hai-Van Kovacs, Jozsef Belehaki, Anna Herekakis, Themistocles Tsagouri, Ioanna Gesing, Sandra School of Computer Science and Engineering University of Westminster London United Kingdom Parallel and Distributed Systems Laboratory SZTAKI Budapest Hungary Institute of Astronomy Astrophysics Space Applications and Remote Sensing National Observatory of Athens Athens Greece Department of Computer Science and Engineering University of Notre Dame Notre DameIN United States

science gateways have been widely utilized by a large number of user communities to simplify access to complex distributed computing infrastructures. While science gateways are still becoming increasingly popular and the number of user communities is growing, the fast and efficient creation of new science gateways and the flexibility to deploy these gateways on-demand on heterogeneous computational resources, remain a challenge. Additionally, the increase in the number of users, especially with very different backgrounds, requires intuitive embedded e-learning tools that support all stakeholders to find related learning material and to guide the learning process. This paper introduces a novel science gateway framework that addresses these challenges. The framework supports the creation, publication, selection, and deployment of cloud-based reference architectures that can be automatically instantiated and executed even by nontechnical users. The framework also incorporates a knowledge repository exchange and learning module that provides embedded e-learning support. To demonstrate the feasibility of the proposed solution, two scientific case studies are presented based on the requirements of the plasmasphere, ionosphere, and thermosphere research communities. © 2022 The Authors. Concurrency and Computation: Practice and Experience published by John Wiley & Sons Ltd.

关键词： Ionosphere

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：