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

HOT-SPOT spanning tree algorithm FOR A BRIDGED LAN/MAN

COMPUTER COMMUNICATIONS 1995年第5期18卷 357-366页

作者： HUANG, NF MA, GK WU, YJ ITRI COMP & COMMUN RES LABSCTR ADV TECHNOLHSINCHU 310TAIWAN

A bridged local area network (BLAN) is an internetwork where a lot of LANs and MANs are interconnected via bridges. The active spanning tree topology of a BLAN is to ensure that one and only one active routing path exists between each pair of end stations to resolve the frame duplication problem. A LAN is a hot-spot LAN if it has a large amount of communicating traffic load compared to other LANs. In this paper, we propose a distributed spanning tree algorithm for a BLAN with hot-spot traffic. The spanning tree constructed by our algorithm is logically rooted at the hot-spot LAN instead of the bridge with the smallest identifier. Such a spanning tree will be more practical and suitable for delivering the inter-LAN frames, and hence will obtain a better performance on end-to-end transmission delay. The effectiveness of the algorithm is evaluated by simulations. From the simulation results, we found that, compared to the standard spanning tree algorithm, the spanning tree constructed by our algorithm obtains a greater improvement in terms of end-to-end transmission delay as the traffic concentration becomes more pronounced.

关键词： BLAN BRIDGES HOT-SPOT spanning tree algorithm

来源：评论

学校读者我要写书评

暂无评论

AN O(N LOG N) MINIMAL spanning tree algorithm FOR N-POINTS IN THE PLANE

引用

BIT 1986年第1期26卷 7-16页

作者： CHANG, RC LEE, RCT NATL CHIAO TUNG UNIV HSINCHUTAIWAN NATL TSING HUA UNIV HSINCHU 300TAIWAN ACAD SINICA TAIPEI 115TAIWAN

We shall present a divide-and-conquer algorithm to construct minimal spanning trees out of a set of points in two dimensions. This algorithm is based upon the concept of Voronoi diagrams. If implemented in parallel, i... 详细信息

关键词： spanning tree algorithm Voronoi diagrams ENTERING Platanus hybrida Minimal complexity classes plane Parallel Lines Planing Set of points

来源：评论

学校读者我要写书评

暂无评论

A minimal spanning tree algorithm for distribution networks configuration

A minimal spanning tree algorithm for distribution networks ...

引用

IEEE Power and Energy Society General Meeting

作者： Diana P. Montoya Juan M. Ramirez Department of Electrical Power System CINVESTAV-Guadalajara CINVESTAV-Guadalajara. MEXICO

ISBN: (纸本)9781467327275

A minimal spanning tree algorithm for distribution networks configurations is proposed. The paper approaches the formulation by the power losses' minimization in order to select a new configuration, keeping a radial configuration. This type of problem becomes a non-differentiable, mixed integer, and highly combinatorial in nature. The Kruskal's algorithm is used to determine the minimum spanning tree, which has the characteristic to run in polynomial time.

关键词： Distribution systems reconfiguration Power loss reduction Minimal spanning tree. spanning tree algorithm power loss Power grids spanning tree Polynomial time configurations Minimal

来源：评论

学校读者我要写书评

暂无评论

An Efficient Minimum spanning tree algorithm

An Efficient Minimum Spanning Tree Algorithm

引用

IEEE Symposium on Computers and Communications

作者： Abdullah-Al Mamun Sanguthevar Rajasekaran Computer Science and Engineering University of Connecticut USA

ISBN: (纸本)9781509006809

Finding minimum spanning trees (MST) in various types of networks is a well-studied problem in theory and practical applications. A number of efficient algorithms have been already developed for this problem. In this paper we present an efficient algorithm, namely Edge Pruned Minimum spanning tree (EPMST) algorithm, which combines ideas from randomized selection, Kruskal's algorithm and Prim's algorithm. The algorithm has a superior performance relative to the best-known algorithms especially when the graph is not very sparse. Specifically, EPMST outperforms a recently devised efficient algorithm on a wide range of input graphs.

关键词： Filtering algorithms Vegetation Partitioning algorithms Image edge detection algorithm design and analysis Computers Timing algorithm design and analysis Filtering algorithms Edge detection Partitioning algorithms Computers vegetation efficient algorithm spanning tree algorithm

来源：评论

学校读者我要写书评

暂无评论

Parallelism Extraction algorithm from Stream-based Processing Flow applying spanning tree 28

Parallelism Extraction Algorithm from Stream-based Processin...

引用

28th IEEE International Parallel & Distributed Processing Symposium Workshops (IPDPSW)

作者： Wang, Guyue Yamagiwa, Shinichi Wada, Koichi Univ Tsukuba Fac Engn Informat & Syst Dept Comp Sci Tsukuba Ibaraki Japan

ISBN: (纸本)9781479941162

Manycore architecture promotes a massively parallel computing on the accelerators. Especially GPU is one of the main series of the high performance computing, which is also employed by top supercomputers in the world. The programming method on such accelerators includes development of a control program. The accelerator executes it to schedule the invocation timing of the accelerator's kernel program. The kernel program needs to be written based on the stream computing paradigm. Connecting I/Os of the kernel programs, we can develop a large application. When we consider the processing flow as a directed graph, we can implement a GUI-based programming tool for the accelerators. It visualizes a pipeline-based processing flow. However, it is very hard to find the starting point of a complex processing flow. Moreover, although the processing pipeline should include the potential parallelism, it is hard for the programmer to exploit it intuitively. This paper proposes an algorithm applying the spanning tree that mechanically exploits the parallelism and determines an execution order.

关键词： High Performance Computing Stream Computing GPUs Caravela spanning tree algorithm

来源：评论

学校读者我要写书评

暂无评论

Linear-time algorithms for parametric minimum spanning tree problems on planar graphs

引用

THEORETICAL COMPUTER SCIENCE 1997年第1期181卷 57-74页

作者： FernandezBaca, D Slutzki, G IOWA STATE UNIV SCI & TECHNOL DEPT COMP SCI 226 ATANASOFF HALL AMES IA 50011 USA

A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The approach extends to other parametric minim... 详细信息

关键词： Efficient algorithms efficient algorithm algorithms Planar WWOX gene spanning tree algorithm planning drawings spanning tree

来源：评论

学校读者我要写书评

暂无评论

A Comparative Study Of Minimal spanning tree algorithms

A Comparative Study Of Minimal Spanning Tree Algorithms

引用

Mathematics, Computer Engineering and Computer Science (ICMCECS), International Conference in

作者： Peace Ayegba Joyce Ayoola Emmanuel Asani Aderemi Okeyinka Department of Computer Science Landmark University Kwara Nigeria

ISBN: (数字)9781728131269

ISBN: (纸本)9781728131276

The minimal spanning tree is a structure used in solving certain types of combinatorial optimization problems. Popular application areas include network design such as roads, telephone, electrical and cable-laying. There are two popular algorithms for acquiring the minimum spanning tree of a graph; These are Kruskal's algorithm and Prim's algorithm. The goal of this study is to implement these algorithms and find out which of them is more efficient. To achieve this, we implement and evaluate the complexity of the algorithms. In this paper both methods have been implemented on the road network of the 36 states in Nigeria and results of the implementation are presented. However, since this work is taken from a research in progress, the computational complexity of the two algorithms will be carried out and reported in another paper in the future.

关键词： Kruskal Prim’s Graph Minimal spanning trees Complexity Line graph algorithms spanning tree algorithm Complexity spanning tree road network Network design Minimal complexity classes

来源：评论

学校读者我要写书评

暂无评论

CENTERING A spanning tree OF A BICONNECTED GRAPH

引用

INFORMATION PROCESSING LETTERS 1989年第5期32卷 247-250页

作者： CHESTON, GA FARLEY, A HEDETNIEMI, ST PROSKUROWSKI, A UNIV OREGON DEPT COMP SCIEUGENEOR 97403 CLEMSON UNIV DEPT COMP SCICLEMSONSC 29631

Given a biconnected graph G = (V,E), and an arbitrary vertex v in V, there exists a spanning tree T of G with v in the center of T. The authors prove this by providing an O(!V! multiplied by !E!) algorithm that constr... 详细信息

关键词： Center spanning tree algorithm biconnected graph

来源：评论

学校读者我要写书评

暂无评论

A fast recursive shortest spanning tree for image segmentation and edge detection

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 1997年第2期6卷 328-332页

作者： Kwok, SH Constantinides, AG UNIV LONDON IMPERIAL COLL SCI TECHNOL & MED DEPT ELECT & ELECT ENGNLONDON SW7 2BTENGLAND

This correspondence presents a fast recursive shortest spanning tree algorithm for image segmentation and edge detection, The conventional algorithm requires a complexity of o(n(2)) for an image of rt pixels, while the complexity of our approach is bounded by O(n), which is a new lower bound for algorithms of this kind. The total memory requirement of our fast algorithm is 20% smaller.

关键词： Edge detection Fasting image segmentation algorithms Complexity Recursive memory requirements spanning tree algorithm spanning tree

来源：评论

学校读者我要写书评

暂无评论

High-speed parallel solution of the neutron diffusion equation with the hierarchical domain decomposition boundary element method incorporating parallel communications

引用

JOURNAL OF NUCLEAR SCIENCE AND TECHNOLOGY 2000年第5期37卷 477-485页

作者： Tsuji, M Chiba, G Hokkaido Univ Fac Engn Dept Quantum Energy Engn Kita Ku Sapporo Hokkaido 0608628 Japan

A hierarchical domain decomposition boundary element method (HDD-BEM) for solving the multiregion neutron diffusion equation (NDE) has been fully parallelized, both for numerical computations and for data communications, to accomplish a high parallel efficiency on distributed memory message passing parallel computers. Data exchanges between node processors that are repeated during iteration processes of HDD-BEM are implemented, without any intervention of the host processor that was used to supervise parallel processing in the conventional parallelized HDD-BEM (P-HDD-BEM). Thus, the parallel processing can be executed with only cooperative operations of node processors. The communication overhead was even the dominant time consuming part in the conventional P-HDD-BEM, and the parallelization efficiency decreased steeply with the increase of the number of processors. With the parallel data communication, the efficiency is affected only by the number of boundary elements assigned to decomposed subregions, and the communication overhead can be drastically reduced. This feature can be particularly advantageous in the analysis of three-dimensional problems where a large number of processors are required. The proposed P-HDD-BEM offers a promising solution to the deterioration problem of parallel efficiency and opens a new path to parallel computations of NDEs on distributed memory message passing parallel computers.

关键词： numerical solutions neutron diffusion equation boundary element method domain decomposition Newton's method block Jacobi method multiprocessing message passing distributed memory communication parallel efficiency parallel data communication spanning tree algorithm parallel processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：