Browsing by Author "Minkenberg, Cyriel"
Now showing items 1-7 of 7
-
A scalable synthetic traffic model of Graph500 for computer networks analysis
(2017-12-25)
Article
Open AccessThe Graph500 benchmark attempts to steer the design of High-Performance Computing systems to maximize the performance under memory-constricted application workloads. A realistic simulation of such benchmarks for architectural ... -
Characterizing the communication demands of the Graph500 benchmark on a commodity cluster
(Institute of Electrical and Electronics Engineers (IEEE), 2014)
Conference report
Open AccessBig Data applications have gained importance over the last few years. Such applications focus on the analysis of huge amounts of unstructured information and present a series of differences with traditional High Performance ... -
Contention-based nonminimal adaptive routing in high-radix networks
(Institute of Electrical and Electronics Engineers (IEEE), 2015)
Conference report
Open AccessAdaptive routing is an efficient congestion avoidance mechanism for modern Datacenter and HPC networks. Congestion detection traditionally relies on the occupancy of the router queues. However, this approach can hinder ... -
FlexVC: Flexible virtual channel management in low-diameter networks
(Institute of Electrical and Electronics Engineers (IEEE), 2017)
Conference report
Open AccessDeadlock avoidance mechanisms for lossless lowdistance networks typically increase the order of virtual channel (VC) index with each hop. This restricts the number of buffer resources depending on the routing mechanism and ... -
Oblivious routing schemes in extended generalized fat tree networks
(IEEE Computational Intelligence Society, 2009)
Conference report
Open AccessA family of oblivious routing schemes for fat trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S-mod-k and D-mod-k, are analyzed in detail. ... -
On-the-fly adaptive routing for dragonfly interconnection networks
(2015-03-01)
Article
Open AccessAdaptive deadlock-free routing mechanisms are required to handle variable traffic patterns in dragonfly networks. However, distance-based deadlock avoidance mechanisms typically employed in Dragonflies increase the router ... -
Randomizing task placement does not randomize traffic (enough)
(2013)
Conference report
Restricted access - publisher's policyDragonflies are one of the most promising topologies for the Exascale effort for their scalability and cost. Dragonflies achieve very high throughput under uniform traffic, but have a pathological behavior under other ...
