Sponsored Content
Special Forums UNIX and Linux Applications High Performance Computing Grid vs. Parallel vs. Distributed Post 302094618 by rhfrommn on Monday 30th of October 2006 11:23:58 AM
Old 10-30-2006
I agree mostly with Perderabo's definitions. I'd just add examples.

Parallel Computing - A vector supercomputer like a Cray. Older Cray's like the Y/MP and so on. I know they are now making more distributed/clustered supercomputers too, but the big single Cray boxes are the example of Parallel supercomputing.

Distributed Computing - A huge set of systems all doing the same thing. You can add, remove, and replace an individual one without affecting the overall service at all. Something like the huge Google linux farms that handle search requests.

Grid Computing - I can't come up with a better example than Perderabo's SETI screensaver grid. A commercial example would be Sun's grid they rent out for $1 per hour per cpu.
 

5 More Discussions You Might Find Interesting

1. UNIX for Dummies Questions & Answers

Distributed

I've downloaded distributed latest build for dnetc, and I think i installed it. Not sure where the excicuteable would be. Any help? i realize this is a little ambigious, so I can allways reintstall it if i know how to put it in a specific directory.. does anyone know if VNC works for the Intel... (3 Replies)
Discussion started by: veitcha
3 Replies

2. Shell Programming and Scripting

How to create a grid file

Hi everybody: I want to create a grid file for export to statistical program. My aid is create a file with both rows, one row are x coordenates and other for y coordenates. All grid obviousolly are same space. the form that i want is this: x=(400000 ........ 600000) and y=(4000000 .......... (1 Reply)
Discussion started by: tonet
1 Replies

3. AIX

GRID containers technology

Hi forum, I am aware that on Hp-Superdome technology (Blade Servers) is avaliable while on Solaris GRID technology is the latest in the market. I would like to know if similar high end technology is also available for AIX ? (1 Reply)
Discussion started by: dheram
1 Replies

4. Programming

Distributed Automation kill()

Ok, so Ive been stumped by this problem for the last 3 days, and my exploration is reaching its limitations... The key idea is that at any moment in time, the automation controller could theoretically have any number of threads open to any number of node machines running any number of... (2 Replies)
Discussion started by: jjinno
2 Replies

5. High Performance Computing

how to do GRID COMPUTING?

Hello, I want to know how to combine the processing power of given 2 FEDORA machines in LAN. Can you please tell me the commands,etc used to perform such an operations.Can you please give me the links where I can find more info on this topic. (5 Replies)
Discussion started by: nsharath
5 Replies
DLAED3(l)								 )								 DLAED3(l)

NAME
DLAED3 - find the roots of the secular equation, as defined by the values in D, W, and RHO, between 1 and K SYNOPSIS
SUBROUTINE DLAED3( K, N, N1, D, Q, LDQ, RHO, DLAMDA, Q2, INDX, CTOT, W, S, INFO ) INTEGER INFO, K, LDQ, N, N1 DOUBLE PRECISION RHO INTEGER CTOT( * ), INDX( * ) DOUBLE PRECISION D( * ), DLAMDA( * ), Q( LDQ, * ), Q2( * ), S( * ), W( * ) PURPOSE
DLAED3 finds the roots of the secular equation, as defined by the values in D, W, and RHO, between 1 and K. It makes the appropriate calls to DLAED4 and then updates the eigenvectors by multiplying the matrix of eigenvectors of the pair of eigensystems being combined by the matrix of eigenvectors of the K-by-K system which is solved here. This code makes very mild assumptions about floating point arithmetic. It will work on machines with a guard digit in add/subtract, or on those binary machines without guard digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or Cray-2. It could conceivably fail on hexadecimal or decimal machines without guard digits, but we know of none. ARGUMENTS
K (input) INTEGER The number of terms in the rational function to be solved by DLAED4. K >= 0. N (input) INTEGER The number of rows and columns in the Q matrix. N >= K (deflation may result in N>K). N1 (input) INTEGER The location of the last eigenvalue in the leading submatrix. min(1,N) <= N1 <= N/2. D (output) DOUBLE PRECISION array, dimension (N) D(I) contains the updated eigenvalues for 1 <= I <= K. Q (output) DOUBLE PRECISION array, dimension (LDQ,N) Initially the first K columns are used as workspace. On output the columns 1 to K contain the updated eigenvectors. LDQ (input) INTEGER The leading dimension of the array Q. LDQ >= max(1,N). RHO (input) DOUBLE PRECISION The value of the parameter in the rank one update equation. RHO >= 0 required. DLAMDA (input/output) DOUBLE PRECISION array, dimension (K) The first K elements of this array contain the old roots of the deflated updating problem. These are the poles of the secular equation. May be changed on output by having lowest order bit set to zero on Cray X-MP, Cray Y-MP, Cray-2, or Cray C-90, as described above. Q2 (input) DOUBLE PRECISION array, dimension (LDQ2, N) The first K columns of this matrix contain the non-deflated eigenvectors for the split problem. INDX (input) INTEGER array, dimension (N) The permutation used to arrange the columns of the deflated Q matrix into three groups (see DLAED2). The rows of the eigenvectors found by DLAED4 must be likewise permuted before the matrix multiply can take place. CTOT (input) INTEGER array, dimension (4) A count of the total number of the various types of columns in Q, as described in INDX. The fourth column type is any column which has been deflated. W (input/output) DOUBLE PRECISION array, dimension (K) The first K elements of this array contain the components of the deflation-adjusted updating vector. Destroyed on output. S (workspace) DOUBLE PRECISION array, dimension (N1 + 1)*K Will contain the eigenvectors of the repaired matrix which will be multiplied by the previously accumulated eigenvectors to update the system. LDS (input) INTEGER The leading dimension of S. LDS >= max(1,K). INFO (output) INTEGER = 0: successful exit. < 0: if INFO = -i, the i-th argument had an illegal value. > 0: if INFO = 1, an eigenvalue did not converge FURTHER DETAILS
Based on contributions by Jeff Rutter, Computer Science Division, University of California at Berkeley, USA Modified by Francoise Tisseur, University of Tennessee. LAPACK version 3.0 15 June 2000 DLAED3(l)
All times are GMT -4. The time now is 06:45 PM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy