Peano Trees, Data Striping, and Distributed Computing

1
Peano Trees, Data Striping, and Distributed
Computing

• Otto Borchert
• North Dakota State University

2
Overview

• Background
• Peano Trees
• Data Striping
• Distributed Computing
• Prototype
• Advantages and Disadvantages
• Demo!

3
Peano Trees
P1 0 1 0 0 0
1101
NZ 1 1 1 0 0
1101
Quad P1 NZ 1000 1100 01 1101 1101
4
Data Striping

• RAID Level 0
• Striping Units

5
Distributed Computing

• Shared Memory
• Many Processors, One Memory Area
• Low Maintenance, Low Scalability
• Shared Disk
• Middle Ground
• Shared Nothing
• Many Processors, nothing shared
• High Maintenance, High Scalability

6
Prototype System

• Server
• Waits for connections
• Divides and distributes work
• Receives new data and redistributes
• Clients
• Connects to server
• Writes data to hard drive (striping)
• Sends more information to server

7
Advantages

• Easy to read
• Easy to debug
• Relatively easy to modify
• Excellent Vector Implementation

8
Disadvantages

• Poor P-tree implementation
• Uses characters instead of bit streams
• No user interface
• Doesnt convert tabular data to raster format

9
Demo!