Article View: borland.public.cppbuilder.database.multi-tier
Article #1306Re: Practical Limits
From: Mark Cashman (TeamB)
Date: Tue, 01 Feb 2000 00:00
Date: Tue, 01 Feb 2000 00:00
20 lines
1331 bytes
1331 bytes
Hi, Tom! Practicality can't be assessed in the abstract. Generally, if you know the task switching overhead, the typical and spike request processing time, you can simulate when saturation of the processor will cause queuing, and how long the delays will be. Ideally you need to model all this based on some estimation of the size of each request and the inter request arrival times and so forth. A variety of queuing theory models could be applicable. Alternatively, hammer the server with automated tools generating requests and watch when it actually saturates. ------ Mark Cashman, TeamB C++ Builder http://www.temporaldoorway.com/programming/index.htm C++ Builder, JBuilder programming information Home of The C++ Builder Programmer's Webring - Join us! ------
Technical Details
Message-ID:
<38976615.76F96930@snet.net>Path:
arc1-ca.pugleaf.net!unknown!not-for-mailReferences:
<876p46$3jg6@bornews.borland.com>Show Full Headers
Complete Article Headers
X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: fcd2b,1d9c977eb8a34eab X-Google-Attributes: gidfcd2b,public From: "Mark Cashman (TeamB)" <markcashman@snet.net> Subject: Re: Practical Limits Date: 2000/02/01 Message-ID: <38976615.76F96930@snet.net> X-Deja-AN: 580563334 Content-Transfer-Encoding: 7bit References: <876p46$3jg6@bornews.borland.com> X-Accept-Language: en Content-Type: text/plain; charset=us-ascii Organization: VTechnologies Mime-Version: 1.0 Newsgroups: borland.public.cppbuilder.database.multi-tier