Routing on the Channel Dependency Graph:

Routing on the Channel Dependency Graph:

In the pursuit for ever-increasing compute power, and with Moore's law slowly coming to an end, high-performance computing started to scale-out to larger systems. Alongside the increasing system size, the interconnection network is growing to accommodate and connect tens of thousands of compute...

Full description

Bibliographic Details
Main Author: Domke, Jens
Other Authors: Technische Universität Dresden, Fakultät Informatik
Format: Doctoral Thesis
Language:English
Published: Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden 2017
Subjects:
Netzwerkmanagement
Routing
Hochleistungsrechnen
Blockierungsfrei
high performance computing
network management
routing protocols
deadlock-free
virtual channels
unicast
network simulations
fail-in-place
fault tolerance
ddc:004
rvk:ST 200
Online Access:http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-225902
http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-225902
http://www.qucosa.de/fileadmin/data/qucosa/documents/22590/thesis.pdf

Internet

http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-225902
http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-225902
http://www.qucosa.de/fileadmin/data/qucosa/documents/22590/thesis.pdf

Similar Items