Re: asynchronous execution, was Re: implementing a set of queue-processing servers

> 
> Quite odd. I read the performance thread that's on the P5EE page which 
> showed that DBI (with MySQL underneath) was very fast, came in 2nd. 
> Anyone care to elaborate why this is? After all, shared-memory is a 
> thing in RAM, why isn't that faster?
> 

Hi Bas,

	You made some really interesting points in your last email ... and 
I hope it sparks a full discussion. 

	Just a quick point on the MySQL observation above ... MySQL
Memory-Hash Tables may be even quicker, again - as the disk is not
involved. Your messages could be inserted into a buffer table with a
microsecond timestamp and then a separate process(es) pops messages off
the queue. This hands the memory consumption problem to MySQL and provides
multiple ways of talking to the queue (cronjobs, apache kids etc).
	
	At Turbo10, our click-through system choked under heavy load until
we implemented it as a memory buffer (MySQL hash table) ... just a 
thought.


Nigel


-- 
Nigel Hamilton
Turbo10 Metasearch Engine

email:	[email protected]
tel:	+44 (0) 207 987 5460
fax:	+44 (0) 207 987 5468
________________________________________________________________________________
http://turbo10.com		Search Deeper. Browse Faster.