∫ntegrabℓε ∂ifferentiαℓs
  • Collections
    Papers Books Tagged posts
  • About

∫ntegrabℓε ∂ifferentiαℓs


unorganised notes, code, and writings of random topics

Kowarschik and Weiss (2003) An Overview of Cache Optimization Techniques and Cache-Aware Numerical Algorithms (LNCS 2625)

October 1, 2010 paper

Data access techniques to optimize code in modern processor: [more]

Lam et al (1991) The Cache Performance and Optimization of Blocked Algorithms (ASPLOS)

September 29, 2010 paper

Blocking/Tiling is a well-known way to make program faster by leveraging the properties of memory hierarchy. [more]

Gude et al (2008) NOX: Towards an Operating System for Networks (CCR)

September 29, 2010 paper

NOX, Network Operating System, is proposing an “OS” layer on top of network hardware. Similar to OS in a computer, it abstracts the network functions into API and user can write “applications” on top of those API to control the network. The idea is to make network management easier by... [more]

Greenberg et al (2005) A Clean Slate 4D Approach to Network Control and Management (CCR)

September 29, 2010 paper

This paper sets the research agenda for 4D project — Decision, Dissemination, Discovery, and Data. [more]

Zaharia et al (2010) Spark: Cluster Computing with Working Sets (HotCloud)

September 21, 2010 paper

This paper proposed a new programming model extended from MapReduce. The key feature is the resilient distributed dataset (RDD). RDD is an object in the cluster that can be cached. By having a cache, the author claims a 10x speedup in some use cases (e.g. Logistic Regression) compared to MapReduce,... [more]
‹
›

Adrian S. Tam  •  © 2025  •  CC-BY-SA 4.0 •  http://www.adrian.idv.hk

On a heavily modified beautiful-jekyll theme.