A PAPER PRESENTATION ON

The hasty computing to access Internet

GRID COMPUTING

NIMRA COLLEGE OF ENGINEERING AND TECHNOLOGY IBRAHIMPATNAM YAMINI.M TEJASWI.K B.TECH CSE B.TECH CSE E-mail:[email protected] E-mail:[email protected]

CONTENTS: Abstract Introduction- Grid computing Importance of Grid computing Types of Grid Our Proposed Grid Model Employing the Globus architecture in our proposed Grid Accessing the proposed Grid Algorithm for proposed Grid Implementation Our Proposed Algorithm Conclusion Bibliography

GRID COMPUTING-THE HASTY COMPUTING TO ACCESS INTERNET

ABSTRACT::
Today we are in the Internet world and everyone prefers to enjoy fast access to the Internet. But due to multiple downloading, there is a chance that the system hangs up or slows down the performance that leads to the restarting of the entire process from the beginning. This is one of the serious problems that need the attention of the researchers. So we have taken this problem for our research and in this paper we are providing a layout for implementing our proposed Grid Model that can access the Internet very fast. By using our Grid we can easily download any number of files very fast depending on the number of systems employed in the Grid. We have used the concept of Grid Computing for this purpose. The Grid formulated by us uses the standard Globus Architecture, which is the only Grid Architecture currently used world wide for developing the Grid. And we have proposed an algorithm for laying our Grid Model that we consider as a blueprint for further implementation. When practically implemented, our Grid provides the user to experience the streak of lightening over the Internet while downloading multiple files.

Keywords:
Grid Security Interface (GSI), Global Access to Secondary Storage (GASS), Monitoring and Discovery Service (MDS), Globus Resource Allocation Manager (GRAM).

IMPORTANCE COMPUTING: INTRODUCTION :

What's Grid computing? Grid Computing is a technique in which the idle systems in the Network and their wasted CPU cycles can be efficiently used by uniting pools of servers, storage systems and networks into a single large virtual system for resource sharing

OF

GRID

Grid computing is emerging as a viable technology that businesses can use to wring more profits and productivity out of IT resources -- and it's going to be up to you developers and administrators to understand Grid computing and put it to work. It's really more about bringing a problem to the computer (or Grid) and getting a solution to that problem. Grid computing is flexible, secure, coordinated resource sharing among dynamic

dynamically at runtime. These systems can be distributed across the globe; they're heterogeneous (some PCs, some servers, maybe mainframes and

supercomputers); somewhat autonomous (a Grid can potentially access resources in different organizations). Although Grid computing is

collections of individuals, institutions, and resources. Grid computing enables the virtualization of distributed computing resources such as processing, network bandwidth, and storage capacity to create a single system image, granting users and applications seamless access to vast IT capabilities. Just as an Internet user views a unified instance of content via the World Wide Web, a Grid user essentially sees a single, large, virtual computer.

firmly ensconced in the realm of academic and research activities, more and more companies are starting to turn to it for solving hard-nosed, real-world problems.

Grid worldwide distributed

computing access to a -

will network CPU

give of

over local and remote systems, and the individual results are consolidated at the end. Viewed from another perspective, these systems are connected to one big computing Grid. The individual nodes can have different architectures,

resources

cycles,

storage capacity, devices for input and output, services, whole applications, and more abstract elements like licenses and certificates. For example, to solve a computeintensive problem, the problem is split into multiple tasks that are distributed

operating systems, and software versions. Some of the target systems can be clusters of nodes themselves or high performance servers. and other resources. Owners of the

TYPES OF GRID:
The three primary types of grids and are summarized below:

desktop machines are usually given control over when their resources are available to participate in the grid. Data Grid A data grid is responsible for housing and providing access to data across multiple organizations. Users are not concerned with where this data is located as long as they have access to the data.

Computational Grid
A computational grid is focused on setting aside resources specifically for computing power. In this type of grid, most of the machines are highperformance servers.

Scavenging grid A scavenging grid is most commonly used with large numbers of desktop machines. Machines are

OUR PROPOSED GRID MODEL:

scavenged for available CPU cycles

We are using the Scavenging Grid for our implementation as large numbers of desktop machines are used in our Grid and later planning to extend it by using both Scavenging and data Grid. Figure1 gives an idea about the Grid that we have proposed.

While accessing Internet most of us might have faced the burden of multiple downloading and in particular with downloading huge files i.e., there can be a total abrupt system failure while a heavy task is assigned to the system. The system may hang up and may be rebooted while some

PROBLEMS DUE TO MULTIPLE DOWNLOADING:

percentage of downloading might have been completed. This rebooting of the system leads to download of the file once again from the beginning, which is one of the major problems everyone is facing today. Let us consider N numbers of files of different sizes (in order of several MBs) are being downloaded on a single system (a PC). This will take approximately some minutes or even some hours to download it by using an Internet connection of normal speed with a single CPU. This is one of the tedious tasks for the user to download

multiple files at the same time. Our Grid plays a major role here.

CONCEPT OF OUR PROPOSED GRID:

In order to avoid this problem we have formulated our own Grid for such an access to the Internet via an Intranet (LAN). By using our Grid these large numbers of files are

distributed evenly to all the systems in the Network by using our Grid. For example we have taken into account of a small LAN that consists of around 20 systems out of which 10 systems are idle and 5 systems are using less amount of CPU(for our

WORKING PROPOSEDGRID:
When we

OF

THE

are

downloading

multiple files using Internet the Grid formulated by us comes in to action. A dialog box will appear on the Desktop asking the user whether to use the Grid or not? If the user selects use the Grid, then automatically the available system resources in the Network are obtained by

consideration) and their CPU cycles are wasted. And our work begins here, as we are going to efficiently utilize those wasted CPU cycles into working cycles.

FIGURE

1:

LAYOUT

OF

OUR

the Globus Toolkit. The configurations of the idle systems are noted and the highest

INTRANET GRID:

configuration system gets the highest priority in the priority Queue. E.g. If there is a supercomputer with 8 CPUs, another Supercomputer with 5 CPUs and some other PCs with P32.0GHz, 1.0GHz, P4-2.0GHz, P3-1.3GHz, P4-2.5GHz, P4-1.5GHz, P3P3-

authenticated

user

can

access

this

database and can retrieve his file that he has downloaded. The various processes that are taking place in our Grid such as authentication, availability of resources, scheduling, data management and finally job and resource management are viewed by following a standard architecture The Globus Architecture.

1.13GHz, P4 -2.4GHz are found in the Network. Then the order of priority will be: 1. Supercomputer-8 CPUs, 2.

Supercomputer-5 CPUs, 3. P4-2.5GHz, 4. P4-2.4GHz, 5. P4-2.0GHz, 6. P3-2.0GHz, 7. P4-1.5GHz, 8. P3-1.3GHz, 9. P31.13GHz, 10. P3-1.1GHz. Now the user can click any number of files to download. The file size of each file is obtained and is stored in the priority Queue based on maximum size as highest priority. Now the highest priority file is matched with the highest priority system in the Network. The files get evenly distributed to their matched idle systems. The downloading gets

PROPOSED ALGORITHM FOR OUR INTRANET GRID: Steps to perform multiple

downloading on the Grid. The host details are got from the server of the LAN in order to identify the various hosts. The host information is got whenever needed on the priority queue basis. //module for downloading files

completed in those systems and these file gets stored in the common database. The

[1]. file

Start lookup // look for size and resource

[8]. [9]. <=

Initialize counter For (counter =1; counter nres; counter++) //

information [2]. Declare nres, nfile // no of resources available and no of files [3]. [4].
[5].

initialize the loop to assign the files.

[10].

Assign the 1st file of P2 to

Input nres, nfiles Input size // the file size Initialize P1 res info // store the in resource priority

the 1st node in P1.// first node will be node with highest configuration and first file will be the file maximum size. [11]. Start processing // files

information queue system priority

[6].

P1 with highest configuration as

directed to the appropriate system for accessing their wasted CPU cycles. [12]. [13]. [14].
[15].

Initialize P2 file size // store the file information in the priority queue P2 with maximum priority file size as

Loop Else: Start timer Delay 1 min Collect incoming files //

[7].

If condition (nfiles == nres) // check whether the no of resources is equal to no of files

[16].

the files that the user clicked to download in this

duration.

[17].

Assign the files P2 Goto step 8 Goto step 1 End // when the user

the Intranet Grid we have proposed adds a milestone for the Globalization of Grid Architecture, which, leads to the hasty computing that is going to conquer the world in the nearest future. By

[18]. [19]. [20].

exits from proposed Grid.

implementing our proposed Intranet Grid it is very easy to download multiple files very fast and no need to worry about the

CONCLUSION:
Grid computing was once said to be fading out but due to the technological convergence it is blooming once again and

security as we are authenticating each and every step taking place in our Grid and in particular user to access the database. Further implementations

could be carried out in the nearest future.

BIBILIOGRAPHY: [1]. [2]. [3]. The Globus Alliance, The Globus Toolkit 3.0.

Foster, The GRID: Blueprint for a New Computing Infrastructure.Morgan-Kaufmann, 1999. Foster, I, Kesselman, C, Nick, J.M., and Tuecke, S. The Physiology of the Grid: An Open Grid Services Architecture for Distributed Systems Integration.

WEB REFERENCES:

[1]. www. Globus.org [2]. www.GridForum.org [3]. www.gridcomputingplanet.com [4]. www.globus.org/ogsa.2002.

Implementation Of Algorithm In Java

import javax.swing.JOptionPane; public class Ojava { public static void main( String args[] ){ int fsize[]; fsize= new int[10]; double rconf[],d; rconf= new double[10]; String a,b,output=""; int c; int nres,nfiles; a=JOptionPane.showInputDialog("Enter the no of Resources:"); b=JOptionPane.showInputDialog("Enter the no of Files:"); nres=Integer.parseInt(a); nfiles=Integer.parseInt(b); for(int i=0; i<nres ;i++) { a=JOptionPane.showInputDialog("Enter config of resource-"+i+":"); rconf[i]=Double.parseDouble(a); } for(int i=0;i<nfiles;i++) { a=JOptionPane.showInputDialog("Enter size of file-"+i+" to be downloaded:"); fsize[i]=Integer.parseInt(a); } for(int j=0;j<nfiles;j++) for(int k=j+1;k<nfiles;k++) if(fsize[j]>fsize[k]){ c=fsize[j]; fsize[j]=fsize[k]; fsize[k]=c; } for(int j=0;j<nres;j++) for(int k=j+1;k<nfiles;k++) if(rconf[j]>rconf[k]){ d=rconf[j]; rconf[j]=rconf[k]; rconf[k]=d; } output= "RESOURCES(P1) for(int j=nfiles-1;j>=0;j--) FILES(P2)"+"\n";

output +="\n"+"P4-"+rconf[j]+"GHz"+" -- > +"MB"+"\n"; JOptionPane.showMessageDialog(null,output); System.exit(0); }//End of main() }//End of class.

"+fsize[j]

EXECUTION