LISTSERV mailing list manager LISTSERV 16.5

Help for XROOTD-L Archives


XROOTD-L Archives

XROOTD-L Archives


XROOTD-L@LISTSERV.SLAC.STANFORD.EDU


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

XROOTD-L Home

XROOTD-L Home

XROOTD-L  July 2005

XROOTD-L July 2005

Subject:

Re: xrootd seminat talk at GSI (Darmstadt)

From:

Bill Weeks <[log in to unmask]>

Reply-To:

Bill Weeks <[log in to unmask]>

Date:

18 Jul 2005 10:23:58 -0700 (PDT)Mon, 18 Jul 2005 10:23:58 -0700 (PDT)

Content-Type:

MULTIPART/mixed

Parts/Attachments:

Parts/Attachments

TEXT/plain (111 lines) , results.open (40 lines)

Hi,
Slide 19 in the presentation is addressing open/redirection performance.
The numbers should be in microseconds, not milliseconds. Some of the numbers
are wrong, maybe typos. The slide is vague regarding which combination of
client-server platforms was used. I've attached a file that summarizes the
results of my testing. It looks like the numbers came from these tests.
--Bill Weeks, SLAC, (650) 926-2909


>X-Authentication-Warning: pcuw01.cern.ch: elmer set sender to 
[log in to unmask] using -f
>Date: Sun, 17 Jul 2005 20:18:29 +0200
>From: Peter Elmer <[log in to unmask]>
>To: Andreas Petzold <[log in to unmask]>
>Cc: [log in to unmask], [log in to unmask]
>Subject: Re: xrootd seminat talk at GSI (Darmstadt)
>Mime-Version: 1.0
>Content-Disposition: inline
>User-Agent: Mutt/1.4.1i
>X-PMX-Version: 4.7.1.128075, Antispam-Engine: 2.0.3.2, Antispam-Data: 
2005.7.17.20
>
>  Hi Andreas,
>
>On Sun, Jul 17, 2005 at 07:50:10PM +0200, Andreas Petzold wrote:
>> thanks for the comments.
>> 
>> One more question (I've already emailed Andy, but he may be on the 
>> road): on the slide that shows the numbers of the timing comparison 
>> direct disk access, xrootd,  xrootd w/ redirection I'm not sure about 
>> the units. In Andy's talk, he uses [us] but does it mean 10^-6s which 
>> would be really fast, or does it mean 10^-3s?
>
>  I had understood it to be 10^-6s, but Andy or Bill should confirm this.
>
>  Those numbers do have a tendency to confuse people, however. Andy or Bill
>Weeks can explain better what they were trying to do, but I understood it to 
>be (roughly) an attempt to isolate and measure all pieces of the process of 
>redirecting and opening files in order to insure that each piece within
>the xrootd daemon itself was scalable and performant. This means (again, I 
>think) that they were probably measuring this with memory mapped files, which 
>removes the latencies for finding/opening something on the disk system itself 
>from their measurement. This _does_ demonstrate that the overhead from the
>xrootd daemon itself is minimal, but doesn't of course give one the true
>number you would see opening a file from disk. A couple of people reacted
>as if a fast one was being pulled on them. ;-) The numbers should be more 
>clearly labeled to indicate this. In practice the disk part will presumably
>vary depending on what hardware one has and how many things are hitting it.
>All of this is of course somewhat independent from the data server itself.
>
>  [Recall also that they were doing this in the context of measurements
>for the "Big Memory Machine", so in that case there is no disk subsystem
>part, but clearly for most people that has to be added on top.]
>
>  Andy and Bill, is this correct?
>
>                                   Pete
>
>
>> Peter Elmer wrote:
>> >  Hi Andreas,
>> >
>> >On Sun, Jul 17, 2005 at 01:23:11PM +0200, Andreas Petzold wrote:
>> >
>> >>I gonna give a talk on xrootd at Darmstadt next week. I've put my slides 
>> >>on the web:
>> >>
>> >>http://iktp.tu-dresden.de/~petzold/work/xrootd.pdf
>> >>http://iktp.tu-dresden.de/~petzold/work/xrootd.sxi
>> >>
>> >>If you've any comments or suggestions please let me know.
>> >
>> >
>> >  It looks very nice. I see only a couple of small things (see below). 
>> >  When you have the final version let me know and I can add it to the 
>> >presentations
>> >section of the xrootd webpage.
>> >
>> >                                 thanks,
>> >                                   Pete
>> >
>> >   slide 9 - the protocol should be "root" instead of "xrootd" (the clients
>> >             even enforce this, although strictly speaking they probably 
>> >             don't need to do that) 
>> >
>> >   slide 23 - The BaBar Padova Tier-A also uses xrootd, plus there is some
>> >              set of university sites using it (e.g. for serving background
>> >              events for MC production)
>> >
>> >              Objectiviy -> Objectivity (technically this is the AMS, of 
>> >              course)
>> >
>> >              One of the other things that the system has been able to 
>> >              achieve is that the basic system (even a load balanced 
>> >              system)
>> >              is fairly easy to setup.
>> >
>> >   slide 24 - I just realized Derek Feichtinger wasn't on the list. He has
>> >              been contributing code, so I've added him... I'd call the
>> >              list "core collaborators".
>> >
>> >              Also, Priceton -> Princeton ;-)
>
>
>
>-------------------------------------------------------------------------
>Peter Elmer     E-mail: [log in to unmask]      Phone: +41 (22) 767-4644
>Address: CERN Division PPE, Bat. 32 2C-14, CH-1211 Geneva 23, Switzerland
>-------------------------------------------------------------------------



Test Program - xrdopen This is a C program the uses the xroot API to communicate with an xrootd or olbd server. The inner loop of this program consists of open(), close(), open(), close(), read(). The first open incurs the cost of connecting to the server, but the connection is retained for the second open. The read() is a one byte read. Before and after each open() and read(), the gettimeofday() system function is used to measure the latency of the open() and read() functions. The gettimeofday() function appears to have a granularity of 1 microsecond. The program returns the latency for the first open(), second open(), and read() in microseconds. Outer script - runxrdopen The outer script invokes the test program 10,000 times, sorts the values for the first open(), second open(), and read(), and then calculates the average and median values. To avoid unwanted skewing of the average values, the highest 1% of the sorted values are discarded. Test results The test program was run against the local filesystem on the xrootd server to measure the operating system cost of opening a file. Then all combinations of Solaris and Linux clients and xrootd servers were tested. Finally, the a Solaris olbd was tested with both clients. All numbers in the following table are in microseconds.                                       1st Open 2nd Open Read                                      Avg Median Avg Median Avg Median Linux local filesystem 13 13 3 3 4 5 Solaris local filesystem 43 42 4 5 18 17 Solaris client -> Linux xrootd 4312 4241 884 862 122 122 Solaris client -> Solaris xrootd 4402 4315 917 895 133 133 Linux client -> Linux xrootd 7568 7544 5378 5329 108 108 Linux client -> Solaris xrootd 7685 7638 5429 5376 118 118 Solaris client -> Solaris olbd 5570 5424 1235 1206 133 132 Linux client -> Solaris olbd 11011 10916 8046 7969 117 117

Top of Message | Previous Page | Permalink

Advanced Options


Options

Log In

Log In

Get Password

Get Password


Search Archives

Search Archives


Subscribe or Unsubscribe

Subscribe or Unsubscribe


Archives

April 2024
March 2024
February 2024
January 2024
December 2023
November 2023
October 2023
September 2023
August 2023
July 2023
June 2023
May 2023
April 2023
March 2023
February 2023
January 2023
December 2022
October 2022
September 2022
August 2022
July 2022
June 2022
May 2022
April 2022
March 2022
February 2022
January 2022
December 2021
November 2021
October 2021
September 2021
August 2021
July 2021
June 2021
May 2021
April 2021
March 2021
February 2021
January 2021
December 2020
November 2020
October 2020
September 2020
August 2020
July 2020
June 2020
May 2020
April 2020
March 2020
February 2020
January 2020
December 2019
November 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
July 2009
June 2009
May 2009
April 2009
March 2009
January 2009
December 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
December 2006
November 2006
October 2006
September 2006
August 2006
July 2006
June 2006
May 2006
April 2006
March 2006
February 2006
January 2006
December 2005
November 2005
October 2005
September 2005
August 2005
July 2005
June 2005
May 2005
April 2005
March 2005
February 2005
January 2005
December 2004
November 2004
October 2004
September 2004
August 2004

ATOM RSS1 RSS2



LISTSERV.SLAC.STANFORD.EDU

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager

Privacy Notice, Security Notice and Terms of Use