<?xml version="1.0" encoding="utf-8"?><!-- generator="wordpress/2.3.1" -->
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	>
<channel>
	<title>Comments on: AIO through stack scheduling</title>
	<link>http://www.zabbo.net/post/aio-through-stack-scheduling/</link>
	<description>software princess</description>
	<pubDate>Mon, 08 Sep 2008 12:30:41 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.3.1</generator>
		<item>
		<title>By: zab</title>
		<link>http://www.zabbo.net/post/aio-through-stack-scheduling/#comment-14141</link>
		<dc:creator>zab</dc:creator>
		<pubDate>Tue, 12 Dec 2006 19:59:46 +0000</pubDate>
		<guid>http://www.zabbo.net/post/aio-through-stack-scheduling/#comment-14141</guid>
		<description>&gt; given how small is the path, it’s amazing.

Well, it's just a prototype :). It is missing significant pieces.

&gt; 1) stack overflow (just 4K !!!)

The current strategy copies the portion of the stack that a path is using into a buffer that is allocated at the time of the switch.  It actually reduces stack consumption because data that is used by the waking path can't be on the sleeping stack.  (That's a significant cost of the current approach.)

&gt; 2) having a stack per request

Well, the part of the stack that's used when the path goes to sleep.  I didn't notice what the dio read case was, but trivial stuff seems to be using hundreds of bytes.  That can surely be trimmed down a bit -- the current stack switching function is absurdly conservative about saving registers.</description>
		<content:encoded><![CDATA[<p>> given how small is the path, it’s amazing.</p>
<p>Well, it&#8217;s just a prototype :). It is missing significant pieces.</p>
<p>> 1) stack overflow (just 4K !!!)</p>
<p>The current strategy copies the portion of the stack that a path is using into a buffer that is allocated at the time of the switch.  It actually reduces stack consumption because data that is used by the waking path can&#8217;t be on the sleeping stack.  (That&#8217;s a significant cost of the current approach.)</p>
<p>> 2) having a stack per request</p>
<p>Well, the part of the stack that&#8217;s used when the path goes to sleep.  I didn&#8217;t notice what the dio read case was, but trivial stuff seems to be using hundreds of bytes.  That can surely be trimmed down a bit &#8212; the current stack switching function is absurdly conservative about saving registers.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: bzzz</title>
		<link>http://www.zabbo.net/post/aio-through-stack-scheduling/#comment-14140</link>
		<dc:creator>bzzz</dc:creator>
		<pubDate>Tue, 12 Dec 2006 19:53:18 +0000</pubDate>
		<guid>http://www.zabbo.net/post/aio-through-stack-scheduling/#comment-14140</guid>
		<description>given how small is the path, it's amazing. 

my understanding is that "stack" in this context is a kernel task, literally. and it may result in:
1) stack overflow (just 4K !!!)
2) having a stack per request</description>
		<content:encoded><![CDATA[<p>given how small is the path, it&#8217;s amazing. </p>
<p>my understanding is that &#8220;stack&#8221; in this context is a kernel task, literally. and it may result in:<br />
1) stack overflow (just 4K !!!)<br />
2) having a stack per request</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: graydon</title>
		<link>http://www.zabbo.net/post/aio-through-stack-scheduling/#comment-14045</link>
		<dc:creator>graydon</dc:creator>
		<pubDate>Sat, 09 Dec 2006 01:37:12 +0000</pubDate>
		<guid>http://www.zabbo.net/post/aio-through-stack-scheduling/#comment-14045</guid>
		<description>Very slick, nice work.</description>
		<content:encoded><![CDATA[<p>Very slick, nice work.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
