Multinode broadcast in hypercubes and rings with randomly distributed length of packets

Multinode broadcast in hypercubes and rings with randomly distributed length of packets

Includes bibliographical references (p. 19-20).

Bibliographic Details
Other Authors:	Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
Language:	eng
Published:	Massachusetts Institute of Technology, Laboratory for Information and Decision Systems 2002
Subjects:	TK7855.M41 E3845 no.2006
Online Access:	http://hdl.handle.net/1721.1/1179

Similar Items

Partial multinode broadcast and partial exchange algorithms for d-dimensional meshes
Published: (2003)

An efficient algorithm for multiple simultaneous broadcasts in the hypercube
Published: (2002)

Optimal communication algorithms for hypercubes
Published: (2003)

The efficiency of greedy routing in hypercubes and butterflies
Published: (2002)

Performance of hypercube routing schemes with or without buffering
Published: (2003)

Communication algorithms for isotropic tasks in hypercubes and wraparound meshes
Published: (2003)

Transposition of banded matrices in hypercubes : a "nearly isotropic" task
Published: (2003)

A conflict sense routing protocol and its performance for hypercubes
Published: (2003)

Topology broadcast algorithms
Published: (2003)

Dynamic broadcasting in parallel computing
Published: (2003)

Finding parity in a broadcast network
Published: (2003)

Wavelet packet based transient signal classification
Published: (2003)

Wavelet-packet-based multiple access communication
Published: (2003)

Broadcasting topology and routing information in computer networks
Published: (2003)

A wavelet packet approach to transient signal classification
Published: (2003)

Some complexity results about packet radio networks
Published: (2003)

Convergence study of an iterative joint detector for wavelet packet multiple-access communication
Published: (2003)

Examination of wavelet packet signal sets for over-saturated multiple access communications
Published: (2003)

Finding small dominating sets in stationless mobile packet radio networks Abhay K. Parekh.
Published: (2002)

Linear systems over Noetherian rings in the behavioural approach
Published: (2003)

Area and length preserving geometric invariant scale-spaces
Published: (2003)

A reliable broadcast algorithm
Published: (2002)

Two interfering queues in packet-radio networks
Published: (2002)

Modelling and estimation for random fields
Published: (2003)

Multiscale representations of Markov random fields
Published: (2003)

Multiscale representations of Markov random fields
Published: (2003)

On the design of distributed organizational structures
Published: (2003)

On the distributions of optimized multiscale representations
Published: (2003)

Maximum a-Posteriori estimation of random fields.
Published: (2003)

On the communication complexity of distributed algebraic computation
Published: (2003)

Generation of architectures for distributed intelligence systems
Published: (2003)

On distributed network protocols for changing topologies
Published: (2003)

Delays in acyclical distributed decisionmaking organizations
Published: (2003)

Human organizations as distributed intelligence systems
Published: (2003)

Markov random fields, stochastic quantization and image analysis
Published: (2002)

On the use of random numbers in asynchronous simulation via rollback
Published: (2003)

Markov random fields, stochastic quantization and image analysis
Published: (2003)

Sampling theorems for 2-D isotropic random fields
Published: (2003)

Stochastic processes that generate polygonal and related random fields
Published: (2003)

Recursive estimation for 2-D isotropic random fields
Published: (2003)