You are viewing paulmck

Previous Entry | Next Entry

Parallel Programming: January 2013 Update

  • Jan. 13th, 2013 at 6:23 PM
SequentialCaveman
This release of Is Parallel Programming Hard, And, If So, What Can You Do About It? features the (very skeletal) beginnings of the data-structures chapter, twelve new cartoons, and general updates to the first seven chapters. It also includes contributions from Kornilios Kourtis, Namhyung Kim, Ricardo Fabbri and his class, and Yuchen Dai.

As always, git://git.kernel.org/pub/scm/linux/kernel/git/paulmck/perfbook.git will be updated in real time.

Tags:

Comments

( Read 6 comments — Leave a comment )
tcpip
Jan. 16th, 2013 11:44 pm (UTC)
Programming is hard, parallel programming is very hard, and I don't even want to think about what working with qbits is going to be like...
| Reply | Thread
paulmck
Jan. 17th, 2013 12:46 am (UTC)
For a really complex system...
... imagine all the fun you could have with a system consisting of an uncountably infinite number of qbits running an algorithm with aleph-double-prime computational complexity! ;-)
| Reply | Parent | Thread
tcpip
Jan. 17th, 2013 10:06 pm (UTC)
Re: For a really complex system...
At the very least it would make for a secure passphrase.. and certainly contribute a great deal to making others redundant!
| Reply | Parent | Thread
paulmck
Jan. 18th, 2013 06:24 pm (UTC)
Re: For a really complex system...
:-)

Can't say as I know which would crack first, the passphrases or the minds of the people attempting to program it!
| Reply | Parent | Thread
( Read 6 comments — Leave a comment )