26–28 Mar 2007
Europe/Zurich timezone

Recent Improvements in the ROOT Tree cache.

26 Mar 2007, 16:30
30m
Council Chamber

Council Chamber

Speaker

Leandro Franco (CERN/SFT)

Description

Interactive analysis of remote data is always limited by the quality of the network, where the main parameters are bandwidth and latency. The former is not usually a problem but the latter will always be proportional to the distance between the client and server. The only way to deal with this issue is by minimizing the number of transactions between both sites, which is usually done by predicting future requests and transferring them as whole. We will show how we implemented this technique in the new ROOT's cache and how well it works in different conditions. Another big improvement for the cache is the ability to unzip its content in parallel (by using an additional core). This is a direct consequence of the new cache since we need to predict the data that is going to be transfered and unzipped. In the talk, we will give an estimate of the gain we obtain with such algorithm.

Presentation materials