Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re^2: How would you implement a FIFO non-blocking queue?

by BMaximus (Chaplain)
on Feb 27, 2006 at 09:05 UTC ( [id://532980]=note: print w/replies, xml ) Need Help??


in reply to Re: How would you implement a FIFO non-blocking queue?
in thread How would you implement a FIFO non-blocking queue?

Both are great questions.

Why don't you just buy a faster/bigger server?


I have no control over the hardware what so ever. So it's not up to me to get a new server.

Why don't you try some in-memory caching with your webserver?


Good idea but not practical as the PDF is created on the fly depending upon the search done by the user. Also we don't want the information cached anywhere for security purposes.

Good ideas though.

BMaximus
  • Comment on Re^2: How would you implement a FIFO non-blocking queue?

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://532980]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others examining the Monastery: (6)
As of 2024-04-19 15:20 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found