Stanford EE 482C - Multi Node Programming (2 pages)

Previewing page 1 of 2 page document View the full content.
View Full Document

Multi Node Programming



Previewing page 1 of actual document.

View the full content.
View Full Document
View Full Document

Multi Node Programming

15 views

Lecture Notes


Pages:
2
School:
Stanford University
Course:
Ee 482c - Advanced Computer Organization Processor Architecture

Unformatted text preview:

EE482C Advanced Computer Architecture and Organization Proposed Project Topic Multi Node Programming Group Members Henry Fu hwfu Yeow Cheng Ong ycong Harn Hua Ng harnhua Overview In this project methods for mapping stream programs over multiple stream processing nodes are developed and evaluated Specifically these methods are used to partition data and or instructions across the nodes and communicate data state information to coordinate the processors The example chosen for this project is that of IP Packet Routing Metric Execution time of a single Stream Processor configuration is compared against that of a multi node configuration Setup Simulation is done with the idebug simulator using the existing Imagine StreamC and KernelC development tools The definition of a node is shown in Figure 1 below Network Network Host Imagine Network Imagine SDRAM SDRAM Figure 1 A Node 1 Host Processor 2 Imagine Stream Processors Four of these nodes are linked to form a basic multi node configuration block as shown in Figure 2 below Node Node Node Node Basic Multi Node Configuration EE482C Advanced Computer Architecture and Organization Experiment Based on the functionality of IP Routing addressing and error checking information are extracted from each packet compared against a table of existing values and re routed to an appropriate destination address The three main steps are Error Checking based on CRC checksum Table lookup longest prefix matching against table of values stored in memory Next Hop Address assignment and insertion into packets Data stream in this example is represented by the packet traffic The same application is run on a single Imagine processor configuration and on several multi node configurations and the execution times will be recorded Let N be the number of nodes used in a multi node configuration and S be the speedup in execution time as compared to that on a single Imagine processor configuration Example of Method for Load Balancing 3 nodes 3 hosts and 6



View Full Document

Access the best Study Guides, Lecture Notes and Practice Exams

Loading Unlocking...
Login

Join to view Multi Node Programming and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Multi Node Programming and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?