<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel rdf:about="http://dspace.uniten.edu.my/jspui/handle/123456789/595">
    <title>DSpace Collection:</title>
    <link>http://dspace.uniten.edu.my/jspui/handle/123456789/595</link>
    <description />
    <items>
      <rdf:Seq>
        <rdf:li rdf:resource="http://dspace.uniten.edu.my/jspui/handle/123456789/3239" />
      </rdf:Seq>
    </items>
    <dc:date>2013-05-18T06:21:46Z</dc:date>
  </channel>
  <item rdf:about="http://dspace.uniten.edu.my/jspui/handle/123456789/3239">
    <title>Satisfiable Share memory Algorithm In distributed inter Process Communication</title>
    <link>http://dspace.uniten.edu.my/jspui/handle/123456789/3239</link>
    <description>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.</description>
    <dc:date>2005-11-22T00:00:00Z</dc:date>
  </item>
</rdf:RDF>

