Log in

No account? Create an account
July 28th, 2007 - Adventures in Engineering — LiveJournal
The wanderings of a modern ronin.

Ben Cantrick
  Date: 2007-07-28 14:54
  Subject:   Your electronic voting machines are massively insecure.
  Mood:so very not worth saving
  Music:Chaotic Discord - Destroy Peace And Freedom (from Fuck The Lot Of You)

State-sanctioned teams of computer hackers were able to break through the security of virtually every model of California's voting machines and change results or take control of some of the systems' electronic functions, according to a University of California study released Friday.

The researchers "were able to bypass physical and software security in every machine they tested," said Secretary of State Debra Bowen, who authorized the "top to bottom review" of every voting system certified by the state.


You mean to say that a computerized voting system where a chimpanzee can delete the audit records is not secure enough? Well, that's just crazy talk! You must be some unhinged, psychotic, paranoid whack-job to think that!

Why don't you just go the fuck back to sleep, America...
Post A Comment | | Link

Ben Cantrick
  Date: 2007-07-28 15:53
  Subject:   Garbage collection is the new compiler.
  Music:"Technology always gets better, never worse." -B Schneier
  Tags:  programming, reddit

Now that the use of garbage collection in languages like Java is becoming widely accepted due to the safety and software engineering benefits it provides, there is significant interest in applying garbage collection to hard real-time systems. Past approaches have generally suffered from one of two major flaws: either they were not provably real-time, or they imposed large space overheads to meet the real-time bounds.

We present a mostly non-moving, dynamically defragmenting collector that overcomes both of these limitations: by avoiding copying in most cases, space requirements are kept low; and by fully incrementalizing the collector we are able to meet real-time bounds. We implemented our algorithm in the Jikes RVM and show that at real-time resolution we are able to obtain mutator utilization rates of 45% with only 1.6–2.5 times the actual space required by the application, a factor of 4 improvement in utilization over the best previously published results. Defragmentation causes no more than 4% of the traced data to be copied.


Remember when everyone said that compilers would never be fast enough compared to hand-optimized code? And now these days, they often create code that's faster?

I wonder what's going to happen with GC?
2 Comments | Post A Comment | | Link

May 2015