Skip to Content.
Sympa Menu

perfsonar-dev - Re: [pS-dev] performance tests for lookup service

Subject: perfsonar development work

List archive

Re: [pS-dev] performance tests for lookup service


Chronological Thread 
  • From: Nina Jeliazkova <>
  • To: Slawomir Trzaszczka <>
  • Cc: Antoine Delvaux <>, "" <>, Maciej Glowiak <>
  • Subject: Re: [pS-dev] performance tests for lookup service
  • Date: Mon, 30 Nov 2009 08:36:02 +0200

Hi,

Slawomir Trzaszczka wrote:
On Fri, 2009-11-27 at 11:06 +0200, Nina Jeliazkova wrote:
  
Slawomir,  All,

Very interesting comparison. 

It would be also useful to test sending requests ( queries at least)
in parallel, if possible, since I imagine the normal  usage pattern is
handling several requests at once.

    

Parallel or in some sequence (one thread) ? Parallel tests are hard to
interpret (threading, concurrency access) and main problem with
repeatable.

  
I am just curious whether it is possible to mimic a real use case , of course it can be hard to measure.

Best regards,
Nina
Regards,

Slawek



  
Best regards,
Nina

Slawomir Trzaszczka wrote: 
    
On Thu, 2009-11-26 at 16:12 +0000, Antoine Delvaux wrote:
  
      
Hi Slawek,

Indeed, interesting work and results.  We can say that pSbase2 is about 2 times more efficient than pSbase1, so we're already hoping for pSbase10 ;-)

I guess you performed those tests in a serial fashion: doing all registrations, than all queries, then all deregistrations.  Would doing it in a more random fashion (registrations, queries and deregistrations not happening all together), more similar to real world usage, change the result pattern?

    
        
No,

In registration I registered 150 x 100 or 150 x 500 or 100 x 1000
services.
Next steps (querying/deregistrations) based on first step (database
contains data from registration step). 
Next I done query/deregistration on some selected elements. List of this
elements was constant but after every test. database was dropped. 

I can perform some "chain of operation" (registration, query,
deregistration) with  control parameters and test it. For example
(R-Registering,Q-querying,D-deregistering)

--------------------------------
loop N-iteration:
	begin
		R
		R
		Q
		R
		Q
		D
	end

finally:
    D for all registered
--------------------------------

Regards,

Slawek


  
      
You say the bottleneck is eXistDB, would it be possible to make a prototype using some other DB engine like Postgresql to see if there could be any other performance gain.  Or does our code uses advanced XML functions only provided by eXistDB?

Beste regards,
--
Antoine Delvaux                                    Systems Engineer
DANTE                                                 Skype: toninb
http://www.dante.net                            Tel: +221.778197275
PGP fingerprint: DC65 0D8B 6938 9229 33C3  18CA 4EB6 09D3 A333 3378




    
        




Archive powered by MHonArc 2.6.16.

Top of Page