Pure Julia HINT benchmark

Back in the day John Gustafson and friends invented a really great benchmark called HINT (Hierarchical INTegration).

It measures quality improvements per second (quips) as a function of memory used… So produces a curve of quips vs size.


Originally this was hosted at iastate.edu anyway the C code is available.


It’s really not a complicated program and I think would be pretty easy for someone to write a pure Julia version of. I know you code golfers and benchmark people are just itching to make stuff run fast. Perhaps someone wants to do this rewrite? It truly was a great benchmark design.

Note: multi threaded and clustered versions also worthwhile to think about!

Note, the wiki article also links to the original paper which is worth reading

1 Like