The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Generalized Hypercube and Hyperbus Structures for a Computer Network
Abstract
A general class of hypercube structures is presented in this paper for interconnecting a network of microcomputers in parallel and distributed environments. The interconnection is based on a mixed radix number system and the technique results in a variety of hypercube structures for a given number of processors N, depending on the desired diameter of the network. A cost optimal realization is obtained through a process of discrete optimization. The performance of such a structure is compared to that of other existing hypercube structures such as Boolean n-cube and nearest neighbor mesh computers.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Parallel Processing with the Perfect Shuffle
Stone, H. S. (1971) · IEEE Transactions on Computers · doi:10.1109/t-c.1971.223205 · Cited by 1,245
A Survey of Interconnection Networks
Feng, T.-Y. (1981) · Computer · doi:10.1109/c-m.1981.220290 · Cited by 796
Queueing Systems, Vol. II: Computer Applications.
Butterworth, R. W., & Kleinrock, L. (1977) · Journal of the American Statistical Association · doi:10.2307/2286502 · Cited by 308
Computer Interconnection Structures: Taxonomy, Characteristics, and Examples
Anderson, G. A., & Jensen, E. D. (1975) · ACM Computing Surveys · doi:10.1145/356654.356658 · Cited by 189
Cited by
BCube: a high performance, server-centric network architecture for modular data centers
Guo, C., Lu, G., Li, D., Wu, H., Zhang, X., Shi, Y., Tian, C., Zhang, Y., & Lu, S. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592577 · Cited by 1,372
Improving the Scalability of Data Center Networks with Traffic-aware Virtual Machine Placement
Meng, X., Pappas, V., & Zhang, L. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5461930 · Cited by 935
Jellyfish: Networking Data Centers Randomly
Singla, A., Hong, C.-Y., Popa, L., & Godfrey, P. B. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1110.1687 · Cited by 357
Network-Aware Virtual Machine Placement and Migration in Cloud Data Centers
Ferdaus, M. H., Murshed, M., Calheiros, R. N., & Buyya, R. (2015) · Advances in Systems Analysis, Software Engineering, and High Performance Computing · doi:10.4018/978-1-4666-8213-9.ch002 · Cited by 38
Metadata
- Authors
- Bhuyan, & Agrawal
- Venue
- IEEE Transactions on Computers
- Published
- 1984-04
- Volume
- C-33
- Issue
- 4
- Pages
- 323-333
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W2113113620
- Cited by
- 855
- References
- 4
- FWCI
- 13.29
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Generalized Hypercube and Hyperbus Structures for a Computer Network. https://app.cochat.ai/papers/10.1109/tc.1984.1676437
- The paper
- Bhuyan, & Agrawal. (1984). Generalized Hypercube and Hyperbus Structures for a Computer Network. IEEE Transactions on Computers. https://doi.org/10.1109/tc.1984.1676437
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
