Parallelism by tee in bash
This is what I did in my simulation processing code.
[more]
Reservoir Sampling with Uniform Probability
Assume you have a million lines of data in ordered pairs and you want to plot it in GNU Plot. That’s likely to kill your computer. Indeed, plotting a million dots on a graph does not give more information than that plotting a thousand dots. Therefore, how we can sample...
[more]
Threading performance checker using GDB
gdb -ex “set pagination 0″ -ex “thread apply all bt” –batch -p ${pid} | awk ‘BEGIN { s = “”; } /Thread/ { print s; s = “”; } /^\#/ { if (s != “” ) { s = s “,” $4} else { s = $4 } } END...
[more]
Kandula et al (2009) Flyways To De-Congest Data Center Networks (HotNets)
This paper says, if we require a network to be not oversubscribed, the cost is high. For example, if we use fat-tree topology, the networking cost is 2-3x of a tree topology. Using VL2 is even 4-5x. However, it is not necessary to prevent oversubscription because in most of the...
[more]
Mosko et al (2005) Multipath Routing in Wireless Mesh Networks (WiMesh)
This paper proposes an algorithm for performing multipath routing in wireless mesh network. The authors argue that, in case of multipath routing, requiring different paths to be link disjoint is not as good as allowing partially shared paths from the reliability perspective.
[more]