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

On the design of efficient ATM routing schemes

THEORETICAL COMPUTER SCIENCE 2002年第1-2期270卷 341-359页

作者： Becchetti, L Bertolazzi, P Gaibisso, C Gambosi, G CNR Ist Analisi Sistemi & Informat I-00185 Rome Italy Univ Roma Tor Vergata Dipartimento Matemat I-00133 Rome Italy

In this paper we deal with the problem of designing virtual path layouts in ATM networks when the hop-count is given and the load has to be minimized. We first prove a lower bound for networks with arbitrary topology and arbitrary set of connection requests. This result is then applied to derive lower bounds for the following settings: (i) one-to-all (one node has to be connected to all other nodes of the network) in arbitrary networks;(ii) all-to-all (each node has to be connected to all other nodes in the network) in several classes of networks, including planar and k-separable networks and networks of bounded genus. We finally study the all-to-all setting on two-dimensional meshes and we design a virtual path layout for this problem. When the hop-count and the network degree are bounded by constants, our results show that the upper bounds proposed in this paper for the one-to-all problem in arbitrary networks and for the all-to-all problem in two-dimensional mesh networks are asymptotically optimal. Moreover, the general lower bound shows that the algorithm proposed in Gerstel (Ph.D. Thesis, Technion-Haifa, Israel, 1995) for the all-to-all problem in k-separable networks is also asymptotically optimal. The upper bound for mesh networks also shows that the lower bound presented in this paper for the all-to-all problem in planar networks is asymptotically tight. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： ATM networks parallel and distributed computation virtual path layout

来源：评论

学校读者我要写书评

暂无评论

THE GENERALIZED PACKET ROUTING PROBLEM

引用

THEORETICAL COMPUTER SCIENCE 1987年第2-3期53卷 281-293页

作者： PELEG, D UPFAL, E IBM CORP ALMADEN RES CTRSAN JOSECA 95120

The problem of efficient packet routing is central to the area of communication networks. The special case of permutation packet routing has been extensively studied in the past. While optimal algorithms for permutation routing exist, they do not ‘scale up’ to give optimal solutions for the general case. Using a novel technique we obtain an optimal algorithm for the general packet routing problem. The core of our solution is an algorithm for a generalized version of the token distribution problem . This result has direct applications to the solution of the load balancing problem in distributed systems.

关键词： parallel and distributed computation communication expander graphs

来源：评论

学校读者我要写书评

暂无评论

Minimum Energy Coding in CDMA Wireless Sensor Networks

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2009年第2期8卷 985-994页

作者： Flischione, C. Johansson, K. H. Sangiovanni-Vincentelli, A. Ares, B. Zurita Royal Inst Technol ACCESS Linnaeus Ctr Stockholm Sweden Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

A theoretical framework is proposed for accurate comparison of minimum energy coding in Coded Division Multiple Access (CDMA) Wireless Sensor Networks (WSNs). Energy consumption and reliability are analyzed for two coding schemes: Minimum Energy coding (ME), and Modified Minimum Energy coding (MME). A detailed model of consumed energy is described as function of the coding, radio transmit power, the characteristics of the transceivers, and the dynamics of the wireless channel. Since CDMA is strongly limited by multi-access interference, the system model includes all the relevant characteristics of wireless propagation. A distributed and asynchronous algorithm, which minimizes the total energy consumption by controlling the radio power, is developed. Numerical results are presented to validate the theoretical analysis and show under which conditions MME outperforms ME with respect to energy consumption and bit error rate. It is concluded that MME is more energy efficient than ME only for short codewords.

关键词： Wireless sensor network (WSNs) minimum energy coding CDMA OOK power control outages parallel and distributed computation

来源：评论

学校读者我要写书评

暂无评论

Fast-Lipschitz Optimization With Wireless Sensor Networks Applications

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2011年第10期56卷 2319-2331页

作者： Fischione, Carlo KTH Royal Inst Technol Automat Control Lab ACCESS Linnaeus Ctr S-10044 Stockholm Sweden

Motivated by the need for fast computations in wireless sensor networks, the new F-Lipschitz optimization theory is introduced for a novel class of optimization problems. These problems are defined by simple qualifying properties specified in terms of increasing objective function and contractive constraints. It is shown that feasible F-Lipschitz problems have always a unique optimal solution that satisfies the constraints at equality. The solution is obtained quickly by asynchronous algorithms of certified convergence. F-Lipschitz optimization can be applied to both centralized and distributed optimization. Compared to traditional Lagrangian methods, which often converge linearly, the convergence time of centralized F-Lipschitz problems is at least superlinear. distributed F-Lipschitz algorithms converge fast, as opposed to traditional Lagrangian decomposition and parallelization methods, which generally converge slowly and at the price of many message passings. In both cases, the computational complexity is much lower than traditional Lagrangian methods. Examples of application of the new optimization method are given for distributed estimation and radio power control in wireless sensor networks. The drawback of the F-Lipschitz optimization is that it might be difficult to check the qualifying properties. For more general optimization problems, it is suggested that it is convenient to have conditions ensuring that the solution satisfies the constraints at equality.

关键词： Convex and non-convex optimization distributed optimization interference function theory multi-objective optimization parallel and distributed computation wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

(n-2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn

引用

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2021年第3期32卷 289-304页

作者： Xu, Xirong Zhang, Huifeng Wang, Ziming Zhang, Qiang Zhang, Peng Dalian Univ Technol Sch Comp Sci & Technol Dalian 116024 Peoples R China Dalian Med Univ Zhongshan Coll Dept Comp Sci Dalian 116085 Peoples R China

As one of the most fundamental networks for parallel and distributed computation, cycle is suitable for developing simple algorithms with low communication cost. A graph G is called k-fault-tolerant edge-pancyclic if after deleting any faulty set F of k vertices and/or edges from G, every correct edge in the resulting graph lies in a cycle of every length from g to vertical bar V (G - F)vertical bar, inclusively, where g is the girth of G, the length of a shortest cycle in G. The n-dimensional crossed cube CQ(n) is an important variant of the hypercube Q(n), which possesses some properties superior to the hypercube. This paper investigates the fault-tolerant edge-pancyclicity of CQ(n), and shows that if CQ(n)(n >= 5) contains at most n - 2 faulty vertices and/or edges then, for any fault-free edge uv and every length l from 6 to vertical bar V (CQ(n) - F)vertical bar except l = 7, there is a fault-free cycle of length l containing the edge uv. The result is optimal in some senses.

关键词： Interconnection network parallel and distributed computation computer network reliability crossed cube edge-pancyclicity fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Generalized precedence-based queueing systems

引用

Mathematics of Operations Research 1992年第3期17卷 615-615页

作者： Liu, Zhen Baccelli, Francois

A general K -server queueing model with precedence constraints on customer services is considered. Such a system is characterized by bulk arrivals of size K , with one customer for each server, and synchronization constraints between them and some of the previously arrived customers: Customer k (1 ≤ k ≤ K ) of the n th ( n ≥ 0) bulk arrival has to wait for the service completion of customer j (1 ≤ j ≤ K ) of the m th (0 ≤ m ≤ n ) arrival before starting its service, if there exists a precedence relation between these two customers. Such queueing systems arise naturally when modeling database concurrency control mechanisms based on “static” locking, as well as parallel computations where some processes may need results obtained by other processes for beginning their execution. Several performance aspects of this class of queueing systems are considered under various statistical assumptions. The stability condition, which yields the maximal system throughput, is analyzed together with the waiting and response times of individual customers, and the response times of bulks. These results are obtained from a set of recursive evolution equations which captures both the queueing and the synchronization mechanisms of the system. The stability condition is derived from a generalization of the schema of Loynes for G / G /1 queues. Integral functional equations are provided for both the transient and stationary distributions of the waiting and response times under renewal type assumptions. Various upper and lower bounds on the moments of these quantities are derived using either modifications of the precedence function or stochastic ordering techniques.

关键词： queueing system performance evaluation concurrency control database system parallel and distributed computation stability condition waiting time response time bounds ergodic theory

来源：评论

学校读者我要写书评

暂无评论

A parallel ALGORITHM FOR BIG TENSOR DECOMPOSITION USING RANDOMLY COMPRESSED CUBES (PARACOMP)

A PARALLEL ALGORITHM FOR BIG TENSOR DECOMPOSITION USING RAND...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

作者： Sidiropoulos, N. D. Papalexakis, E. E. Faloutsos, C. Univ Minnesota Dept ECE Minneapolis MN 55455 USA Carnegie Mellon Univ Dept CS Pittsburgh PA 15213 USA

ISBN: (纸本)9781479928934

A parallel algorithm for low-rank tensor decomposition that is especially well-suited for big tensors is proposed. The new algorithm is based on parallel processing of a set of randomly compressed, reduced-size 'replicas' of the big tensor. Each replica is independently decomposed, and the results are joined via a master linear equation per tensor mode. The approach enables massive parallelism with guaranteed identifiability properties: if the big tensor has low rank and the system parameters are appropriately chosen, then the rank-one factors of the big tensor will be exactly recovered from the analysis of the reduced-size replicas. The proposed algorithm is proven to yield memory / storage and complexity gains of order up to IJ/F for a big tensor of size I x J x K of rank F with F <= I <= J <= K.

关键词： Tensor decomposition CANDECOMP / PARAFAC Big Data parallel and distributed computation Cloud Computing and Storage

来源：评论

学校读者我要写书评

暂无评论

TOSSIM simulation of wireless sensor network serving as hardware platform for Hopfield neural net configured for max independent set

TOSSIM simulation of wireless sensor network serving as hard...

引用

Conference of the Complex Adaptive Systems on Responding to Continuous Global Change in Systems Needs

作者： Li, Jiakai Serpen, Gursel Univ Toledo Toledo OH 43606 USA

This paper, the third one in a three-paper sequence, presents the result of TOSSIM simulation of a Hopfield neural network as a static optimizer and configured to solve the maximum independent set (MIS) problem using a wireless sensor network as a fully parallel and distributed computing hardware platform. TinyOS with its default protocol stack along with nesC were used to develop the simulation model. Simulations were realized for mote counts of 10, 50, 100, and 182;messaging complexity, memory and simulation time costs were measured. Results indicated, as the most prominent finding, that the neural optimization algorithm was able to compute solutions to the MIS problem. The memory footprint of the TOSSIM process in Windows XP environment was about 20 MB for the range of sensor networks considered. The messaging complexity as measured by the total number of messages transmitted and the simulation time increased rather quickly indicating a need to optimize and tune certain aspects of the simulation environment if wireless sensor networks with higher mote counts need to be simulated. (C) 2011 Published by Elsevier B.V.

关键词： TOSSIM nesC TinyOS wireless sensor network Hopfield neural network static optimization parallel and distributed computation message complexity scalability

来源：评论

学校读者我要写书评

暂无评论

The Performance Evaluation of the Java Implementation of Graph500 11th

The Performance Evaluation of the Java Implementation of Gra...

引用

11th International Conference on parallel Processing and Applied Mathematics (PPAM)

作者： Ryczkowska, Magdalena Nowicki, Marek Bala, Piotr Nicolaus Copernicus Univ Fac Math & Comp Sci Chopina 12-18 PL-87100 Torun Poland Univ Warsaw Interdisciplinary Ctr Math & Computat Modeling Pawinskiego 5a PL-02106 Warsaw Poland

ISBN: (纸本)9783319321523;9783319321516

Graph-based computations are used in many applications. Increasing size of analyzed data and its complexity make graph analysis a challenging task. In this paper we present performance evaluation of Java implementation of Graph500 benchmark. It has been developed with the help of the PCJ (parallel computations in Java) library for parallel and distributed computations in Java. PCJ is based on a PGAS (Partitioned Global Address Space) programming paradigm, where all communication details such as threads or network programming are hidden. In this paper, we present Java implementation details of first and second kernel from Graph500 benchmark. The results are compared with the existing MPI implementations of Graph500 benchmark, showing good scalability of PCJ library.

关键词： High performance computing Graph processing PGAS parallel and distributed computation Performance evaluation parallel graph algorithms Java

来源：评论

学校读者我要写书评

暂无评论

Remote submission and parallel computation of fluorescence image reconstruction of breast cancer

Remote submission and parallel computation of fluorescence i...

引用

Conference on Smart Medical and Biomedical Sensor Technology

作者： Yang, Y Pargas, RP Clemson Univ Dept Comp Sci Clemson SC 29634 USA

ISBN: (纸本)0819451509

This paper describes a software system currently being developed at Clemson University in which a client provides recently obtained data to a remote server running a compute-intensive algorithm. To improve performance and speed up delivery of the results, the server distributes the data among multiple sub-server processors and assembles partial output from each processor into a coherent whole before sending the final results to the client. To demonstrate the capabilities of the system, a specific application is presented in this paper: a fluorescence image reconstruction system for breast cancer detection. An experimental instrument optically scans the patient's breast and generates some files of experimental data which are then sent to the server via the web. The data is processed by the numerical finite-element based algorithm running in parallel on a server and several sub-servers at Clemson. The algorithm is based on a set of coupled diffusion equations which are used to describe the propagation of excitation and fluorescent emission light in multiply scattering media (such as a breast). The algorithm reconstructs the fluorescence image of the breast in parallel. The resulting fluorescence lifetime and quantum yield mapping data can be sent back to the doctor for image display and analysis. This paper describes the numerical algorithm briefly and the software system which uses Java servlets to collect the data from the client and remote method invocation (Java RMI) to distribute the data to multiple processors. The output of the numerical algorithm, combined with the corresponding finite element mesh information, are input into a mathematical software package called Matlab which is used to produce the final images. Experiments are performed using indocyanine green (ICG) dye and tissue-like phantoms in both single- and multi-target configurations. Phantom experimental results of both lifetime and quantum yield are shown in this paper. Future work includes a refin

关键词： image reconstruction techniques mammography medical optics instrumentation tomography parallel and distributed computation web application

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：