@patio11 Nobody asked if you’d tried rubyprof and kcachegrind? Disappointing. Or do you already know which bits are holding it up?
-
-
-
@grahamashton Suffice it to say the level 0 problem was the FizzBuzz of optimization and profiling was very not necessary to solve. - 1 more reply
New conversation -
-
-
@patio11 Run profiler, fix any obvious O(n) problems, limit n if possible, check http://dl.acm.org for optimizations. THEN parallelize. -
@patio11 I may have spent a few years e.g. working with older devs to throw 100 boxen at 10 year old algorithm-heavy C code.
End of conversation
New conversation -
-
-
@patio11 and so far in stripe CTF, answer has been "just keep the existing code and make the slowest part a little less stupid"Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@patio11 And then younger devs go out of business, see Everpix.Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
.
@patio11 True. It would be interesting to graph dev time cost versus box time cost for given performance. NB recurring vs one-time aspectThanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
This Tweet is unavailable.
-
-
@patio11 I think you give younger devs too much credit.Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.