Abstract
In a data broadcast we begin with data in the A register of processor zero of the hypercube. This data is to be transmitted to the A register of each of the remaining processors in the hypercube. This may be accomplished using the binary tree transmitting scheme of Figure 2.1. This figure is for the case of a dimension 3 hypercube. The data to be broadcast is initially only in processor 0 (root of the broadcast tree). It is transmitted along bit 0 to processor 1 (001). This is denoted by the arrow from the root to its right child. Now processors 0 and 1 (level 2 processors) have the data. Both transmit along bit 1. The data is now contained in all level 3 processors (0, 2, 1, 3). These processors now send the data to their neighbor processors along bit 2. As a result, all processors in the hypercube have the data.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Ranka, S., Sahni, S. (1990). Fundamental Operations. In: Hypercube Algorithms. Bilkent University Lecture Series. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9692-5_2
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9692-5_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-9694-9
Online ISBN: 978-1-4613-9692-5
eBook Packages: Springer Book Archive