Entry Boari:1995:ARD from ieeepardisttech.bib

Last update: Fri Mar 2 02:06:23 MST 2018                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Boari:1995:ARD,
  author =       "Maurelio Boari and Antonio Corradi and Cesare
                 Stefanelli and Letizia Leonardi",
  title =        "Adaptive Routing for Dynamic Applications in Massively
                 Parallel Architectures",
  journal =      j-IEEE-PAR-DIST-TECH,
  volume =       "3",
  number =       "1",
  pages =        "61--74",
  month =        "Spring",
  year =         "1995",
  CODEN =        "IPDTEX",
  DOI =          "https://doi.org/10.1109/88.384585",
  ISSN =         "1063-6552 (print), 1558-1861 (electronic)",
  ISSN-L =       "1063-6552",
  bibdate =      "Mon Jun 7 07:52:29 MDT 1999",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeepardisttech.bib",
  URL =          "http://dlib.computer.org/pd/books/pd1995/pdf/h10061.pdf;
                 http://www.computer.org/concurrency/pd1995/p1061abs.htm",
  acknowledgement = ack-nhfb,
  affiliation =  "Universita di Bologna",
  affiliationaddress = "Italy",
  classification = "722; 722.3; 722.4; 723; C5220P (Parallel
                 architecture); C6150N (Distributed systems software)",
  corpsource =   "Bologna Univ., Italy",
  journalabr =   "IEEE Parallel Distrib Technol",
  keywords =     "Adaptive routing; adaptive routing; adaptive systems;
                 Algorithms; communication; Computer architecture;
                 Computer networks; Data communication systems; dynamic
                 applications; exchange; Hot-Spot Avoiding algorithm;
                 long-lasting entities; loops; Massively parallel
                 architectures; massively parallel architectures;
                 message; message delivery; message passing;
                 neighborhood information; Network protocols; nonminimal
                 paths; Packet switching; packet switching; parallel
                 architectures; Parallel processing systems; patterns;
                 performance; Process allocation; routers;
                 source-destination path; Virtual Path algorithm",
  treatment =    "T Theoretical or Mathematical",
}

Related entries