<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Recent changes to Home</title><link>https://sourceforge.net/p/roomy/wiki/Home/</link><description>Recent changes to Home</description><atom:link href="https://sourceforge.net/p/roomy/wiki/Home/feed" rel="self"/><language>en</language><lastBuildDate>Mon, 09 Jun 2014 23:20:15 -0000</lastBuildDate><atom:link href="https://sourceforge.net/p/roomy/wiki/Home/feed" rel="self" type="application/rss+xml"/><item><title>Home modified by Daniel Kunkle</title><link>https://sourceforge.net/p/roomy/wiki/Home/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v1
+++ v2
@@ -1,8 +1,24 @@
-Welcome to your wiki!
+# Roomy: A C/C++ Library for Parallel Disk-based Computation

-This is the default page, edit it as you see fit. To add a new page simply reference it within brackets, e.g.: [SamplePage].
+## Overview

-The wiki uses [Markdown](/p/roomy/wiki/markdown_syntax/) syntax.
+The goal of Roomy is to allow programmers to use disk as the main working memory of a computation, instead of RAM. This provides thousands of time more space without significantly increasing system cost. 

-[[members limit=20]]
-[[download_button]]
+To compensate for the lower bandwidth of disks, Roomy uses of many disks in parallel. This can be multiple disks attached to a single shared-memory system, a cluster, or a storage area network (SAN). To compensate for the significantly higher latency of disks, Roomy _delays random access operations_ and performs them efficiently in batch. 
+
+Roomy is implemented as a library for C/C++. It provides a small number of simple data structures (arrays, lists, and hash tables) and associated operations. Roomy data structures are transparently distributed across many disks, and the operations on these data structures are transparently parallelized across the many compute nodes of a cluster. All aspects of parallelism and remote I/O are hidden within the Roomy library. 
+
+## Documentation
+
+[Roomy Installation Instructions](RoomyInstall)
+
+[Roomy Tutorial](RoomyUserGuide): The tutorial demonstrates the Roomy library using several solutions to the _pancake sorting problem_. In particular, we will be calculating the integer sequences given in the [Wikipedia article on pancake sorting](http://en.wikipedia.org/wiki/Pancake_sorting). The solutions are calculated with three different implementations of breadth-first search, using the `RoomyList`, `RoomyArray`, or `RoomyHashTable`. 
+
+[Roomy API](RoomyAPI): The programming interface for the Roomy library. 
+
+## Other Resources
+
+  * [Roomy Sourceforge Project Site](https://sourceforge.net/projects/roomy/): A beta-release and source code can be obtained from the project site. 
+  * The primary developer of Roomy is Dan Kunkle ([web](http://www.ccs.neu.edu/home/kunkle/), email `kunkle@gmail.com`). The following are a Ph.D. thesis proposal and presentation describing Roomy and related research goals. 
+    * Thesis proposal: [Roomy: A New Approach to Parallel Disk-based Computation](http://www.ccs.neu.edu/home/kunkle/thesis/roomy-thesisProposal.pdf). 
+    * Presentation: [Thesis Proposal Presentation, November 9, 2009](http://www.ccs.neu.edu/home/kunkle/thesis/roomy-presentation.pdf). 
&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Daniel Kunkle</dc:creator><pubDate>Mon, 09 Jun 2014 23:20:15 -0000</pubDate><guid>https://sourceforge.net1b963b54e2f95867e2ce50d157e3fd223d422592</guid></item><item><title>Home modified by Daniel Kunkle</title><link>https://sourceforge.net/p/roomy/wiki/Home/</link><description>&lt;div class="markdown_content"&gt;&lt;p&gt;Welcome to your wiki!&lt;/p&gt;
&lt;p&gt;This is the default page, edit it as you see fit. To add a new page simply reference it within brackets, e.g.: &lt;span&gt;[SamplePage]&lt;/span&gt;.&lt;/p&gt;
&lt;p&gt;The wiki uses &lt;a class="" href="/p/roomy/wiki/markdown_syntax/"&gt;Markdown&lt;/a&gt; syntax.&lt;/p&gt;
&lt;p&gt;&lt;h6&gt;Project Members:&lt;/h6&gt;
&lt;ul class="md-users-list"&gt;
&lt;li&gt;&lt;a href="/u/dkunkle/"&gt;Daniel Kunkle&lt;/a&gt; (admin)&lt;/li&gt;&lt;li&gt;&lt;a href="/u/gdc0/"&gt;Gene Cooperman&lt;/a&gt;&lt;/li&gt;&lt;li&gt;&lt;a href="/u/vslavici1676/"&gt;Vlad Slavici&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;&lt;br /&gt;
&lt;/p&gt;&lt;p&gt;&lt;span class="download-button-5176dc7ce88f3d77a5c2f2df" style="margin-bottom: 1em; display: block;"&gt;&lt;/span&gt;&lt;/p&gt;&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Daniel Kunkle</dc:creator><pubDate>Mon, 09 Jun 2014 23:20:00 -0000</pubDate><guid>https://sourceforge.net3c16219203c879acfa52c5dac973f72dfccde0bd</guid></item></channel></rss>