John Regehr
945 followers
945 followers
Posts
Post has shared content
Post has shared content
Post has shared content
Nice! SLC continues to approach being a real city!
Originally shared by ****
A few weeks ago, I learned that there's a bike path to the Salt Lake Airport, which is about 9 miles from my house.

This week, I had a short plane trip, so I decided to try out getting there by bike.

It worked very well!

Most of the route is pretty good, and there's some decent bike parking at the airport (tons of racks, covered, in an area with security cameras). The time from my house is a bit faster than taking public transit. It took a bit more planning than usual, because I had to worry about things like not taking bike tools that wouldn't be allowed on the plane, etc. I packed entirely in my pannier / messenger bag so that I didn't end up with a sweaty backpack.

It was pretty great, on the way back, to get in some physical exercise after sitting on a plane for hours.

I'm not going to do this every time I fly, but I will definitely do it again.
Biking to the airport
17 Photos - View album
Post has shared content
Originally shared by ****
Would you like to see what happens when modernist gourmet experts get hella high?

http://www.chefsteps.com/activities/behind-the-scenes-waffle-iron-frenzy
Post has shared content
I have a program that implements a search using unix fork(). The search tree is maybe 30-40 forks deep. Without throttling, it's just a forkbomb that kills the host machine, so I'm in search of a good way to throttle it.

One way is, following each fork, for the parent to wait() for the child. This works fine and gives the invariant that there's almost always exactly one runnable process.

But what I want is the invariant that there are always N runnable processes, where N is the number of cores I have. For reasons I don't entirely understand, I'm having trouble getting this to work. Obvious tricks with a semaphore initialized to N don't work.

Anyone know the solution I'm looking for here?  Thanks!
Post has attachment
Nothing is better than these recipes created by a recurrent neural network.
Post has shared content
I learned most of what I know about static analysis from these notes. They're refreshingly direct and clear (unfortunately much of the other material on this topic isn't).
Our lecture notes on static program analysis are now online - with implementation and exercises.