Lock-free programming

June 8, 2008 at 9:50 pm Leave a comment

Lock-free interprocess communication introduced 4 algorithms which can increase interprocess communication efficient on SMP machines. In fact, A1,2,3 are just light-weight lock implementations, which reduced the overhead of system calls. Since they use busy loop for waiting, they also avoided most of the process switches when they failed to get the lock. A4 is a varied lock-free implementation, which requires readers keep a copy and check consistency. Since writers work on the main copy directly, this avoid the using of a GC. I believe before the lock-free technology get mature, this is the right approach that this technology can benefit us. For example, we can use A4 on optimizing JACKD’s client list. The test results on this paper shows that SMP brings more chance lock intensive process to get congestion. As a result, those process can performs even worse on SMP then on single processor machines.

Advertisements

Entry filed under: quick notes.

Object in Javascript, a C++ programmer’s point of view

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Trackback this post  |  Subscribe to the comments via RSS Feed


Calendar

June 2008
M T W T F S S
    Mar »
 1
2345678
9101112131415
16171819202122
23242526272829
30  

Most Recent Posts


%d bloggers like this: