Just a quick note. It became apparent to me that many of the ISWC attendees were not familiar with the term “embarrassingly parallel.” This is actually a technical term from the parallel computing community (and not, as some may have assumed, a term that I invented). An embarrassingly parallel computation is “the ‘ideal’ computation from a parallel computing standpoint–a computation that can be divided into a number of completely independent parts, each of which can be executed by a separate processor” [1]. So, the main take-away from my presentation is that the RDFS rules can be applied to an abox partitioning (as defined in my paper) in an embarrassingly parallel fashion (i.e., independently on each partition) to produce the RDFS closure.

Also, as soon as springerlink makes their version of my paper available, I will (be legally allowed–per the copyright agreement–to) publicly post a copy of the camera-ready version at my website, .

[1] Wilkinson, B., Allen, M.: 3. In: Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers. 2 edn. Prentice Hall (2005)