Title
Help Your Busy Neighbors: Dynamic Multicasts over Static Topologies.
Abstract
Acknowledged multicasts, e.g. for software-based TLB invalidation, are a performance critical aspect of runtime environments for many-core processors. Their latency and peak throughput highly depend on the topology used to propagate the events and to collect the acknowledgements. Based on the assumption of an inevitable interrupt latency, previous work focused on very simple flat topologies. However, the emergence of simultaneous multi-threading with locally shared caches enables interrupt-free multicasts. Therefore, this paper explores and re-evaluates the design space for dynamic multicast groups based on combining shared memory with active messages and helping mechanisms. We expect this new approach to considerably improve the scalability of acknowledged multicasts on many-core processors.
Year
Venue
Field
2017
Euro-Par Workshops
Shared memory,Interrupt latency,Computer science,Latency (engineering),Network topology,Throughput,Multicast,Translation lookaside buffer,Scalability,Distributed computing
DocType
Citations 
PageRank 
Conference
0
0.34
References 
Authors
16
3
Name
Order
Citations
PageRank
Robert Kuban100.68
Randolf Rotta21148.98
Jörg Nolte32910.00