<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	>
<channel>
	<title>Comments on: Shared Memory In Linux</title>
	<atom:link href="http://www.codemaestro.com/reviews/11/feed" rel="self" type="application/rss+xml" />
	<link>http://www.codemaestro.com/reviews/11</link>
	<description>The Coding Experience</description>
	<pubDate>Tue, 07 Sep 2010 22:27:15 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.5.1</generator>
		<item>
		<title>By: Neil</title>
		<link>http://www.codemaestro.com/reviews/11#comment-23288</link>
		<dc:creator>Neil</dc:creator>
		<pubDate>Mon, 15 Dec 2008 11:18:28 +0000</pubDate>
		<guid isPermaLink="false">http://beta.codemaestro.com/?p=11#comment-23288</guid>
		<description>Hi!
Dave , I am trying to implement linked list in shared memory , however I am facing problem. If I have a prev and next pointer , what shall it contain the offset from start of the shared memory address ?? this is okay only if my nodes are not same in size , otherwise having next and prev pointers are redundant as incrementing and decrementing by node size can get me the previous and next node. Any help in this regard will be useful. TX</description>
		<content:encoded><![CDATA[<p>Hi!<br />
Dave , I am trying to implement linked list in shared memory , however I am facing problem. If I have a prev and next pointer , what shall it contain the offset from start of the shared memory address ?? this is okay only if my nodes are not same in size , otherwise having next and prev pointers are redundant as incrementing and decrementing by node size can get me the previous and next node. Any help in this regard will be useful. TX</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: dave</title>
		<link>http://www.codemaestro.com/reviews/11#comment-10061</link>
		<dc:creator>dave</dc:creator>
		<pubDate>Sat, 10 May 2008 18:59:36 +0000</pubDate>
		<guid isPermaLink="false">http://beta.codemaestro.com/?p=11#comment-10061</guid>
		<description>Thanks for the info, I think this solves a problem for me. I create linked lists [that is chained structure] in a shared memory seg. First program loads the data [lots of it about 10 lists including processes to start into shm.  second process [an exec] reads the data in the shm, sets up coms to about 100 remote nodes, fires up processes local and remote , and supervises the "system". Only under linux the second process cannot see the linked list. The start of a list is a fixed offset from the start of shm but the  back and next pointers of the next "link" point to locations with junk. No data, no valid next.   I will try this shm file to see if it will get me out of a problem. I ran your test code and it looks good.  So again thanks for the info.  best regards, (dja.)</description>
		<content:encoded><![CDATA[<p>Thanks for the info, I think this solves a problem for me. I create linked lists [that is chained structure] in a shared memory seg. First program loads the data [lots of it about 10 lists including processes to start into shm.  second process [an exec] reads the data in the shm, sets up coms to about 100 remote nodes, fires up processes local and remote , and supervises the &#8220;system&#8221;. Only under linux the second process cannot see the linked list. The start of a list is a fixed offset from the start of shm but the  back and next pointers of the next &#8220;link&#8221; point to locations with junk. No data, no valid next.   I will try this shm file to see if it will get me out of a problem. I ran your test code and it looks good.  So again thanks for the info.  best regards, (dja.)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: tom</title>
		<link>http://www.codemaestro.com/reviews/11#comment-2473</link>
		<dc:creator>tom</dc:creator>
		<pubDate>Mon, 18 Feb 2008 21:53:46 +0000</pubDate>
		<guid isPermaLink="false">http://beta.codemaestro.com/?p=11#comment-2473</guid>
		<description>Do you have a source for the "heavy performance penalty"?</description>
		<content:encoded><![CDATA[<p>Do you have a source for the &#8220;heavy performance penalty&#8221;?</p>
]]></content:encoded>
	</item>
</channel>
</rss>
