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

ACM International Conference on Object Oriented Programming Systems Languages and Applications

作者： Liu, Yanhong A. Stoller, Scott D. Lin, Bo Gorbovitski, Michael SUNY Stony Brook Dept Comp Sci Stony Brook NY 11794 USA

ISBN: (纸本)9781450315616

This paper describes a very high-level language for clear description of distributed algorithms and optimizations necessary for generating efficient implementations. The language supports high-level control flows where complex synchronization conditions can be expressed using high-level queries, especially logic quantifications, over message history sequences. Unfortunately, the programs would be extremely inefficient, including consuming unbounded memory, if executed straightforwardly. We present new optimizations that automatically transform complex synchronization conditions into incremental updates of necessary auxiliary values as messages are sent and received. The core of the optimizations is the first general method for efficient implementation of logic quantifications. We have developed an operational semantics of the language, implemented a prototype of the compiler and the optimizations, and successfully used the language and implementation on a variety of important distributed algorithms.

关键词： algorithms Design Languages Performance distributed algorithms incrementalization logic quantifications program optimization very high-level languages

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms FOR BUILDING HAMILTONIAN CYCLES IN k-ARY n-CUBES AND HYPERCUBES WITH FAULTY LINKS

引用

Journal of Interconnection Networks 2007年第3期8卷 253-284页

作者： IAIN A. STEWART Department of Computer Science Durham University Science Labs South Road Durham DH1 3LE U.K.

We derive a sequential algorithm Find-Ham-Cycle with the following property. On input: k and n (specifying the k-ary n-cube ); F, a set of at most 2n − 2 faulty links; and v , a node of , the algorithm outputs nodes v + and v − such that if Find-Ham-Cycle is executed once for every node v of then the node v + (resp. v − ) denotes the successor (resp. predecessor) node of v on a fixed Hamiltonian cycle in in which no link is in F. Moreover, the algorithm Find-Ham-Cycle runs in time polynomial in n and log k. We also obtain a similar algorithm for an n-dimensional hypercube with at most n − 2 faulty links. We use our algorithms to obtain distributed algorithms to embed Hamiltonian cycles k-ary n-cubes and hypercubes with faulty links; our hypercube algorithm improves on a recently-derived algorithm due to Leu and Kuo, and our k-ary n-cube algorithm is the first distributed algorithm for embedding a Hamiltonian cycle in a k-ary n-cube with faulty links.

关键词： Interconnection networks k-ary n-cubes hypercubes fault-tolerance Hamiltonian cycles distributed algorithms embeddings

来源：评论

学校读者我要写书评

暂无评论

From Event-B Specifications to Programs for distributed algorithms

From Event-B Specifications to Programs for Distributed Algo...

引用

22nd IEEE International WETICE Conference (WETICE)

作者： Tounsi, Mohamed Mosbah, Mohamed Mery, Dominique Univ Bordeaux LaBRI F-33405 Talence France Univ Lorraine LORIA F-54506 Vandoeuvre Les Nancy France

ISBN: (纸本)9780769550022

Formal proofs of distributed algorithms are long, hard and tedious. We propose a general approach, based on the formal method Event-B, to automatically generate correct programs of distributed algorithms. Our approach is implemented with a translation tool, called B2Visidia, that generates Java code from an Event-B specification related to distributed algorithms. The resulting code can be run on classical distributed computing systems. To execute the induced programs, we use a tool called Visidia that can be used for experimenting, testing and visualizing programs of distributed algorithms.

关键词： Formal methods Event-B distributed algorithms Local computations Visidia distributed systems

来源：评论

学校读者我要写书评

暂无评论

Implementing crossplatform distributed algorithms using standard web technologies 40

Implementing crossplatform distributed algorithms using stan...

引用

40th Latin American Computing Conference (CLEI)

作者： Martinez, Gonzalo Val, Leonardo UCUDAL FIT Dept Informat & Ciencias Computac Montevideo Uruguay

ISBN: (纸本)9781479961306

This paper presents the development of a distributed computing framework based on standard web technologies. The workload is specified as Javascript code, split into pieces served via HTTP and executed by web workers inside the clients' web browser. Initially developed to run genetic algorithms in a parallel fashion, our implementation has been generalized into a system powerful enough to run any kind of computationally intensive work. It allows running a distributed algorithm in a huge number of different devices. There are no special software requirements since every modern platform with a powerful CPU and a network connection has at least one web browser available. The tests show tasks can be run in web browsers in a secure and efficient manner. We show the great portability and performance achieved using a simple test bed problem.

关键词： distributed algorithms distributed computing world wide web cross-platform Javascript

来源：评论

学校读者我要写书评

暂无评论

Adaptive distributed algorithms for power-efficient data gathering in sensor networks

Adaptive distributed algorithms for power-efficient data gat...

引用

International Conference on Wireless Networks, Communications and Mobile Computing

作者： Acimovic, J Beferull-Lozano, B Cristescu, R Ecole Polytech Fed Lausanne Lab Nonlinear Syst LANOS CH-1015 Lausanne Switzerland Ecole Polytech Fed Lausanne Audiovisual Commun Lab CH-1015 Lausanne Switzerland CALTECH Ctr Math Informat Pasadena CA 91125 USA

ISBN: (纸本)0780393058

In this work, we consider the problem of designing adaptive distributed processing algorithms in large sensor networks that are efficient in terms of minimizing the total power spent for gathering the spatially correlated data from the sensor nodes to a sink node. We take into account both the power spent for purposes of communication as well as the power spent for local computation. Our distributed algorithms are also matched to the nature of the correlated field, namely, for piecewise smooth signals, we provide two distributed multiresolution wavelet-based algorithms, while for correlated Gaussian fields, we use distributed prediction based processing. In both cases, we provide distributed algorithms that perform network division into groups of dif ferent sizes. The distribution of the group sizes within the network is the result of an optimal trade-off between the local communication inside each group needed to perform decorrelation, the communication needed to bring the processed data (coefficients) to the sink and the local computation cost, which grows as the network becomes larger. Our experimental results show clearly that important gains in power consumption can be obtained with respect to the case of not performing any distributed decorrelating processing.

关键词： adaptive signal processing data communication distributed algorithms signal resolution wavelet transforms wireless sensor networks adaptive distributed algorithms distributed multiresolution wavelet-based algorithms piecewise smooth signals power-efficie distributed algorithms signal resolution adaptive signal processing data communication wavelet transforms Sensor networks

来源：评论

学校读者我要写书评

暂无评论

Message Complexity of distributed algorithms Revisited 3

Message Complexity of Distributed Algorithms Revisited

引用

International Conference Parallel distributed Grid Computing

作者： Mann, Behnish Arvavid, Alex Univ Northern British Columbia Prince George BC Canada

ISBN: (纸本)9781479976836

distributed systems offer many features such as resource sharing, scalability, fault tolerance and reliability. Several distributed algorithms have been proposed in literature to solve fundamental problems such as mutual exclusion and leader election in distributed systems. When more than one algorithm is invented to solve the same problem particularly in asynchronous distributed systems, their performance is compared mostly based on the message complexity. This paper reviews the concept of message complexity and offers more clarity by studying the performance of the two most popular distributed algorithms - Ricart-Agrawala's algorithm and Raymond algorithm designed to solve the mutual exclusion problem. The paper has four main contributions (i) observes how the message complexity is understood and computed in the asynchronous distributed system so far and exposes its elusiveness;(ii) offers a more suitable definition of message complexity;(iii) briefly presents the simulator designed to study the performance of the distributed algorithms using the refined metric;and finally (iv) discusses about the simulation study to illustrate the significance and usefulness of the proposed metric.

关键词： communication complexity distributed algorithms Raymond algorithm Ricart-Agrawala algorithm distributed algorithm distributed system message complexity Algorithm design and analysis Complexity theory distributed algorithms Engines Measurement Network topology Topology distributed algorithms communication complexity distributed Systems Algorithm design and analysis Complexity theory Network topology Engines topology

来源：评论

学校读者我要写书评

暂无评论

Rapid Randomized Pruning for Fast Greedy distributed algorithms

Rapid Randomized Pruning for Fast Greedy Distributed Algorit...

引用

29th ACM SIGACT-SIGOPS Symposium on Principles of distributed Computing

作者： Pandit, Saurav Pemmaraju, Sriram V. Univ Iowa Dept Comp Sci Iowa City IA 52242 USA

ISBN: (纸本)9781605588889

We start by defining a pruning process involving sellers on one side and buyers on the other. The goal is to quickly select a subset of the sellers so that the products that these sellers bring to the market has small cost ratio, i.e., the ratio of the total cost of the selected sellers' products to amount that interested buyers are willing to pay. As modeled here, the pruning process can be used to speed up distributed implementations of greedy algorithms (e.g., for minimum dominating set, facility location, etc). We present a randomized instance of the pruning process that, for any positive k, runs in O(k) communication rounds with O(log N)-sized messages, yielding a cost ratio of O(N-c/k). Here N is the product of the number of sellers and number of buyers and c is a small constant. Using this O(k)-round pruning algorithm as the basis, we derive several simple, greedy, O(k)-round distributed approximation algorithms for AIDS and facility location (both metric and non-metric versions). Our algorithms achieve optimal approximation ratios in polylogarithmic rounds and shave a "logarithmic factor" off the best, known, approximation factor, typically achieved using LP-rounding techniques.

关键词： distributed algorithms Facility Location Greedy algorithms Minimum Dominating Set Primal-dual algorithms Randomized algorithms

来源：评论

学校读者我要写书评

暂无评论

A GENERAL FORMALISM FOR THE ANALYSIS OF distributed algorithms

A GENERAL FORMALISM FOR THE ANALYSIS OF DISTRIBUTED ALGORITH...

引用

2010 IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Sluciak, Ondrej Hilaire, Thibault Rupp, Markus Vienna Univ Technol Vienna Austria Inst Commun & Radio Frequency Engn Vienna Austria

ISBN: (纸本)9781424442966

The major contribution of this paper is the presentation of a general unifying description of distributed algorithms allowing to map local, node-based algorithms onto a single global, network-based form. As a first consequence the new description offers to analyze their learning and steady-state behavior by classical methods. A further consequence is the analysis of implementation issues as they appear due to quantization in computing and communication links. Exemplarily, we apply the new method on several different averaging algorithms: the Push-Sum protocol, average consensus as well as its quantized form and furthermore examine the effects of quantization noise which is introduced by the bandwidth limited communication links and finite precision computation ability of every node. Statistical properties of these quantization noises are provided and verified by simulations.

关键词： distributed algorithms unified description implementation quantization distributed averaging problem

来源：评论

学校读者我要写书评

暂无评论

Static Termination Analysis for Event-driven distributed algorithms 19

Static Termination Analysis for Event-driven Distributed Alg...

引用

13th ACM International Conference on distributed and Event-Based Systems (DEBS)

作者： Wiemuth, Felix Amthor, Peter Kuehnhauser, Winfried E. Tech Univ Ilmenau Ilmenau Germany

ISBN: (纸本)9781450367943

Termination is an important non-functional property of distributed algorithms. In an event-driven setting, the interesting aspect of termination is the possibility of control flow loops through communication, which this paper aims to investigate. In practice, it is often difficult to spot the possible communication behaviour of an algorithm at a glance. With a static analysis, the design process can be supported by visualizing possible flow of messages and give hints on possible sources of non-termination. We propose a termination analysis for distributed algorithms formulated in an event-driven specification language. The idea is to construct a message flow graph describing the possible communication between components (input-action pairs). We show that acyclicity of that graph implies termination. While many interesting algorithms indeed contain cycles, we also suggest ways of detecting cycles which cannot lead to non-termination. As a practical evaluation, we describe a concrete programming language together with a tool for automated termination analysis.

关键词： distributed algorithms event-driven algorithm specification programming languages message flow static analysis termination

来源：评论

学校读者我要写书评

暂无评论

A co-simulation approach for validating agent-based distributed algorithms in smart grid 20

A co-simulation approach for validating agent-based distribu...

引用

20th IEEE Mediterranean Eletrotechnical Conference (IEEE MELECON)

作者： Minh-Tri Le Tung-Lam Nguyen Quoc-Tuan Tran Besanger, Yvon Tran-The Hoang Univ Grenoble Alpes CNRS Grenoble INP G2Elab F-38000 Grenoble France Univ Grenoble Alpes CEA LITEN DTSLSEIINES F-73370 Le Bourget Du Lac France

ISBN: (纸本)9781728152004

The paper presents a proposed co-simulation platform for a realistic validation of distributed algorithms in smart grid with the integration of the multi-agent system. The platform uses a master framework called MOSAIK to manage and schedule all related simulators. A cyber-physical system is created for the operation. The physical system is a real-time simulator of the power grid;meanwhile, the cyber system is a cluster of independent agents with sparse communication. The Alternating direction method of multiplier (ADMM) for distributed optimal power flow is introduced and conducted to show the effectiveness of the proposed approach.

关键词： co-simulation distributed algorithms ADMM the multi-agent system mosaik

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：