I'm trying to get a measurement of the impact on performance of the N2N plugin ( C++-code written by Charles which maps logical file names to physical ). For the first time, I tried testing transfers which used the LFN vs transfers which use the PFN. When the N2N plugin is passed a LFN, it does a series of lookups against LFC to find the associated PFN and returns that. When N2N is passed a PFN, it recognizes the prefix (pnfs) and returns the path as is. So, this test measures the performance impact of the LFC lookups, but not that of calling N2N itself. I identified 100 files in LFC which have size 0. These were chosen so that variations in transfer time would not skew the results. I then took the first 50 and timed transfers of them using LFN, then the next 50 using PFN. Here are the results, in seconds: LFN: N=50 min=0.31 avg=0.35 max=0.51 std.dev=0.04 PFN: N=50 min=0.01 avg=0.05 max=0.08 std.dev=0.01 So, it looks like we get a fairly consistent penalty of .3 seconds per transfer. --Sarah
Please note that this site is a content mirror of the BNL US ATLAS TWiki. To edit the content of this page, click the Edit this page button at the top of the page and log in with your US ATLAS computing account name and password.