17 Pages

dist-mem

Course: COMP 3320, Fall 2009
School: Allan Hancock College
Rating:
 
 
 
 
 

Word Count: 525

Document Preview

Memory Distributed and Cluster Computers Alistair Rendell (Adapted From Parallel Programming, Techniques and Applications using Networked Workstations and Parallel Computers, B. Wilkinson and M. Allen, Prentice Hall) 1.1 Message-Passing Multicomputer Interconnection network Messages Processor Local memory Computers All communication by messages sent over the interconnection network More scalable than shared...

Register Now

Unformatted Document Excerpt

Coursehero >> California >> Allan Hancock College >> COMP 3320

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Memory Distributed and Cluster Computers Alistair Rendell (Adapted From Parallel Programming, Techniques and Applications using Networked Workstations and Parallel Computers, B. Wilkinson and M. Allen, Prentice Hall) 1.1 Message-Passing Multicomputer Interconnection network Messages Processor Local memory Computers All communication by messages sent over the interconnection network More scalable than shared memory parallel computers (The boundary between distributed and shared memory systems is not clear cut) 1.2 Interconnection Networks Key characteristics latency, bandwidth, bisection bandwidth, diameter, cost Static exhaustive interconnections 2- and 3-dimensional meshes hypercubes Dynamic Crossbar Trees Multistage interconnection networks 1.3 Two-dimensional array (mesh) Links Computer/ processor Also torus and 3-dimensional - used in some large high performance systems. 1.4 Three-dimensional hypercube 110 100 111 101 010 000 011 001 1.5 Four-dimensional hypercube 0110 0100 0101 0111 1100 1110 1101 1111 0010 0000 0001 0011 1000 1010 1001 1011 Hypercubes popular in 1980s - not now 1.6 Crossbar switch Memories Processors Switches 1.7 Tree Root Links Switch element Processors Whats a FAT tree? 1.8 Multistage Interconnection Network Example: Omega network 2 2 switch elements (straight-through or crossover connections) 000 001 010 011 Inputs 100 101 110 111 000 001 010 011 Outputs 100 101 110 111 1.9 Communication Methods Switching options (no direct link) Circuit switching (Intel IPSC-2) Packet switching (everything else) Store-and-forward message entirely received by intervening nodes Wormhole routing Message divided into flits that are pipelined through the communication network Care to avoid possible deadlock and/or livelock scenarios 1.10 Networked Computers as a Computing Platform A network of computers became a very attractive alternative to expensive supercomputers parallel and computer systems for high-performance computing in early 1990s. Several early projects. Notable: Berkeley NOW (network of workstations) project. NASA Beowulf project. (Will look at this one later) 1.11 Key Drivers Amazing increase in performance of commercial off the shelf PCs at very low cost Availability of commodity high performance networking The GPL software revolution Advantages The latest processors can easily be incorporated into the system as they become available. Existing software can be used or modified. 1.12 Software Tools for Clusters Based upon Message Passing Parallel Programming: Parallel Virtual Machine (PVM) - developed in late 1980s. Became very popular. Message-Passing Interface (MPI) - standard defined in 1990s. Both provide a set of user-level libraries for message passing. Use with regular programming languages (C, C++, ...). 1.13 Beowulf Clusters* A group of interconnected commodity computers achieving high performance with low cost. Typically using commodity interconnects high speed Ethernet, and Linux OS. * Beowulf comes from name given by NASA Goddard Space Flight Center cluster p...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Allan Hancock College - COMP - 3320
Some comments only-Q. Run mpipingpong on 2 CPUs. You will find that the code appears to stopafter reporting results for 65536bytes. Why is this? Fix it!It stops because you have both processes wanting to send at the sametime. This works okay f
Allan Hancock College - COMP - 3320
Cache Oblivious Matrix Transposition: Simulation and ExperimentDimitrios Tsifakis, Alistair P. Rendell* and Peter E. StrazdinsDepartment of Computer Science, Australian National University Canberra ACT0200, Australia dtsifakis@ieee.org, alistair.re
Allan Hancock College - COMP - 3320
THE AUSTRALIAN NATIONAL UNIVERSITY First Semester Examination June 2005 COMP3320/COMP6464/Honours High Performance Scientic Computing Study Period: 15 minutes Time Allowed: 3 hours Permitted Materials: Calculator Exam questions total 70 marks. COMP3
Allan Hancock College - COMP - 3320
5.2.1Global R RegistersA1Registers R[0] R[7] refer to a set of eight registers called the global registers (labeled g0 through g7). At any time, one of MAXGL +1 sets of eight registers is enabled and can be accessed as the current set of globa
Allan Hancock College - COMP - 3320
Towards Linear Scaling MD COMP3320/6464Code Kernelfor (i=1; i<total_atoms; i+) for (j=0; j<i; j+) r2 = (at[i].x at[i].x)^2 + (at[i].y (at[i].z at[i].z)^2 PE += 1.0/r2^6 2.0/r2^3 f_x = (12.0/r2^7 12.0/r2^4)(at[i].x f_y = (12.0/r2^7 12.0/r2^4)(
Allan Hancock College - COMP - 3320
COMP3320/COMP6464: Operation Balance and Memory Access Patterns Alistair RendellSee: High Performance Computing, Dowd and Severance, Chapter 812.2Example: Vector Rotation Consider vector rotation by angle (where (c, s) = (cos , sin ) - Vector
Allan Hancock College - COMP - 2400
COMP2400-2005-051Australian National University Department of Computer ScienceCOMP2400/COMP6240Assignment 1 SQL Queries Deadline : 5.00pm Friday 19 August 2005 1 IntroductionSQL is a widely used standard on the relational database scene. It
Allan Hancock College - COMP - 2300
Data RepresentationCharacters and Stringsq text can be stored in memory by using a number to represent every character q Refs: O'H&Bryant sect 2.1,2.4, Null&Lobur sect 2.52.7, Tanembaum appendix B,related web linkss ASCII (American Standard Co
Allan Hancock College - COMP - 2600
Structural InductionCOMP2600 Formal Methods for Software EngineeringBen Lippmeier Australian National University Semester 2, 2008COMP 2600 Structural Induction1Structural InductionWhat is covered in this topic. Induction on the natural
Allan Hancock College - COMP - 3600
The Australian National University Department of Computer ScienceCOMP3600/COMP6466 in 2008 Assignment Two(Due: 5pm Friday, October 24 Late Penalty: 25% per day) Question 1.(50/50 for COMP3600 and 40/50 for COMP6466) Given two integers n and M wit
Allan Hancock College - COMP - 8400
THE AUSTRALIAN NATIONAL UNIVERSITY First Semester Examination June 2008 COMP8400 Algorithms and Techniques for Data Mining Study Period: 15 minutes Time Allowed: 3 hours Permitted Materials: One A4 page with notes on both sides. NO calculator permit
Allan Hancock College - COMP - 3420
DataPreprocessing Lecture12:Overviewofdatapreprocessing Lecture13:Descriptivedatasummarization Lecture14:Datacleaning Lecture15:Dataintegration/transformationanddata reduction Lecture16:Discretizationandconcepthierarchy generationandsummaryL
Allan Hancock College - COMP - 2400
SQL> - cae August 2006SQL> SQL> drop table VideoHistory;Table dropped.SQL> SQL> create table VideoHistory as 2 select * from tvs.video;Table created.SQL> SQL> alter table VideoHistory 2 add YearSold number(4);Table altered.SQL>
Allan Hancock College - COMP - 2400
- copy the file student.sql into the SQL*Plus buffer and - execute by typing '/' on the next line.SQL> get student.sql 1 - A V Peterson 05-07-2005 2 - Student( StudentId, Surname, Initials, Degree ) 3 CREATE TABLE Student 4 ( 5 S
Allan Hancock College - COMP - 2400
SQL> start enrolment.sqlSQL> - AV Peterson 05-07-2005SQL> SQL> - Enrolment( StudentId, CourseCode, Mark, Year, Sem, Grade )SQL> SQL> CREATE TABLE Enrolment 2 ( 3 StudentId NUMBER(7), 4 CourseCode VARCHAR(8), 5 Year NUMBER(4),
Allan Hancock College - COMP - 2400
SQL> - cae August 2006SQL> SQL> select length, incolor, count(*) 2 from movie 3 group by length, incolor; LENGTH INCOL COUNT(*)- - - 34 true 34 false 19 83 true
Allan Hancock College - COMP - 2400
SQL> start q16.sqlSQL> - A V Peterson 26-07-2005SQL> - Q16 How many students are enrolled in COMP2400 in 2005?SQL> SQL> SELECT COUNT(*) 2 FROM Enrolment 3 WHERE CourseCode = 'COMP2400' 4 AND Year = 2005 5 / COUNT(*)
Allan Hancock College - COMP - 2400
SQL> set pagesize 250SQL> select nvl(soldto, 'No-one'), movieid 2 from video;NVL(SOLDTO MOVIEID- -No-one 1No-one 2No-one 3No-one 5No-one 72001/00002 112001/0000
Allan Hancock College - COMP - 2031
0 1 2 3 4 5 6 7 -19 3 5 6 2 -12 3 -10 -1
Allan Hancock College - COMP - 2300
2006 COMP2300 Exam Q2 (C Programming)[20 marks](a) Write a function int palindrome(char *str, int len) which for thegiven input string str of length len determines if it is a palindrome ornot. A palindrome is defined as a sequence of charact
Allan Hancock College - COMP - 2300
COMP2300-2006-CourseAdminThe Australian National University1Faculty of Engineering & Information TechnologyDepartment of Computer Science COMP2300-2006-CourseAdmin 2006 Course Administration1 PreambleThis document gives a brief description o
Allan Hancock College - COMP - 2300
COMP2300-2007-CourseAdminThe Australian National University1Faculty of Engineering & Information TechnologyDepartment of Computer Science COMP2300-2007-CourseAdmin 2007 Course Administration1 PreambleThis document gives a brief description o
Allan Hancock College - COMP - 2300
Data Representationq Refs: O'H&Bryant sect 2.1,2.4, Null&Lobur sect 2.52.7, Tanembaum appendix B,related web linksq bit, byte and word q characters and strings, ASCII q big-endian, little-endian q representing real numbersCOMP2300 D2: Data Rep
Allan Hancock College - COMP - 2300
PeANUt Module OverviewPeANUt The Basicsq a simple microprocessor simulator for teaching purposes q main topics: s s s sPeANUt architecture, machine and assembly language programming branches and conditions, loops, input/output, traps, macros p
Allan Hancock College - COMP - 2300
From Physical Memory To Virtual Memory: Understanding the Memory HierarchyAlistair RendellMemory Chips: DRAM Alternative to SRAM 1 capacitor and 1 transistorData off line Capacitor stores (10-15F) Just 40,000 electrons!Address LineTransi
Allan Hancock College - COMP - 2300
THE AUSTRALIAN NATIONAL UNIVERSITY Mid Semester Examination, April 2007 COMP2300 (Introduction to Computer Systems ) Writing Period: 1 hour duration Study Period: 0 minutes duration Permitted Materials: One A4 page with notes on both sides. NO calcul
Allan Hancock College - COMP - 2300
PeANUt Module Overviewq a simple microprocessor simulator for teaching purposes q main topics: s s s sPeANUt architecture, machine language and assembler programming branches and conditions, loops, input/output, traps, macros procedures and functi
Allan Hancock College - COMP - 2300
Allan Hancock College - COMP - 2300
Consider ( x 1)( x 7) y= ( x 11)With x = 10 we may proceed as (10-1) = 9 (10-7) = 3 Writing (9*3) = 27 intermediates on paper (10-11) = -1 27/(-1) = -27A Stack A Last In First Out (LIFO) data structure Consider a pile of paper we can pu
Allan Hancock College - COMP - 2300
COMP2300: OS and VM-related exam questions, 2007Q4(b) In both paging and set-associative caches, the least recently used(LRU), first-in-first-out (FIFO) and random replacement policies may beused. In general, which of these performs best and wh
Allan Hancock College - C - 2300
#include <stdio.h>int main(){ int i, total; total=0; for (i=0; i<20; i+) { if (i < 8 ){ continue; } else if (i > 4 & i < 12){ total=total+i; } else if (i > 10) { break; } else { tota
Allan Hancock College - COMP - 2300
#include <stdio.h>int main(){ int i, total; total=0; for (i=0; i<20; i+) { if (i < 8 ){ continue; } else if (i > 4 & i < 12){ total=total+i; } else if (i > 10) { break; } else { tota
Allan Hancock College - COMP - 2300
Assembly Level Machine OrganisationLecture 4Procedures in PeANUt Number systems (bases) in .mli les Procedure / function calls Nested procedures The stack Stack pointer Stack addressing mode Stack frame Reference: Specication of the PeANU
Allan Hancock College - COMP - 2300
Assembly Level Machine OrganisationLecture 9Bit operations and traps in PeANUt Bitwise operations Traps Trap concept PeANUt traps Trap handler and trap table Debugging References: Specification of the PeANUt computer (2.8.3 and Appendix B
Allan Hancock College - COMP - 2300
Module 2: The C programming languageLecture 4Various C assert(.) Multi-module programs #dene (Macros) Compilation and linking revisited The last word on C1COMP2300, 2006Module 2: The C programming languageLecture 4assert(.) assert
Allan Hancock College - COMP - 2300
Assembly Level Machine OrganisationLecture 1PeANUt Module Overview A simple microprocessor simulator for teaching purposes Main topics PeANUt architecture, machine language and assembly programming Branches and conditions, loops, input/outpu
Allan Hancock College - COMP - 2300
Assembly Level Machine OrganisationLecture 7Some announcements Assignment 1 is due next Wednesday 5th April at 12:00 (noon) Assignment 2 will be released towards the end of next week (draft version rst) (due in week 11, Wednesday 17th May) Lab
Allan Hancock College - COMP - 2300
Welcome to COMP2300 Introduction to Computer SystemsUltraSPARC III Cu processor layout(a rather advanced computer system!)COMP2300 2006 Lecture 1: Introduction20061Course Contactq Course web site: http:/cs.anu.edu.au/Student/comp23
Allan Hancock College - COMP - 2300
Examination Preparation LectureFinal examination Saturday, 17 June, 9:15 am 12:30 am, Sports Hall Please verify date, time and location 15 minutes reading time (9:15-9:30) Permitted material: A4 page (one sheet) with notes on both sides (no a
Allan Hancock College - COMP - 2300
Memory Systems and Modern MachinesLecture 2Announcements Assignment 1 will be returned in labs this week and marks will become available in StReaMS tomorrow (Tuesday) Some students will not see any marks (but will receive an e-mail.) :-( Lab 5
Allan Hancock College - COMP - 2300
#include<stdio.h> int main(void) { FILE *fp; int i; fp = fopen("myfile.txt","r+");
Allan Hancock College - C - 2300
#include <stdio.h>int main(void) { short int *x; /* x is a pointer to a variable of type int */ short int a = 2; printf(" sizeof(a) = %d\n",sizeof(a); printf(" sizeof(x) = %d\n",sizeof(x); x = &a; /* The address of a is assigned to
Allan Hancock College - COMP - 2300
#include <stdio.h>int main(void) { short int *x; /* x is a pointer to a variable of type int */ short int a = 2; printf(" sizeof(a) = %d\n",sizeof(a); printf(" sizeof(x) = %d\n",sizeof(x); x = &a; /* The address of a is assigned to
Allan Hancock College - C - 2300
#include <stdio.h> void next_year(int *y); int main(void) { int this_year; this_year = 1981; next_year(&this_year); printf("Year: %d\n", this_year); return 0;}void next_year(int *y) {
Allan Hancock College - COMP - 2300
#include <stdio.h> void next_year(int *y); int main(void) { int this_year; this_year = 1981; next_year(&this_year); printf("Year: %d\n", this_year); return 0;}void next_year(int *y) {
Allan Hancock College - COMP - 2300
Welcome to COMP2300 Introduction to Computer SystemsUltraSPARC III Cu processor layout(a rather advanced computer system!)COMP2300 Lecture 1: Introduction20071Course Contactq course web site: http:/cs.anu.edu.au/Student/comp2300 q
Allan Hancock College - COMP - 2300
COMP2300 - TuteLab 05file:/home/peter/comp2300/doc/html/TuteLab05.htmlCOMP2300 Tutorial / Laboratory 05 - PeANUt ExperimentsSemester 1, 2007 Week 6 (26 March - 30 March)Note that for this session, there is a submitable laboratory exersise which
East Los Angeles College - GEOG - 5025
GEOG5021M: Using Databases and GIS Unit 1 PracticalUsing Access: Database Creation, Query Construction and Reporting IntroductionThe practical is in three parts. The first part gets you started with Microsoft Access by requiring you to build your o
Allan Hancock College - COMP - 2300
Evolution of the Computerq Refs: [O'H&Bryant, ch 1,3.1]; TextRefNull&Loburch 1; [Tanembaum, Ch 1,2];related web linksq history q computer technology & and von Neumann architecture q architecture s central processing unit (CPU) s arithmetic logic
Allan Hancock College - COMP - 2300
Further PeANUtq Ref: [PeANUt Spec, ]; also [OH&Bryant, sect 3.6] q traps: s input and output s relationship with exceptions q conditional branches: s condition codes (part of PSW register) s branch instructions s repetition q index register and inde
Allan Hancock College - COMP - 2300
Course Review and Exam Discussionq review Q4(a) from 2006 exam (maybe a few others) q final examination: s details s topics q review of major underlying themes q outlook for computer systems q other issues: s 14:0014:15: CEDAM Surveys x please take
Allan Hancock College - COMP - 2300
COMP2300-2007-02The Australian National University1Faculty of Engineering & Information TechnologyDepartment of Computer Science COMP2300-2007-02 Notes for Tutorial/Laboratory Session 03: C I/O, Pointers and StructuresNo preparation exercise a
Allan Hancock College - COMP - 2300
Procedure Calls and Address Parameters in PeANUtq ref: [PeANUt Spec, sect 4] q procedure calls s with local variables s with return values (non-void functions) q address parameters s ability to modify data s indirect memory reference via pointers q
Allan Hancock College - COMP - 2300
Virtual Memory in PeANUtq ref: [PeANUt Spec, sect 3]; additionally [O'H&Bryant, sect 10.110.7] or[Null&Lobur, sect 6.5]q virtual memory implementation s page tables q virtual memory in PeANUt s page replacement s paging behaviour s working sets q
Allan Hancock College - COMP - 2300
42
Allan Hancock College - COMP - 2300
/* Rename this file as: factorial.c */#include <assert.h>#include "factorial.h"int factorial(int n){ int value,i; assert(n>=0); value=1; i=2; while (i <= n) value*=i+; return value;}
Allan Hancock College - COMP - 2300
COMP2300: SPARC & OS, 20064(e) Consider the SPARC assembler program example0.s below, annotatedwith the corresponding C program in comments (the C code can assumed tobe equivalent). The programs compiled using the commands gcc -c exa
Allan Hancock College - C - 2300
#include <stdio.h>int main(void) { short int *x; /* x is a pointer to a variable of type int */ short int a = 2; printf(" sizeof(a) = %d\n", sizeof(a); printf(" sizeof(x) = %d\n", sizeof(x); x = &a; /* the address of a is assigned
Allan Hancock College - COMP - 2300
#include <stdio.h>int main(void) { short int *x; /* x is a pointer to a variable of type int */ short int a = 2; printf(" sizeof(a) = %d\n", sizeof(a); printf(" sizeof(x) = %d\n", sizeof(x); x = &a; /* the address of a is assigned
Allan Hancock College - C - 2300
#include <stdio.h> void nextYear(int *y); int main(void) { int thisYear; thisYear = 1981; nextYear(&thisYear); printf("Year: %d\n", thisYear); return 0;}void nextYear(int *y) { *y = *y + 1;
Allan Hancock College - COMP - 2300
#include <stdio.h> void nextYear(int *y); int main(void) { int thisYear; thisYear = 1981; nextYear(&thisYear); printf("Year: %d\n", thisYear); return 0;}void nextYear(int *y) { *y = *y + 1;