On Mon, Apr 1, 2013 at 5:56 PM, Edward Z. Yang ezy...@mit.edu wrote:
http://ezyang.com/papers/ezyang13-rlimits.pdf
Correct me if I'm wrong, but reading that I don't seem to see any tests
against actual adversarial code - just checking that the limits kick in on
a bunch of ordinary code.
I now have a paper draft describing the system in more detail. It also
comes with a brief explanation of how GHC's profiling works, which should
also be helpful for people who haven't read the original profiling
paper.
http://ezyang.com/papers/ezyang13-rlimits.pdf
Edward
Excerpts from
Hey folks,
Have you ever wanted to implement this function in Haskell?
-- | Forks a thread, but kills it if it has more than 'limit'
-- bytes resident on the heap.
forkIOWithSpaceLimit :: IO () - {- limit -} Int - IO ThreadId
Well, now you can! I have a proposal and set of patches
On Fri, Mar 15, 2013 at 5:17 PM, Edward Z. Yang ezy...@mit.edu wrote:
There is a lot of subtlety in this space, largely derived from the
complexity of interpreting GHC's current profiling information. Your
questions, comments and suggestions are greatly appreciated!
How secure is this? One of
The particular problem you're referring to is fixed if you compile all
your libraries with -falways-yield; see
http://hackage.haskell.org/trac/ghc/ticket/367
I believe that it is possible to give a guarantee that the kill
signal will hit the thread in a timely fashion. The obvious gap in
our
