Already a member? Log in

Sign up with your...

or

Sign Up with your email address

Add Tags

Duplicate Tags

Rename Tags

Share This URL With Others!

Save Link

Sign in

Sign Up with your email address

Sign up

By clicking the button, you agree to the Terms & Conditions.

Forgot Password?

Please enter your username below and press the send button.
A password reset link will be sent to you.

If you are unable to access the email address originally associated with your Delicious account, we recommend creating a new account.

Links 1 through 10 of 10 by Ken Robson tagged locking

In this column over the years, I have spent a considerable amount of time talking about contention and locking in the database tier. At the end of the day, the endless conversations about scaling the application tier boil down to less than a bag of beans

Share It With Others!

We describe our experiences with the Chubby lock service, which is intended to provide coarse-grained locking as well as reliable (though low-volume) storage for a loosely-coupled distributed system. Chubby provides an interface much like a distributed fi

Share It With Others!

Jeff Friesen's four-part thread series continues with an investigation of thread scheduling, the wait/notify mechanism, and thread interruption. In Part 3, Friesen explains how priority relates to thread scheduling. You discover how to use the wait/notify

Share It With Others!

Andrew Tridgell wandered over to our stand at LinuxWorld on Tuesday to ask about DTrace and look at some problems that he was having. We uploaded the source to one of his performance tests, built it and started to have a look. The test in question is lock

Share It With Others!

The following DTrace script really helped me nailing down some lock contention issue, that I was looking into, at work. This simple script records all the call stacks, upto 60 frames, whenever a call has been made to lwp_*() API, explicitly or implicitly.

Share It With Others!

A slide deck comparing p2p with DSM nad using the two concepts to introduce a third way coined as, a data sharing serivce.

Share It With Others!

In most real-time systems, concurrency and access to shared resources are controlled by locking. A serious disadvantage is that locking may give rise to priority inversion, i.e. situations in which a high-priority task has to wait for a low-priority task

Share It With Others!

Application performance involves more than just speed. In a Web server environment, top performance also means ensuring that the maximum numbers of users can be served concurrently. This can be accomplished through efficient use of multiprocessor machines

Share It With Others!

The purpose of this document is to explain how CAT can be used to analyze deadlock-related system crash dumps.

Share It With Others!

Share It With Others!