Grid computing, Computer Engineering

Assignment Help:

Grid Computing means applying the resources of a lot of computers in a network simultaneously to a one problem for solving a scientific or a technical problem that needs a large number of computer processing cycles or accesses to large amounts of data. Grid computing uses software to split and distribute pieces of a program to as many as several thousand computers. A quantity of corporations, professional groups and university consortia has developed frameworks and software for managing grid computing projects.

Therefore, the Grid computing model allows companies to use a large number of computing resources on demand, irrespective of where they are situated. Several computational tasks can be presented using a computational grid. Grid computing gives clustering of remotely distributed computing environment. The principal attention of grid computing to date has been on maximizing the use of available processor resources for compute- intensive applications. Grid computing along with storage virtualization and server virtualization allows a utility computing. Usually it has a Graphical User Interface (GUI), which is a program interface based on the graphics capabilities of the computer to make screens or windows.

Grid computing uses the resources of many separate computers linked by a network (usually the internet) to answer large-scale computation problems. The SETI@home project, opened in the mid-1990s, was the primary widely-known grid computing project, and it has been followed by several others project covering tasks such as research into drugs for cancer, protein folding,  climate models and mathematical problems.

Grid computing offers a model for solving massive computational problems by making use of the unused resources (disk storage and/or CPU cycles) of large numbers of disparate, often desktop, computers behaved as a virtual cluster embedded in a distributed telecommunications infrastructure. Grid computing focus on the ability to support computation across administrative domains which sets it apart from traditional computer clusters or traditional distributed computing.

Several systems which can participate in the grid computing as platform are: Windows 3.1, 95/98, NT, DOS, OS/2, and 2000 XP, supported by Intel (x86); Mac OS A/UX (UNIX) supported by Motorola 680 x0;

AIX (UNIX), Mac OS, OS X (UNIX) supported by Power PC; HP / UX (UNIX) supported by HP 9000 (PA - RISC);

Windows NT, Digital Unix open VMS supported by Compaq Alpha;

VMS Ultrix (UNIX) supported by DEC VAX; Solaris (Unix) supported by SPARC station;

AIX (UNIX) supported by IBM RS / 6000;

IRIS (UNIX) supported by Silicon Graphics workstation.


Related Discussions:- Grid computing

Labels in the sub trees, A sorting method which uses the binary tree concep...

A sorting method which uses the binary tree concept such that label of any node is larger than all  the labels in the sub trees, is called A Sorting method which uses the binar

Write short notes on proton – proton fusion in sun, Q. Write short notes on...

Q. Write short notes on proton - proton fusion in sun. Proton - Proton cycle 1 H 1 + 1 H 1 → 1 H 2 + 1 e 0 + ν (emission of positron as well as neutrino) 1

Explain the working of thousand line exchanges, E xplain the working of th...

E xplain the working of thousand line exchanges by u sing a combination of uniselectors and two motion selectors. The schematic diagram for such an exchange is demonstrated i

Make a generalize program to performs r-ary subtraction, Q. Make a genera...

Q. Make a generalize program that performs r-ary subtraction on two numbers using (r-1)'s and r's complement? Use input and output files.

#title.sequential circuit, design modulo 12 up synchronous counter using t ...

design modulo 12 up synchronous counter using t flip flop

How to input to circuit, Q. How to input to circuit? Register A bit...

Q. How to input to circuit? Register A bits as a0, a1, a2 and a3 in the corresponding X bits of the Full Adder (FA). Register B bits as given in the Figure above as in

Stack and queue, Describe queue? Ans:  It is a type of data structure ...

Describe queue? Ans:  It is a type of data structure in which the data are stored in and retrieved on a First in first out (FIFO) basis. It grows in the direction of increasin

Explain differences between folded and non-folded network, Explain differen...

Explain differences between folded and non-folded network. Folded network: While all the inlets/outlets are connected to the subscriber lines, the logical connection shows as

What are multi-cycle paths, What are multi-cycle paths? Multi-cycle pat...

What are multi-cycle paths? Multi-cycle paths are paths among registers which take more than one clock cycle to turn out to be stable. For illustration analyzing the de

What is verilog case 1, What is verilog case (1) ? wire [3:0] x; al...

What is verilog case (1) ? wire [3:0] x; always @(...) begin case (1'b1) x[0]: SOMETHING1; x[1]: SOMETHING2; x[2]: SOMETHING3; x[3]: SOMETHING4; endcase

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd