Filters








25,747 Hits in 5.2 sec

Broadcasting multiple messages in a grid

Frances L. Van Scoy, Jeffrey A. Brooks
1994 Discrete Applied Mathematics  
The problem of broadcasting in grid graphs is discussed. Two algorithms for broadcasting m messages in an n x n grid are given.  ...  An algorithm for broadcasting m messages in an n x n x n grid which requires time 3n + yrn + 2 is presented.  ...  For broadcasing multiple messages in grids, Van Scoy [l l] modified the single message grid algorithm of Farley and Hedetniemi [S] and was able to broadcast m messages from a corner of an n x n grid  ... 
doi:10.1016/0166-218x(94)90194-5 fatcat:hgv2yer2snbxjivvasa6w7jqei

On broadcasting multiple messages in a d-dimensional grid

Y. Roditty, B. Shoham
1997 Discrete Applied Mathematics  
An algorithm for broadcasting multiple messages on a d-dimensional grid (d > 3 ) starting from the (1, 1, , 1) comer is presented.  ...  This answers a conjecture that appears in Van Scoy and Brookes (1994), namely, that the time required for broadcasting m messages over this d-dimensional grid is dn + ((d' + 1 )/d)m + k, k being a constant  ...  Introduction, definitions and notation The problem of broadcasting discussed in the paper of Van references are presented there. multiple messages on a d-dimensional grid has been Scoy and Brooks [2]  ... 
doi:10.1016/s0166-218x(97)89163-9 fatcat:k6huknnmifc7djv2adwyi33xiu

Reliable Broadcast in Wireless Mobile Ad Hoc Networks

M. Mohsin, D. Cavin, Y. Sasson, R. Prakash, A. Schiper
2006 Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06)  
We propose a single source reliable broadcasting algorithm for linear grid-based networks where a message is guaranteed to be delivered to all the nodes of the network.  ...  We show that reliable broadcast can be achieved in O(D log n) time-slots despite node mobility, where D is the diameter of the network and n the number of nodes.  ...  During the application slots, nodes can transmit the broadcast message and possibly move at a constant speed and in a fixed direction from one grid point to an adjacent grid point.  ... 
doi:10.1109/hicss.2006.413 dblp:conf/hicss/MohsinCSPS06 fatcat:7fgs4q5ohvclrgl6h7pmpgp47e

Efficient broadcast in P2P grids

P. Merz, K. Gorunova
2005 CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005.  
In this paper, we present an efficient algorithm for performing a broadcast operation in P2P grids.  ...  The resulting meta architecture provides higher robustness as well as higher speed and lower message complexity than appropriate base methods.  ...  Usually, P2P grids compensate this disadvantage by extremely high redundancy of broadcast transmissions. In this paper, we propose a new method for broadcast distribution in P2P grids.  ... 
doi:10.1109/ccgrid.2005.1558560 dblp:conf/ccgrid/MerzG05 fatcat:dqkc7htg35dm7czvs7k7qplxpe

High-Performance MPI Broadcast Algorithm for Grid Environments Utilizing Multi-lane NICs

Tatsuhiro Chiba, Toshio Endo, Satoshi Matsuoka
2007 Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)  
Our new broadcast algorithm for grid environments harnesses almost all downward and upward bandwidths of multi-lane NICs; A message to be broadcast is split into two pieces, which are broadcast along two  ...  The performance of MPI collective operations, such as broadcast and reduction, is heavily affected by network topologies, especially in grid environments.  ...  Acknowledgement This work is partly supported by Grant-in-Aid for Scientific Research (No. 18049028 and No. 17700050) from Ministry of Education, Culture, Sports and Technology, Japan.  ... 
doi:10.1109/ccgrid.2007.59 dblp:conf/ccgrid/ChibaEM07 fatcat:bb7tyc6urrck7kx6qq2ubwxhii

TDMA service for sensor networks

S.S. Kulkarni
2004 24th International Conference on Distributed Computing Systems Workshops, 2004. Proceedings.  
In this paper, we present a simple time division multiple access (TDMA) algorithm for assigning time slots to sensors and show that it provides a significant reduction in the number of collisions incurred  ...  If a sensor receives two messages simultaneously then they collide and both messages become incomprehensible.  ...  The TDMA algorithm in [6] is designed for broadcast, where the base station sends some information to all sensors on a rectangular grid.  ... 
doi:10.1109/icdcsw.2004.1284094 dblp:conf/icdcsw/KulkarniA04 fatcat:cc5tm6jwtrhxflimf6db3os27q

Topology-oblivious optimization of MPI broadcast algorithms on extreme-scale platforms

Khalid Hasanov, Jean-Noël Quintin, Alexey Lastovetsky
2015 Simulation modelling practice and theory  
Theoretical analysis and experimental results on IBM BlueGene/P and a cluster of the Grid'5000 platform are presented. Please cite this article in press as: K.  ...  In this work we propose a simple but general approach to optimization of the legacy MPI broadcast algorithms, which are widely used in MPICH and Open MPI.  ...  Another part of the experiments were carried out using the resources of the Supercomputing Laboratory at King Abdullah University of Science&Technology (KAUST) in Thuwal, Saudi Arabia.  ... 
doi:10.1016/j.simpat.2015.03.005 fatcat:lqfej5bejzer7gx6esnul5xcpu

Bounded-Latency Alerts in Vehicular Networks

Rahul Mangharam, Raj Rajkumar, Mark Hamilton, Priyantha Mudaliget, Fan Bait
2007 2007 Mobile Networking for Vehicular Environments  
In this paper, we present a Location Division Multiple Access (LDMA) scheme to suppress the broadcast storm problem and ensure bounded end-to-end delay across multiple hops.  ...  The objective for a safety protocol is to relay messages across multiple vehicles within a 1.5-2km distance to alert approaching vehicles within a bounded end-to-end delay (e.g. 1.5 sec).  ...  By scheduling spatial cells in a pipelined manner in time, a vehicle in an active cell is allowed to broadcast a message.  ... 
doi:10.1109/move.2007.4300804 fatcat:lmnw5xp5mzgjfljhznijorhzzq

Toward secure targeted broadcast in smart grid

Zubair Fadlullah, Nei Kato, Rongxing Lu, Xuemin Shen, Yousuke Nozaki
2012 IEEE Communications Magazine  
Obviously, this kind of flexible targeted broadcast is secure and efficient, where the encrypted messages can only be decrypted by the targeted group without the need for multiple encrypted message generation  ...  T w o -w a ŷ ŵ Ă ƌƚ 'ƌŝĚ In this article, towards secure and flexible targeted broadcast in smart grid, we consider a new targeted broadcast mechanism with Key Policy Attribute-Based Encryption (KP-ABE  ... 
doi:10.1109/mcom.2012.6194396 fatcat:v3dzxcx36zfdng5nvbelnxphtu

Application-oriented adaptive MPI/spl I.bar/Bcast for grids

R. Gupta, S. Vadhiyar
2006 Proceedings 20th IEEE International Parallel & Distributed Processing Symposium  
In particular, we consider two broadcast parameters used in the application, namely, the broadcast message sizes and the time interval between the broadcasts.  ...  Recently, there has been an increasing interest to evolve efficient broadcast algorithms for computational Grids.  ...  Also, many tanks to the reviewers whose comments helped in significantly improving the quality of the paper.  ... 
doi:10.1109/ipdps.2006.1639363 dblp:conf/ipps/GuptaV06 fatcat:hkmhhj5ucrh3plcfkpxamj2hdm

Secure Group Message Transfer Stegosystem

Mahinder Pal Singh Bhatia, Manjot Kaur Bhatia, Sunil Kumar Muttoo
2015 International Journal of Information Security and Privacy  
This paper proposes a new secure message broadcasting system to hide the messages in such a way that an attacker cannot sense the existence of messages.  ...  In the proposed system, the authors use steganography and image encryption to hide group keys and secret messages using group keys in images for secure message broadcasting.  ...  INTRODUCTION Security is one of an important issue and essential requirement in grid environment. Grid allows users from multiple domains to work in groups by sharing information with each other.  ... 
doi:10.4018/ijisp.2015100103 fatcat:wncnzwzitndpvb3bhhmpay4q7i

An efficient MPI_allgather for grids

Rakhi Gupta, Sathish S. Vadhiyar
2007 Proceedings of the 16th international symposium on High performance distributed computing - HPDC '07  
In this paper, we present an algorithm for allgather on grids that efficiently utilizes wide-area bandwidths and is also wide-area optimal.  ...  Our experiments on a real-grid setup consisting of 3 sites show that our algorithm gives an average performance improvement of 52% over existing strategies.  ...  In this case, choosing multiple nodes in a cluster to send messages to nodes in another cluster will lead to poor performance of broadcast operations.  ... 
doi:10.1145/1272366.1272388 dblp:conf/hpdc/GuptaV07 fatcat:rdfcbgiftbacboymv4olyoczhm

On the complexity and distributed construction of energy-efficient broadcast trees in wireless ad hoc networks

A.S. Ahluwalia, E.H. Modiano
2005 IEEE Transactions on Wireless Communications  
We also consider the possibility of having multiple source nodes that can be used to broadcast the message and adapt our algorithm to compute energy-efficient broadcast trees with multiple source nodes  ...  We then develop a distributed clustering algorithm that computes energy-efficient broadcast trees in polynomial time.  ...  We also introduced the multiple-source broadcasting problem, where a number of nodes can be used as source nodes to broadcast the message.  ... 
doi:10.1109/twc.2005.853824 fatcat:nc24i6lz6vcwdccq6zw7ugzbbq

A Multilevel Approach to Topology-Aware Collective Operations in Computational Grids [article]

N. T. Karonis, B. de Supinski, I. Foster, W. Gropp, E. Lusk
2002 arXiv   pre-print
This assumption is violated in most practical settings, however, particularly in heterogeneous systems such as clusters of SMPs and wide-area "computational Grids," with the result that collective operations  ...  We present a strategy based upon a multilayer view of the network. By creating multilevel topology-aware trees we take advantage of communication cost differences at every level in the network.  ...  This work was supported in part by the Mathematical, Information, and Computational Sciences Division  ... 
arXiv:cs/0206038v1 fatcat:riqgiqeebvby3mibbixegfbwee

Uniform versus non-uniform band switching in WDM networks

Li-Wei Chen, Poompat Saengudomlert, Eytan Modiano
2006 Computer Networks  
We also consider the possibility of having multiple source nodes that can be used to broadcast the message and adapt our algorithm to compute energy-efficient broadcast trees with multiple source nodes  ...  We then develop a distributed clustering algorithm that computes energy-efficient broadcast trees in polynomial time.  ...  We also introduced the multiple-source broadcasting problem, where a number of nodes can be used as source nodes to broadcast the message.  ... 
doi:10.1016/j.comnet.2005.05.017 fatcat:mccxz2u7hbanfmzj55ianh6dtm
« Previous Showing results 1 — 15 out of 25,747 results