COMP10052-AAAF-03-2010-for-viewing

No interconnecon 5 in the basic model without an

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: need to take into account explicitly.   The crucial new element in distributed computa=on compared to the centralized case is the need to consider an interconnect between different elements. No Interconnec=on 5 In the basic model, without an ALGORITHM interconnect, a single DATA algorithm has (cost ­ neutral) access to a single data ­repository. A L G O   In computer architecture, this is D A T A oKen referred to as SISD (single instruc=on, single data)   ALGO D A T A A L G O DATA Interconnec=ng Storage 6       If we introduce an interconnect, we can, e.g., ALGORITHM apply an algorithm to dis=nct par==ons of a data repository DATA we have distributed for that purpose. Now, access to the data is not cost ­neutral anymore: there is A L G O a cost in going through the interconnect. In computer architecture, this D A T A is oKen referred to as SIMD (single instruc=on, mul=ple data) ALGO D A T A A L G O DATA Interconnec=ng Processors 7           We could also use the interconnect, not on par==ons of the data but rather, to apply several algorithms to the same data. Access to the data is again not cost ­ neutral: there is a cost in going through the interconnect. In computer architecture, this is oKen referred to as MISD (mul=ple instruc=on, single data). This is less generally useful in comparison to SIMD. Graphics processing units use this...
View Full Document

This document was uploaded on 02/10/2014.

Ask a homework question - tutors are online