On Monday, 3 June 2013 at 12:14:48 UTC, Andrei Alexandrescu wrote:
On reddit:
http://www.reddit.com/r/programming/comments/1fkr5s/dconf_2013_day_2_talk_4_web_development_in_d_by/
On hackernews:
https://news.ycombinator.com/item?id=5812723
On facebook:
https://www.facebook.com/dlang.org/posts/650767074936977
On twitter:
https://twitter.com/D_Programming/status/341527862815367168
Andrei
Great talk! Would love to see the improvements to phobos
suggested.
An idea for the virtual address space problem on 32-bit:
- Assuming each stack has a marker page at the end to prevent
overflow, by simply exchanging the stack memory with a separate
block of memory you can reduce the number of marker pages saving
up to one page per fiber
- Could use some fast compression method to save a not recently
used stack in memory
- As a last resort can save stack to a file and read it in again
when it is required. Since events are queued the event loop can
easily peek ahead in the queue and start loading in a stack early
so that it is ready by the time that event gets to the front.
