I've installed it on windows.
from installer version.
if u get any success with cygwin .Plz. let me know.
with a brief step guide
__
Do You Yahoo!?
Get email alerts NEW webcam video instant messaging with Yahoo! Messenger
http://im.yahoo.com
All,
I've got an issue with lock contention using nsvs.
Our site has a huge hash table of categories that is loaded once when the
server starts, and is modified rarely. It is used frequently throughout the
site. Currently we're keeping it in an nsv.
The problem is, under heavy load, we get
If there is any possibility, try breaking up you array into several
arrays. Then you can use more than one nsv bucket. Or how do tcl arrays
work? If they use a hashtable as well, then you can use a global array,
can't you?
global copy_array
array set copy_array [nsv_array get main_array]
--Tom
Sean Owen wrote:
All,
I've got an issue with lock contention using nsvs.
Our site has a huge hash table of categories that is loaded once when the
server starts, and is modified rarely. It is used frequently throughout the
site. Currently we're keeping it in an nsv.
The problem is, under
Hi guys!
I like to know if there is a way to suppress this messages?
= telnet luke 80
Trying 192.100.100.4...
Connected to luke.
Escape character is '^]'.
GET HTTP/1.0
HTTP/1.0 400 Bad Request
Content-Type: text/html; charset=iso-8859-1
MIME-Version: 1.0
Date: Tue, 11 Sep 2001 00:40:57 GMT
What echo are you talking about? If you send a
bad request, shouldn't the server tell you that
you sent a bad request?
-- Dossy
On 2001.09.10, Ariel E. Carn? [EMAIL PROTECTED] wrote:
Hi guys!
I like to know if there is a way to suppress this messages?
= telnet luke 80
Trying
+-- On Sep 10, Sean Owen said:
The problem is, under heavy load, we get into serious lock contention
problems reading from it.
Are you speculating or have you looked at the mutex statistics?
99.99% of the time we are just reading, so
ideally I'd like to use something akin to a
Okay, so one time out of ten thousand will be a write to the structure.
Is it important that:
A) if at time t, a thread determines that slot n should be modified,
must all reads from t on find the new, modified value, or would it
be okay for other threads to use the old value for some
+-- On Sep 10, Jerry Asher said:
Modifying the table becomes lengthy, you need to verify on your platform
that you can swap a pointer in an atomic operation, readers can get old
values for some period of time, but readers never have to lock the table.
Consider this:
reader is
At 07:28 PM 9/10/01, you wrote:
+-- On Sep 10, Jerry Asher said:
Modifying the table becomes lengthy, you need to verify on your platform
that you can swap a pointer in an atomic operation, readers can get old
values for some period of time, but readers never have to lock the table.
To answer the various responses I've received:
I have verified the lock contention problem by viewing mutex statistics. The
offending nsv bucket got 100 times more locks than any other, and under
heavy load was busy up to 48% of the time. Not good.
I also verified that the hashtable in question
This is true, but is atomicity really required? If you don't mind the memory
being taken up for a few extra cycles, it seems to me that if you point the
API at the new version of the hash table, you can poll the reference count
for the old version once a second until it is zero, and then safely
+-- On Sep 10, Sean Owen said:
This is true, but is atomicity really required? If you don't mind the memory
being taken up for a few extra cycles, it seems to me that if you point the
API at the new version of the hash table, you can poll the reference count
for the old version once a
13 matches
Mail list logo
