Intel co-founder Gordon Moore famously wrote about how the number of transistors on silicon chips would double roughly every two years—an observation now known as Moore’s Law. But even as Intel pushes ...

The authors of my Editor’s Top Picks for this week – Atego’s Kelvin Nilsen and Adacore’s S. Tucker Taft – believe that despite all the tools that allow embedded systems developers to maintain ...

Programming general purpose multi-core processors is generally regarded as impossible, but XMOS Semiconductor has done it and is applying it in practical applications, according to the CTO of XMOS, ...

Programming languages are evolving to bring the software closer to hardware. As hardware architectures become more parallel (with the advent of multicore processors and FPGAs, for example), sequential ...

Writing correct concurrent programs is harder than writing sequential ones. This is because the set of potential risks and failure modes is larger - anything that can go wrong in a sequential program ...

The 14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2009) and the 15th International Symposium on High-Performance Computer Architecture (HPCA-15) opened Monday in ...

After introducing interrupts and the foreground/background architecture, I am finally ready to tackle the concept of a Real-Time Operating System (RTOS). In this first lesson on RTOS (commonly ...

Using an illustration drawn from the area of inventory control, this paper demonstrates how a typical sequential probabilistic model may be formulated in terms of (a) an initial decision rule and (b) ...

An iteration of the sequential quadratically constrained quadratic programming method (SQCQP) consists of minimizing a quadratic approximation of the objective function subject to quadratic ...

Dr. Guy Blelloch of Carnegie Mellon University has written an article for the folks at CilkArts analyzing why parallel programming seems to be more difficult than sequential programming. He quickly ...