A collection of 21 posts

Sep 18, 2010

Facts about STM

These days there just can’t be enough said to counter the hype that comes with STM. The following paper is an eye opening read(it measures actual peformance of STM). Hopefully

Jul 21, 2010

π in assembly (spigot algorithm)

// pi_spigot.s - calculates Pi using a spigot algorithm // as an array of n digits in base 10000. // // // x86-64/SSE3 with for Linux, Intel, gnu assembler,

May 14, 2010

The Dangers of Computer Science Theory

Quotes from Don E. Knuth : “If we make an unbiased examination of the accomplishments made by mathematicians to the real world of computer programming, we are forced to conclude that, so far,

Jul 22, 2009

Generating π in Haskell

Haskell beats CL quite comfortably using the same algorithm : module Main( main ) where import System( getArgs ) arccot :: Integer -> Integer -> Integer arccot x unity = arccot' x unity 0 start 1 1 where

Jul 22, 2009

Generating π in CL (faster)

Thanks to metacircular for pointing out that (floor (/ x y)) can be written as (floor x y) while avoiding the intermediate rational. (defun machin-pi (digits) "Calculates PI digits using fixed point arithmetic and

Jul 21, 2009

Generating π in CL

Update 2009-07-23 : Faster version in CL and a Haskell version. ———————————————————————