∫ntegrabℓε ∂iﬀerentiαℓs · unorganised notes, code, and writings of random topics

Abu-Libdeh et al (2010) Symbiotic Routing in Future Data Centers (SIGCOMM)

July 17, 2010 paper

A paper from Microsoft Research UK. The focus is on a topology named CamCube, which is a 3D torus with no switch node. All nodes in the topology is connected to 6 other nodes to form a 3D lattice. Nodes are addressed by a 3D coordinate, \((x,y,z)\). Routing is done... [more]

Kamp (2010) You're doing it wrong (CACM)

July 17, 2010 paper

This is written by a FreeBSD kernel developer. It discussed the effect of OS-level caching to algorithm performance. The story is that, one has to do store/retrieve operation on a heap. If the heap is made of a balanced binary tree, usually it is implemented as an array such that... [more]

Clévenot et al (2005) Stochastic fluid models for cache clusters (PE)

June 25, 2010 paper

This paper models the hit rate of a cluster of cache servers. [more]

Abu-Libdeh et al (2010) RACS: A Case for Cloud Storage Diversity (SoCC)

June 22, 2010 paper

This paper proposed to use multiple cloud services for storage in a RAID-like style, so that the user can prevent vendor lock-in, and provide a higher redundancy. Software is created and published. Performance evaluation is presented. [more]

Costa et al (2009) Why Should We Integrate Services, Servers, and Networking in a Data Center? (WREN)

June 22, 2010 paper

This paper challenges the idea of using, say, fat-tree in DCN because in a DCN, network bisection bandwidth and low diameter are just part of the criteria. We still have to consider resilience to failure, wiring complexity, and energy consumption. [more]