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

38th International Conference on Telecommunications and Signal Processing (TSP)

作者： Chang, Che-Cheng Tsai, Jichiang Natl Chung Hsing Univ Dept Elect Engn Taichung 40227 Taiwan Natl Chung Hsing Univ Grad Inst Commun Engn Taichung 40227 Taiwan

ISBN: (纸本)9781479984985

The distributed Trigger Counting (DTC) problem is to raise an alert while the number of triggers received by the whole system reaches a pre-defined amount. There have been several algorithms proposed to solve such a problem in the literature. However, these existing algorithms are all under the assumption that there is no event regarding process moving, leaving and joining in the network. In this paper, we propose a novel distributed algorithm to solve the DTC problem for dynamic networks, which is free of any global assumption. Moreover, in order to reduce the message complexity of our algorithm, we further propose a more message-efficient version, only with one additional requirement that all processes need to learn ahead the total number of processes in the system.

关键词： distributed algorithms distributed trigger counting dynamic networks wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

distributed Memory Graph Coloring algorithms for Multiple GPUs 10

Distributed Memory Graph Coloring Algorithms for Multiple GP...

引用

10th IEEE/ACM Workshop on Irregular Applications - Architectures and algorithms (IA3)

作者： Bogle, Ian Boman, Erik G. Devine, Karen Rajamanickam, Sivasankaran Slota, George M. Rensselaer Polytech Inst Troy NY 12181 USA Sandia Natl Labs POB 5800 Albuquerque NM 87185 USA

ISBN: (纸本)9781665415576

Graph coloring is often used in parallelizing scientific computations that run in distributed and multi-GPU environments;it identifies sets of independent data that can be updated in parallel. Many algorithms exist for graph coloring on a single GPU or in distributed memory, but hybrid MPI+GPU algorithms have been unexplored until this work, to the best of our knowledge. We present several MPI+GPU coloring approaches that use implementations of the distributed coloring algorithms of Gebremedhin et al. and the shared-memory algorithms of Deveci et al. The on-node parallel coloring uses implementations in KokkosKernels, which provide parallelization for both multicore CPUs and GPUs. We further extend our approaches to solve for distance-2 coloring, giving the first known distributed and multi-GPU algorithm for this problem. In addition, we propose novel methods to reduce communication in distributed graph coloring. Our experiments show that our approaches operate efficiently on inputs too large to fit on a single GPU and scale up to graphs with 76.7 billion edges running on 128 GPUs.

关键词： graph coloring distributed algorithms GPU

来源：评论

学校读者我要写书评

暂无评论

distributed COMPRESSED SENSING algorithms: COMPLETING THE PUZZLE

DISTRIBUTED COMPRESSED SENSING ALGORITHMS: COMPLETING THE PU...

引用

1st IEEE Global Conference on Signal and Information Processing (GlobalSIP)

作者： Mota, Joao F. C. Xavier, Joao M. F. Aguiar, Pedro M. Q. Pueschel, Markus Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA Univ Tecn Lisboa Inst Super Tecn Inst Syst & Robot P-1096 Lisbon Portugal Swiss Fed Inst Technol Dept Comp Sci Zurich Switzerland

ISBN: (纸本)9781479902484

Reconstructing compressed sensing signals involves solving an optimization problem. An example is Basis Pursuit (BP) [1], which is applicable only in noise- free scenarios. In noisy scenarios, either the Basis Pursuit Denoising (BPDN) [1] or the Noise- Aware BP (NABP) [2] can be used. Consider a distributed scenario where the dictionary matrix and the vector of observations are spread over the nodes of a network. We solve the following open problem: design distributed algorithms that solve BPDN with a column partition, i.e., when each node knows only some columns of the dictionary matrix, and that solve NABP with a row partition, i.e., when each node knows only some rows of the dictionary matrix and the corresponding observations. Our approach manipulates these problems so that a recent general-purpose algorithm for distributed optimization can be applied.

关键词： distributed algorithms compressed sensing

来源：评论

学校读者我要写书评

暂无评论

distributed ENERGY-EFFICIENT algorithms FOR COVERAGE PROBLEM IN ADJUSTABLE SENSING RANGES WIRELESS SENSOR NETWORKS

引用

DISCRETE MATHEMATICS algorithms AND APPLICATIONS 2009年第3期1卷 299-317页

作者： Vu, Chinh Cai, Zhipeng Li, Yingshu Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA Univ Alberta Dept Comp Sci Edmonton AB T6G 2E8 Canada

Due to wide range of applications of Wireless Sensor Network (WSN), lots of effort has been dedicated to solve its various issues. Among those issues, coverage is one of the most fundamental ones of which a WSN has to watch over the environment such as a forest (area coverage) or set of subjects such as collection of precious renaissance paintings (target of point coverage) and collect environment parameters and maybe, further monitor the environment. With variable sensing range, the difficulties to cover a continuous space (where number of points is infinity) in the area coverage problem becomes somewhat harder than covering limited number of discrete points in the target coverage problem. Very few papers have paid effort for the former problem. In this paper, we consider the area coverage problem for WSN where sensors can arbitrarily change their sensing ranges under some upper bound. We first improve the work in [1] so that the boundary effect is ruled out and the monitored area can be completely covered at all cases. Next, we extend that improved algorithm by introducing two distributed scheduling algorithms which are trade-off in term of network lifetime and algorithms efficiency. The major objective of each of our 3 proposed algorithms in this paper is to balance energy consumption and to maximize network lifetime. Our proposed algorithm efficiency is shown by algorithms complexity analysis and extensive simulation. In compared with the work in [1], our proposed algorithms are not only better in providing coverage quality, they could also greatly lengthen network lifetime and greatly reduce the unnecessary coverage redundancy.

关键词： Wireless sensor network area coverage problem adjustable sensing range distributed algorithms balancing energy-efficient Delaunay-triangulation

来源：评论

学校读者我要写书评

暂无评论

Weighted Consensus algorithms for distributed Localization in Cooperative Wireless Networks 11

Weighted Consensus Algorithms for Distributed Localization i...

引用

11th IEEE International Symposium on Wireless Communications Systems (ISWCS)

作者： Soatti, G. Nicoli, M. Matera, A. Schiaroli, S. Spagnolini, U. Politecn Milan DEIB Milan Italy

ISBN: (纸本)9781479958634

In this paper we consider distributed localization in a wireless peer-to-peer network. Each node is required to estimate the geographical configuration of the whole network (i.e., the positions of all nodes regardless of link availability) based on local processing and iterated information exchange with neighbors. We propose a new weighted-average consensus method based on received-signal-strength peer-to-peer measurements. To handle the non-linearity of the measurement model, an iterative Gauss-Newton location estimator is integrated into the consensus algorithm. Consensus processing is designed so as to account for the different degree of reliability of the location information provided by different neighbors and boost the convergence process. Performances are analysed and compared to those of conventional consensus algorithms, in terms of accuracy and convergence rate, using fundamental performance bounds as benchmarks.

关键词： Cooperative systems network localization distributed algorithms consensus methods ad-hoc networks

来源：评论

学校读者我要写书评

暂无评论

distributed Local Broadcasting algorithms in the Physical Interference Model

Distributed Local Broadcasting Algorithms in the Physical In...

引用

7th IEEE International Conference on distributed Computing in Sensor Systems (DCOSS)

作者： Yu, Dongxiao Wang, Yuexuan Hua, Qiang-Sheng Lau, Francis C. M. Univ Hong Kong Dept Comp Sci Pokfulam Rd Hong Kong Hong Kong Peoples R China Tsinghua Univ Inst Interdisciplinary Informat Sci Beijing 100084 Peoples R China

ISBN: (纸本)9781457705137

Given a set of sensor nodes V where each node wants to broadcast a message to all its neighbors that are within a certain broadcasting range, the local broadcasting problem is to schedule all these requests in as few timeslots as possible. In this paper, assuming the more realistic physical interference model and no knowledge of the topology, we present three distributed local broadcasting algorithms where the first one is for the asynchronized model and the other two are for the synchronized model. Under the asynchronized model, nodes may join the execution of the protocol at any time and do not have access to a global clock, for which we give a distributed randomized algorithm with approximation ratio O(log(2) n). This improves the state-of-the-art result given in [14] by a logarithmic factor. For the synchronized model where communications among nodes are synchronous and nodes can perform physical carrier sensing, we propose two distributed deterministic local broadcasting algorithms for synchronous and asynchronous node wakeups, respectively. Both algorithms have approximation ratio O(log n).

关键词： Algorithm design and analysis Approximation algorithms Broadcasting Interference Sensors Signal to noise ratio Synchronization asynchronized model asynchronous node wakeups distributed algorithms distributed deterministic local broadcasting algorithm dist

来源：评论

学校读者我要写书评

暂无评论

distributed Backbone Structure for algorithms in the SINR Model of Wireless Networks

Distributed Backbone Structure for Algorithms in the SINR Mo...

引用

26th International Symposium on distributed Computing (DISC)

作者： Jurdzinski, Tomasz Kowalski, Dariusz R. Univ Wroclaw Inst Comp Sci PL-50138 Wroclaw Poland Univ Liverpool Liverpool Merseyside England

ISBN: (纸本)9783642336515

The Signal-to-Interference-and-Noise-Ratio (SINR) physical model is one of the most popular models of wireless networks. Despite of the vast amount of study done in design and analysis of centralized algorithms supporting wireless communication under the SINR physical model, little is known about distributed algorithms in this model, especially deterministic ones. In this work we construct, in a deterministic distributed way, a backbone structure on the top of a given wireless network, which can be used for efficient transformation of many algorithms designed in a simpler model of ad hoc broadcast networks without interference into the SINR physical model with uniform power of stations. The time cost of the backbone data structure construction is only O(Delta polylog N) rounds, where is roughly the network density and {1,, N} is the range of identifiers (IDs) and thus N is an upper bound on the number of nodes in the whole network. The core of the construction is a novel combinatorial structure called SINR-selector, which is introduced in this paper. We demonstrate the power of the backbone data structure by using it for obtaining efficient O(D + polylog N) round and O (D k polylog N) round deterministic distributed solutions for leader election and multi-broadcast, respectively, where D is the network diameter and k is the number of messages to be disseminated.

关键词： Wireless networks SINR Backbone structure distributed algorithms Leader Election Multi-message broadcast

来源：评论

学校读者我要写书评

暂无评论

distributed-Memory Parallel algorithms for Sparse Matrix and Sparse Tall-and-Skinny Matrix Multiplication 24

Distributed-Memory Parallel Algorithms for Sparse Matrix and...

引用

2024 International Conference for High Performance Computing, Networking, Storage and Analysis

作者： Ranawaka, Isuru Hussain, Md Taufique Block, Charles Gerogiannis, Gerasimos Torrellas, Josep Azad, Ariful Indiana Univ Bloomington IN 47405 USA Univ Illinois Champaign IL USA

ISBN: (数字)9798350352917

ISBN: (纸本)9798350352924;9798350352917

We consider a sparse matrix-matrix multiplication (SpGEMM) setting where one matrix is square and the other is tall and skinny. This special variant, TS-SpGEMM, has important applications in multi-source breadth-first search, influence maximization, sparse graph embedding, and algebraic multi-grid solvers. Unfortunately, popular distributed algorithms like sparse SUMMA deliver suboptimal performance for TS-SpGEMM. To address this limitation, we develop a novel distributed-memory algorithm tailored for TS-SpGEMM. Our approach employs customized 1D partitioning for all matrices involved and leverages sparsity-aware tiling for efficient data transfers. In addition, it minimizes communication overhead by incorporating both local and remote computations. On average, our TS-SpGEMM algorithm attains 5x performance gains over 2D and 3D SUMMA. Furthermore, we use our algorithm to implement multi-source breadth-first search and sparse graph embedding algorithms and demonstrate their scalability up to 512 Nodes (or 65,536 cores) on NERSC Perlmutter.

关键词： Three-dimensional displays Shape Scalability Performance gain Data transfer Partitioning algorithms Sparse matrices distributed algorithms Parallel algorithms Optimization

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of distributed Self-Stabilizing Dominating Set algorithms in Wireless Sensor Networks 5

Performance Evaluation of Distributed Self-Stabilizing Domin...

引用

5th International Conference on Electrical and Electronics Engineering (ICEEE)

作者： Evcimen, Huseyin Tolga Akram, Vahid Khalilpour Dagdeviren, Orhan Ege Univ Int Comp Inst Izmir Turkey

ISBN: (纸本)9781538663929

Finding a minimal dominating set (MDS) is a popular problem in wireless sensor networks (WSNs) to provide routing and backbone formation. A self-stabilizing system can tolerate topological changes such as node and edge joining/leaving thus they are very suitable for fault-tolerant and reliable WSNs. In this paper, we provide an extensive performance evaluation of self-stabilizing MDS algorithms for WSNs. To the best of our knowledge, this is the first experimental evaluation study of self-stabilizing MDS algorithms applied in WSN domain. We implemented the algorithms on various node counts and densities, and compared the average energy consumption, wall-clock time, move count and dominator count of the algorithms. The comprehensive simulation results show that the Goddard's algorithm finds the MDS with about 8.8% lower move and 5.8% lower dominator node count while its theoretical move count bound is higher than Chiu's algorithm. Despite of lower move count, the simulation results shows that the energy consumption of Goddard's algorithm is up to 1.5 times higher than Turau's and 2.8 times higher than Chiu's algorithms. The wallclock time, move count and detected dominator count of Turau's algorithm are respectively 84%, 88% and 12% higher than Goddard's algorithm in the networks with 1500 nodes which confirms its 9n move count bound. These measurements reveal that Goddard's algorithm outperforms other algorithms in terms of dominator count and Chiu's algorithm has a better performance for other metrics.

关键词： wireless sensor networks connected dominating set self-stabilizing distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

SELFSIM: A Discrete-Event Simulator for distributed Self-Stabilizing algorithms

SELFSIM: A Discrete-Event Simulator for Distributed Self-Sta...

引用

International Conference on Artificial Intelligence and Data Processing (IDAP)

作者： Evcimen, Huseyin Tolga Arapoglu, Ozkan Dagdeviren, Orhan Ege Univ Int Comp Inst Izmir Turkey

ISBN: (纸本)9781538668788

A self-stabilizing distributed system can initially start at any state and regain a legal state in a finite time without any external intervention. Self-stabilizing systems can automatically recover from faults and they are popular fault tolerant systems. Simulating self-stabilizing systems is a vital task in case of fault-tolerant distributed networks where node and edge updates can be frequent. A discrete-event simulation is a method of simulating the behavior and performance of an algorithm running on a distributed system. To the best of our knowledge, there are few simulators for self-stabilizing distributed algorithms in literature where these simulators are generally outdated and hard to use. In this paper we propose a novel distributed self-stabilizing discrete-event simulator (SELFSIM). SELFSIM is written in C# programming language *** Framework and supports up-to-date principles of software development techniques such as separation of concerns. We give the design and implementation of the proposed simulator and compare SELFSIM with its counterparts by considering various parameters such as supported node count (scalability), topological features, daemon (scheduler) types, etc., and show the superiority of our simulator.

关键词： discrete-event simulators distributed algorithms self-stabilization fault-tolerant systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：