Filters








460 Hits in 3.1 sec

Note on the problem of gossiping in multidimensional grids

M Mahéo, J.-F Saclé
1994 Discrete Applied Mathematics  
This problem asked for the minimum time required to gossip in multidimensional nontoroidal grids.  ...  Recently, we solved a problem which we found in a list given at the international workshop on Broadcasting and Gossiping in Vancouver (July 1990).  ...  We evaluate the minimum time T, requested to gossip in a family of networks, the k-dimensional grids.  ... 
doi:10.1016/0166-218x(94)90191-0 fatcat:uz2qujnoojaknnp3bngqghlmay

Gossiping in Minimal Time

David W. Krumme, George Cybenko, K. N. Venkataraman
1992 SIAM journal on computing (Print)  
The gossip problem involves communicating a unique item from each node in a graph to every other node.  ...  In particular, we settle an open problem about minimum time gossiping in complete graphs.  ...  The hypercube comes closest to this bound as far as we know: for the hypercube, D = lg N and the best solution we know of takes almost 2D steps.  ... 
doi:10.1137/0221010 fatcat:g2mihrzj4zhobn7yz63r76sj5a

Page 3806 of Mathematical Reviews Vol. , Issue 95g [page]

1995 Mathematical Reviews  
(F-PARIS11-RI; Orsay) Note on the problem of gossiping in multidimensional grids. (English summary) Proceedings International Workshop on Broadcasting and Gossiping 1990 (Sechelt, BC). Discrete Appl.  ...  It is shown that the minimal gossiping time in a multidimen- sional grid of size n; x nz x--- x ny is the diameter of the grid unless all n; = 3.  ... 

Page 641 of Mathematical Reviews Vol. , Issue 95b [page]

1995 Mathematical Reviews  
Saclé, Note on the problem of gossiping in multidimensional grids (287-290); Philippe Michallon and Denis Trystram, Practical experiments of broadcasting algorithms on a configurable parallel computer  ...  Brooks, Broadcasting multiple messages in a grid (321-336). {Most of the papers are being reviewed individually.}  ... 

Note on optimal gossiping in some weak-connected graphs

Juraj Hromkovič, Claus-Dieter Jeschke, Burkhard Monien
1994 Theoretical Computer Science  
Acknowledgment We would like to thank Mike Paterson and the unknown referees for the suggestions and comments which have helped to improve the presentation of this paper.  ...  Optimal or almost optimal gossip algorithms are designed for two-dimensional grids in [ 11, and for multidimensional grids in [4] .  ...  We note that the accumulation ("census") problem has the same complexity as the broadcast problem (to solve the accumulation problem one can take the rounds of a broadcast algorithm in a reverse order  ... 
doi:10.1016/0304-3975(94)90049-3 fatcat:3oqbdbnaj5c2vecaxkqdz4zfgq

Page 2936 of Mathematical Reviews Vol. , Issue 95e [page]

1995 Mathematical Reviews  
This shows that, in spite of the fact that routing problems contain more information at the beginning than the sorting problems, there is no substantial difference between them on grids and tori.  ...  95e:68617 95e:68017 68M10 68Q25 Kunde, Manfred (D-MUTUI,; Munich) Block gossiping on grids and tori: deterministic sorting and routing match the bisection bound.  ... 

Methods and problems of communication in usual networks

Pierre Fraigniaud, Emmanuel Lazard
1994 Discrete Applied Mathematics  
This paper is a survey of existing methods of communication in usual networks.  ...  Hopefully, optimal results are not always known and we present a list of open problems.  ...  Acknowledgement Both authors are grateful to Dominique Sotteau and one of the referees for many helpful remarks.  ... 
doi:10.1016/0166-218x(94)90180-5 fatcat:bexo5ye4sfatvp3gzxeeu7skrm

A Sampling Framework for Solving Physics-Driven Inverse Source Problems

John Murray-Bruce, Pier Luigi Dragotti
2017 IEEE Transactions on Signal Processing  
Based on this new framework we develop practical, noise robust, sensor network strategies for solving the inverse source problem, and then present numerical simulation results to verify their performance  ...  Leveraging from certain results in sampling and approximation theory, we present a new framework for solving a class of inverse source problems for physical fields governed by linear partial differential  ...  To treat our multidimensional problem, we now extend formally the one-dimensional formulae obtained in [38] to the multidimensional case.  ... 
doi:10.1109/tsp.2017.2742983 fatcat:sgglkdnmnnafhn6kmftuug45su

The XtreemOS Resource Selection Service

Corina Stratan, Jan Sacha, Jeff Napper, Paolo Costa, Guillaume Pierre
2012 ACM Transactions on Autonomous and Adaptive Systems  
We show that our solution scales in the number of resources and in the number of attributes, while being relatively insensitive to churn and other membership changes like node failures.  ...  Our RSS continuously self-adapts its routing structure in response to variations in the distribution of node attributes and queries.  ...  For the same reason, we do not impose an upper bound on attribute values: in our example, all nodes with more than 8 GB of RAM will be placed in the lowest row of the grid.  ... 
doi:10.1145/2382570.2382573 fatcat:vyvowqvlwzbbpmunqhg2gu5v2m

Meridian

Bernard Wong, Aleksandrs Slivkins, Emin Gün Sirer
2005 Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications - SIGCOMM '05  
The framework consists of an overlay network structured around multi-resolution rings, query routing with direct measurements, and gossip protocols for dissemination.  ...  Large scale simulations, based on latency measurements from 6.25 million node-pairs as well as an implementation deployed on PlanetLab show that the framework is accurate and effective.  ...  Acknowledgments We would like to thank our shepherd, Jon Crowcroft, Jon Kleinberg and the anonymous reviewers for many helpful comments and suggestions.  ... 
doi:10.1145/1080091.1080103 dblp:conf/sigcomm/WongSS05 fatcat:hnmllebvdbchfoocw632m44ana

Meridian

Bernard Wong, Aleksandrs Slivkins, Emin Gün Sirer
2005 Computer communication review  
The framework consists of an overlay network structured around multi-resolution rings, query routing with direct measurements, and gossip protocols for dissemination.  ...  Large scale simulations, based on latency measurements from 6.25 million node-pairs as well as an implementation deployed on PlanetLab show that the framework is accurate and effective.  ...  Acknowledgments We would like to thank our shepherd, Jon Crowcroft, Jon Kleinberg and the anonymous reviewers for many helpful comments and suggestions.  ... 
doi:10.1145/1090191.1080103 fatcat:am4s7pxgy5gnvacd74fkkm7y4q

TSS: Efficient Term Set Search in Large Peer-to-Peer Textual Collections

Hanhua Chen, Jun Yan, Hai Jin, Yunhao Liu, Lionel M. Ni
2010 IEEE transactions on computers  
the scale of O(nlog(n)).  ...  Previous multikeyword search in DHT-based P2P systems often relies on multiple single keyword search operations, suffering from unacceptable traffic cost and poor accuracy.  ...  In this paper, we focus on the scalability problem of term set indexing in large-scale P2P search engines.  ... 
doi:10.1109/tc.2010.81 fatcat:3dkwa3fmejcb5dklbw2jja2avu

Autonomous Resource Selection for Decentralized Utility Computing

Paolo Costa, Jeff Napper, Guillaume Pierre, Maarten van Steen
2009 2009 29th IEEE International Conference on Distributed Computing Systems  
We show that our solution scales in the number of resources as well as in the number of attributes, while being relatively insensitive to churn and other membership changes such as node failures.  ...  An application specifies what it expects from a resource by means of a conjunction of (attribute,value-range) pairs, which are matched against the attribute values of resources.  ...  For the same reason, we do not impose an upper bound on attribute values: in our example, all nodes with more than 8 GB of RAM will be placed in the lowest row of the grid.  ... 
doi:10.1109/icdcs.2009.70 dblp:conf/icdcs/CostaNPS09 fatcat:ziapr4m2o5ak5m3oblafkjz2la

Dynamic Optimization of Multiattribute Resource Allocation in Self-Organizing Clouds

Sheng Di, Cho-Li Wang
2013 IEEE Transactions on Parallel and Distributed Systems  
We show the SOC with our optimized algorithms can make an improvement by 15-60 percent in system throughput than a P2P Grid model.  ...  By integrating volunteer computing into cloud architectures, we envision a gigantic self-organizing cloud (SOC) being formed to reap the huge potential of untapped commodity computing power over the Internet  ...  The problem of job scheduling in Grids is usually categorized as a multiprocessor scheduling (MPS) problem [5] , [6] (a kind of combinatorial optimization problem), which has been proved to be NP-complete  ... 
doi:10.1109/tpds.2012.144 fatcat:tfv6knwgond3zml6akbsnbjlmu

Resource discovery for distributed computing systems: A comprehensive survey

Javad Zarrin, Rui L. Aguiar, João Paulo Barraca
2018 Journal of Parallel and Distributed Computing  
In this paper, we provide an investigation on the current state of resource discovery protocols, mechanisms, and platforms for large-scale distributed environments, focusing on the design aspects.  ...  We classify all related aspects, general steps, and requirements to construct a novel resource discovery solution in three categories consisting of structures, methods, and issues.  ...  One of the ideas to overcome this problem is the convergence of the Cloud with Grid along the line of the inter-Clouds federation.  ... 
doi:10.1016/j.jpdc.2017.11.010 fatcat:v4dfsniptfgbxk6aswjjbtt7nu
« Previous Showing results 1 — 15 out of 460 results