PCPlus 262: Best Data Use

I write a monthly column for PCPlus, a computer news-views-n-reviews magazine in the UK (actually there are 13 issues a year — there's an Xmas issue as well — so it's a bit more than monthly). The column is called Theory Workshop and appears in the back of every issue. When I signed up, my editor and the magazine were gracious enough to allow me to reprint the articles here after say a year or so. After all, the PDFs do appear on each issue's DVD after a couple of months.

(Before you ask: no article of mine appeared in PCPlus 261. There was some kind of delay on my side — probably our annual vacation to England — and I didn't complete this article in time for that issue, despite the simplicity of the topic. So, it got pushed over to issue 262.)

OK, wacky article title, not mine, for what is essentially an article on writing an efficient stack and queue. This discussion came about from writing a lock-free stack and lock-free queue: these particular structures are the best way of implementing a stack and queue if you want to make them lock-free.

But, really, when all's said and done, very much a beginner's article aimed at the hobby programmer.

This article first appeared in issue 262, December 2007.

You can download the PDF here.

  Loading links to posts on similar topics...