Work-Preserving Emulations of Fixed-Connection Networks

Abstract

In this paper the problem of emulating TG steps of an NG-node guest network on an NH-node host network. We call an emulation work-preserving if the time required by the host, TH, is O(TGNG/NH) because then both the guest and host networks perform the same total work to within a constant factor. We say that an emulation is real-time if TH = O(TG), because then the host emulates the guest with constant delay. Although many isolated emulation results have been proved for specific networks in the past, and measures such as dilation and congestion were known to be important, the field has lacked a model within which general results and meaningful lower bounds can be proved. We attempt to provide such a model, along with corresponding general techniques and specific results in this paper.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1989
Accession Number
ADA217118

Entities

People

  • Arnold Rosenberg
  • Bruce Maggs
  • Richard Koch
  • S.I. Rao
  • Tom Leighton

Organizations

  • Massachusetts Institute of Technology

Tags

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Arrays
  • Computations
  • Computer Science
  • Computers
  • Congestion
  • Lepidoptera
  • Linear Arrays
  • Parallel Computing
  • Parallel Processing
  • Permutations
  • Probability
  • Simulations
  • Standards
  • Trees (Data Structures)
  • Very Large Scale Integration

Fields of Study

  • Computer science

Readers

  • Computational Modeling and Simulation
  • Computer Networking