Optimal simulations by Butterfly Networks

@inproceedings{Bhatt1988OptimalSB,
  title={Optimal simulations by Butterfly Networks},
  author={Sandeep N. Bhatt and Fan Chung Graham and Jia-Wei Hong and Frank Thomson Leighton and Arnold L. Rosenberg},
  booktitle={STOC '88},
  year={1988}
}
  • Sandeep N. Bhatt, Fan Chung Graham, +2 authors Arnold L. Rosenberg
  • Published in STOC '88 1988
  • Mathematics, Computer Science
  • THE POWER OF BUTTERFLY-TYPE NETWORKS RELATIVE TO OTHER PROPOSED MULTI- COMPUTER INTERCONNECTION NETWORKS IS STUDIED, BY CONSIDERING HOW EFFICIENT- LY THE BUTTERFLY CAN SIMULATE THE OTHER NETWORKS. SIMULATION IS REPRESENT- ED FORMALLY VIA GRAPH EMBEDDINGS, SO THE TOPIC HERE BECOMES: HOW EFFICIENT- LY CAN ONE EMBED THE GRAPH UNDERLYING A GIVEN NETWORK IN THE GRAPH UNDERLY- ING THE BUTTERFLY NETWORK? THE EFFICIENCY OF AN EMBEDDING OF A GRAPH ''G'' IN A GRAPH ''H'' IS MEASURED IN TERMS OF: THE… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 20 CITATIONS

    An approach to emulating separable graphs

    VIEW 4 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Embedding Complete Binary Trees into Butterfly Networks

    VIEW 10 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Graph embeddings and simplicial maps

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Aspects of k-k routing in meshes and OTIS networks

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Comparison of regular 3D interconnections