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

international symposium on Wireless Personal Multimedia Communications (WPMC)

作者： P.L. Simeonov Department of Telematics Technology University of Ilmenau Germany

the wandering network (WN) (see Simeonov, P.L., Proc. IEEE Int. Symp. on parallel & distributed Processing - IPDPS'02, 2002) is a new type of communications architecture defined by: (1) flexible, multi-modal specialization of network nodes as virtual subnetworks; (2) mobility and virtualization of the net functions in hardware and software; (3) self-organization as multi-feedback-based topology-on-demand. Network elements can contain several exchangeable modules capable of executing diverse network functions in parallel. these functions can be invoked, transported to or generated in the nodes upon delivery of mobile code containing programs about the node's behaviour. An essential characteristic of the WN approach is the inherent ability to spread out instantly information about architectural changes among the nodes by encoding executable re-construction (genetic) instructions within the transported active packets - as "network" genes, N-genes.

关键词： Routing Intelligent networks Encoding Adaptive systems Genetics Computer networks Biology computing Mobile communication Telematics Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient channel access scheduling for power-constrained networks

Energy-efficient channel access scheduling for power-constra...

引用

international symposium on Wireless Personal Multimedia Communications (WPMC)

作者： V. Rajendran J.J. Garcia-Luna-Aceves K. Obraczka USA Department of Computer Engineering University of California Santa Cruz CA USA

We introduce the distributed energy-aware node activation (DEANA) channel access protocol for power-constrained networks. Conventional channel access protocols waste energy during periods of idle listening and collisions. In DEANA, the radio is switched to a low-power, stand-by mode when a node is not transmitting or receiving, which makes DEANA very attractive for sensor networks. Using an analytical model, we show that the proposed approach can achieve significant energy savings (up to 95%).

关键词： Energy efficiency Access protocols Energy consumption Energy resolution Road accidents Processor scheduling Computer networks distributed computing Power engineering computing Power engineering and energy

来源：评论

学校读者我要写书评

暂无评论

Deploying parallel spatial join algorithm for network environment

Deploying parallel spatial join algorithm for network enviro...

引用

IEEE international Conference on High Speed Networks and Multimedia Communications

作者： Myoung-Soo Kang Yoon-Chul Choy Department of Computer Science Yonsei University Seoul South Korea

there have been a need for accessing spatial data from distributed and preexisting spatial database systems interconnected through a network. In a distributed environment, spatial joins for two spatial relations residing at geographically separated sites are expensive in terms of computation and transmission cost because of the large size and complexity of spatial data. therefore, we propose a new spatial join method for distributed spatial databases. Previously, a distributed algorithm based on the spatial semijoin has accomplished performance improvements by eliminating objects before transmission to reduce both transmission and local processing costs. But with widespread high bandwidth data transmission, parallelism through data redistribution may improve the performance of spatial joins in spite of additional transmission costs. Hence, we propose a parallel spatial join processing that combines the data-partitioning techniques used by most parallel join algorithms in relational databases and the filter-and-refinement strategy for spatial operation processing for distributed spatial databases. In experiments, we showed that the proposed method provides useful reductions in the cost of evaluating a join.

关键词： Costs distributed databases Spatial databases Relational databases Database systems distributed computing Computational efficiency distributed algorithms Bandwidth Data communication

来源：评论

学校读者我要写书评

暂无评论

Radio resource management and evolutionary computation in CDMA cellular radio networks

Radio resource management and evolutionary computation in CD...

引用

international symposium on Wireless Personal Multimedia Communications (WPMC)

作者： Won Jay Song Byung Ha Ahn Sun Jin Kim Munkee Choi Won Hee Kim Bo Gwan Kim Department of Mechatronics KwangJu Institute of Science and Technology Republic of Korea School of Business Information and Communications University Republic of Korea Department of Electronics Engineering Chungnam National University Republic of Korea

ISBN: (纸本)0780374428

the paper proposes distributed power control (PC) algorithms that employ two evolutionary computation (EC) or genetic algorithm (GA) techniques to solve systems of linear equations for power update in CDMA cellular radio systems. the proposed algorithms apply evolutionary computation algorithms from a phenotypic and a genotypic view to the CDMA power control problem. the major gain from the evolutionary computation algorithms is more rapid optimization on systems of linear equations compared with the simple genetic algorithm (SGA). Employing distributed constrained power control (DCPC) and bang-bang (BB) algorithms as the basic reference, we have designed and implemented computational experiments on the DS-CDMA system. the proposed EC-DCPC phenotypic algorithm is compared with the DCPC algorithm. the GA-DCPC genotypic algorithm is also compared with the BB algorithm used in IS-95 and W-CDMA systems. the simulation results indicate that the proposed EC-DCPC phenotypic and GA-DCPC genotypic algorithms significantly decrease mobile terminal power consumption compared with the DCPC and BB algorithms, respectively. the calculation results show that our proposed EC-DCPC phenotypic and GA-DCPC genotypic algorithms also have a high potential advantage for increasing CDMA cellular radio network capacity.

关键词： Resource management Evolutionary computation Multiaccess communication Land mobile radio cellular systems Power control Genetic algorithms Equations Algorithm design and analysis distributed computing Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Locating and computing in parallel all the simple roots of special functions using PVM

引用

JOURNAL OF COMPUTATIONAL AND APPLIED MAthEMATICS 2001年第1-2期133卷 545-554页

作者： Plagianakos, VP Nousis, NK Vrahatis, MN Univ Patras Dept Math UPAIRC GR-26500 Patras Greece

An algorithm is proposed for locating and computing in parallel and with certainty all the simple roots of any twice continuously differentiable function in any specific interval. To compute with certainty all the roots, the proposed method is heavily based on the knowledge of the total number of roots within the given interval. To obtain this information we use results from topological degree theory and, in particular, the Kronecker-Picard approach. this theory gives a formula for the computation of the total number of roots of a system of equations within a given region, which can be computed in parallel, With this tool in hand, we construct a parallel procedure for the localization and isolation of all the roots by dividing the given region successively and applying the above formula to these subregions until the final domains contain at the most one root. the subregions with no roots are discarded, while for the rest a modification of the well-known bisection method is employed for the computation of the contained root. the new aspect of the present contribution is that the computation of the total number of zeros using the Kronecker-Picard integral as well as the localization and computation of all the roots is performed in parallel using the parallel virtual machine (PVM). PVM is an integrated set of software tools and libraries that emulates a general-purpose, flexible, heterogeneous concurrent computing framework on interconnected computers of varied architectures. the proposed algorithm has large granularity and low synchronization, and is robust. It has been implemented and tested and our experience is that it can massively compute with certainty all the roots in a certain interval. Performance information from massive computations related to a recently proposed conjecture due to Elbert (this issue, J. Comput. Appl. Math. 133 (2001) 65-83) is reported. (C) 2001 Elsevier Science B.V. All rights reserved.

关键词： Elbert's conjecture special functions Bessel functions computation of special functions construction of tables of special functions parallel and distributed algorithms parallel virtual machine zero isolation Kronecker-Picard theory topological degree theory computing simple roots bisection method

来源：评论

学校读者我要写书评

暂无评论

Reflective decision controls for autonomous distributed objects 5

Reflective decision controls for autonomous distributed obje...

引用

5th IEEE international symposium on Autonomous Decentralized Systems (ISADS 01)

作者： Huang, EH Elrad, T Lucent Technol Inc Naperville IL 60566 USA

ISBN: (纸本)0769510655

this paper presents a reflective decision control mechanism for dealing with synchronization and scheduling issues ill distributed computing environment. We present a component-based reflective architecture for assisting distributed objects in decision making, it enables autonomous entities to support reflective computation that requires a flexible means for managing the course of computation, resource allocation and scheduling. Such capability is critical to the successful implementation of distributed software that supports real-rime and reactive/adaptive applications (e.g., robotics, manufacturing, and military systems). In many instances, these systems must be designed to monitor and manage complex systems in dynamic settings.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Hydra - Decentralized and adaptative approach to distributed computing 5th

Hydra - Decentralized and adaptative approach to distributed...

引用

5th international Workshop on Applied parallel computing (PARA 2000)

作者： Bubak, M Plaszczak, P AGH Univ Sci & Technol Inst Comp Sci PL-30059 Krakow Poland AGH Univ Sci & Technol Acad Comp Serv CYFRONET PL-30950 Krakow Poland

ISBN: (纸本)354041729X

this paper presents Hydra - a system designed for distributed computing on a set of heterogeneous uncommitted machines. It consists of autonomous nodes placed on participating host computers. the nodes attempt to make maximal use of temporarily available resources with a monitoring mechanism. Hydra nodes need no administration. Prototype was implemented in Java. Results of a sample simulation show scalability of the system.

关键词： distributed computing decentralization Java desktop computing volunteer computing

来源：评论

学校读者我要写书评

暂无评论

Runtime adaptation of an iterative linear system solution to distributed environments 5th

Runtime adaptation of an iterative linear system solution to...

引用

5th international Workshop on Applied parallel computing (PARA 2000)

作者： Sosonkina, M Univ Minnesota Dept Comp Sci Duluth MN 55812 USA

ISBN: (纸本)354041729X

distributed cluster environments are becoming popular platforms for high performance computing in lieu of single-vendor supercomputers. However, the reliability and sustainable performance of a cluster are difficult to ensure since the amount of available distributed resources may vary during the application execution. To increase robustness, an application needs to have self-adaptive features that are invoked at the runtime. For a class of computationally-intensive distributed scientific applications, iterative linear system solutions, we show a benefit of the adaptations that change the amount of local computations based on the runtime performance information. A few strategies for efficient exchange of such information are discussed and tested on two cluster architectures.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Dependability modelling of homogeneous and heterogeneous distributed systems 5

Dependability modelling of homogeneous and heterogeneous dis...

引用

5th IEEE international symposium on Autonomous Decentralized Systems (ISADS 01)

作者： Chen, YN He, ZS Univ Witwatersrand Programme Highly Dependable Syst Johannesburg South Africa

ISBN: (纸本)0769510655

In the past few years we have developed an experimental distributed system that supports multi-task applications with different levels of criticality. Software implemented fault-tolerant protocols are used to support dependable computing. this paper first presents Markov models of a distributed system under the occurrence of faults, reconfiguration and repair. As a part of our overall project, these models are intended for solving our particular problems, like assessing the merits of redundant schemes, task allocation and reallocation policies, and fault handling used in our experimental system. However, these models are developed in a generic way. they can also be used in evaluating individual task's reliability, risk and availability under various redundant schemes in any homogeneous distributed system. then, we extend our study in analysing the dependability of the heterogeneous system consisting of a number homogeneous distributed systems connected through gateways.

关键词： distributed system dependability Markov model fault-tolerant protocol

来源：评论

学校读者我要写书评

暂无评论

What are the top ten most influential parallel and distributed processing concepts of the past millenium?

引用

JOURNAL OF parallel AND distributed computing 2001年第12期61卷 1827-1841页

作者： theys, MD Ali, S Siegel, HJ Chandy, M Hwang, K Kennedy, K Sha, L Shin, KG Snir, M Snyder, L Sterling, T Univ Illinois Dept Comp Sci MC 152 Chicago IL 60607 USA Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47907 USA Colorado State Univ Dept Elect & Comp Engn Ft Collins CO 80523 USA CALTECH Comp Sci Dept 256 80 Pasadena CA 91125 USA Univ So Calif Dept Elect Engn Syst Los Angeles CA 90089 USA Rice Univ HiPerSoft MS41 Houston TX 77005 USA Univ Illinois Urbana IL 61801 USA Univ Michigan Dept Elect & Comp Sci Real Time Comp Lab Ann Arbor MI 48109 USA IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA Univ Washington Dept Comp Sci & Engn Seattle WA 98195 USA NASA Jet Prop Lab Ctr Adv Comp Res Pasadena CA 91125 USA

this is a report on a panel titled "What are the top ten most influential parallel and distributed processing concepts of the last millennium'?" that was held at the IEEE Computer Society sponsored "14th international parallel and distributed Processing symposium (IPDPS 2000)." the panelists were chosen to represent a variety of perspectives and technical areas. After the panelists had presented their choices for the top ten, an open discussion was held among the audience and panelists. At the end of the discussion, a ballot was distributed for the audience to vote on the top ten concepts (in arbitrary order). the voting identified the following ten most influential parallel and distributed processing concepts of the last millennium: (1) Amdahl's law and scalability, (2) Arpanet and Internet, (3) pipelining, (4) divide and conquer approach, (5) multiprogramming. (6) synchronization (including semaphores), (7) load balancing, (8) message passing and packet switching, (9) cluster computing, and (10) multithreaded (lightweight) program execution. (C) 2001 Academic Press.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：