<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <title>DSpace Collection:</title>
  <link rel="alternate" href="http://dspace.uniten.edu.my/jspui/handle/123456789/595" />
  <subtitle />
  <id>http://dspace.uniten.edu.my/jspui/handle/123456789/595</id>
  <updated>2013-05-18T06:21:46Z</updated>
  <dc:date>2013-05-18T06:21:46Z</dc:date>
  <entry>
    <title>Satisfiable Share memory Algorithm In distributed inter Process Communication</title>
    <link rel="alternate" href="http://dspace.uniten.edu.my/jspui/handle/123456789/3239" />
    <author>
      <name>M.Hakim</name>
    </author>
    <author>
      <name>M.Azman</name>
    </author>
    <author>
      <name>J.Jais</name>
    </author>
    <id>http://dspace.uniten.edu.my/jspui/handle/123456789/3239</id>
    <updated>2011-01-28T01:23:16Z</updated>
    <published>2005-11-22T00:00:00Z</published>
    <summary type="text">Title: Satisfiable Share memory Algorithm In distributed inter Process Communication
Authors: M.Hakim; M.Azman; J.Jais
Abstract: This paper describes the concept, design and implementation of DIPC. A deep look into the concept of message queue algorithm will be carried out in order to understand the working.</summary>
    <dc:date>2005-11-22T00:00:00Z</dc:date>
  </entry>
</feed>

