Parallel Computing using Open Science Grid Compared to MapReduce Grid

Abstract: Parallel Computing is a type of computation during which many calculations square measure allotted simultaneously, in operation on the principle that enormous problems can typically be divided into smaller problems, which are then solved at the same time (parallel).
In this paper, we have a tendency to study the
substance of Parallel Computing, what it is, and also the applications of Parallel Computing. we will additionally look into another topic called Open Science Grid. Using Hadoop on Parallel Computing allows the users to get info from many places quickly instead of receiving knowledge from one source at a time. In HOG, we have a tendency to improve Hadoop's ability to receive info from many knowledge centres across the U.S. in a single time instead of knowledge from one centre at a time. we will compare whether Hadoop on Parallel Computing using associate degree Open Science Grid (OSG) is better than employing a MapReduce on the Grid. we have a tendency to conclude that HOG's Parallel Computing could be a higher thanks to gather and maintain knowledge than MapReduce on the Grid.

Key Words: MapReduce Grid, Parallel Computing, Open Science Grid, Hadoop

I. Introduction

Parallel Computing is an effective approach for USA to process many data sources directly instead of method data from sources one at a time which is what happens with MapReduce Grid. The origins of Parallel Computing return to Federico Luigi, Conte Macabre, and his 'Sketch of the Analytic Engine unreal There square measure many categories of parallel computers. the first variety of parallel computer could be a Multicore computer. A multicore processor could be a processor that
includes multiple execution units ('cores') on constant chip. A multicore processor can issue multiple instructions per cycle for multiple instruction streams. IBM's Cell microchip designed to be used in the PlayStation three is associate degree example of a prominent multicore processor. Each core in a multicore processor has the potential to be superscalar also which suggests that on every cycle, every core can issue multiple instructions per cycle from one instruction stream. Another category of Parallel Computing is regular multiprocessing. A regular multiprocessor (SMP) could be a computer system with multiple identical processors that share memory and connect via a bus. Bus contention prevents bus architectures from scaling. As a result SMP's generally do not comprise of more than 32 processors. regular multi-processors are extraordinarily value effective owing to their small size and also the reduction of information measure. Another category of Parallel Computing is Distributed Computing. This is a computer system during which the process elements square measure connected by a network. Distributed computers square measure extremely ascendible. Another category of Parallel Computing is Cluster Computing. A cluster could be a cluster of loosely coupled computers that job thus closely together that sometimes they'll even be thought of a single computer. Clusters square measure composed of multi standalone machines that square measure connected by a network. Machines in a cluster are not required to be regular however load equalization is created difficult if they are not. The most common variety of cluster is that the fictional character Virtual Organizations square measure a group of individuals and/or establishments that perform research and share resources. The OSG is used by scientists and researchers for knowledge analyst tasks which square measure too computationally intensive for a single knowledge centre or mainframe computer. The Open Service Grid was printed by the worldwide Grid Forum as a planned recommendation in 2003. The Open Science Grid could be a community alliance in which universities, national laboratories, scientific collaboration and package developers contribute computing and knowledge storage resources, package and technologies. at first propelled by the high energy physics community, participants from associate degree array of sciences now used the Open Science Grid. It was originally meant to produce associate degree infrastructure layer for the Open Grid Services architecture (OGSA). Users submit jobs to remote gatekeepers. Users can use completely different tools that can communicate using the Globus resource specification language. The common tool is New World vulture. Once the jobs arrive at the gatekeeper, the gatekeeper will then submit them to the respective batch computer hardware happiness to the sites. The remote batch computer hardware can launch those jobs per its scheduling policy. Sites can offer storage resources accessible with the user's certificate. All storage resources square measure once more accessed by a set of common protocols. The structure of HOG is comprised of 3 elements.

The first component is that the grid submission and execution. in this component, the Hadoop employee nodes requests square measure sent out to the grid and their execution is managed. The second major component is the Hadoop distributed classification system (HDFS) though no knowledge are lost. when the grid job starts, the helper servers can report to the single master server.

HDFS on the Grid: Hadoop consists of the Hadoop Common package, which provides filesystem and OS level abstractions, a MapReduce engine (either MapReduce/MR1 or YARN/MR2) and also the Hadoop Distributed File System (HDFS). The Hadoop Common package contains the required Java
ARchive (JAR) files and scripts needed to start Hadoop. The package additionally provides source code, documentation and a contribution section that includes comes from the Hadoop Community.For effective scheduling of work, every Hadoop-compatible classification system should offer location awareness: the name of the rack (more exactly, of the network switch) wherever a employee node is. Hadoop applications can se this information to run work on the node wherever the data is, and, failing that, on constant rack/switch, reducing backbone traffic. HDFS uses this method when replicating data to try to stay completely different copies of the data on completely different racks. The goal is to reduce the impact of a rack power outage or switch failure, so that notwithstanding these events occur, the info may still be readable. A small Hadoop cluster includes a single master and multiple employee nodes. The master node consists of a JobTracker, TaskTracker, NameNode and DataNode. A slave or employee node acts as both a DataNode and TaskTracker, although it is possible to own data-only employee nodes and compute-only employee nodes. These are ordinarily used solely in nonstandard applications. Hadoop requires Java procedure call (RPC) to communicate between one another.

HDFS stores large files (typically within the vary of gigabytes to terabytes) across multiple machines. It achieves reliability by replicating the info across multiple hosts, and hence theoretically doesn't require RAID storage on hosts (but to increase I/O performance some RAID configurations square measure still useful). With the default replication price, 3, knowledge is keep on 3 nodes: 2 on constant rack, and one on a different rack. knowledge nodes can talk to one another to rebalance knowledge, to move copies around, and to stay the replication of data high. HDFS isn't fully POSIX-compliant, because the requirements for a POSIX file-system differ from the target goals for a Hadoop application. The trade-off of not having a fully POSIX-compliant file-system is increased performance for data output and support for non-POSIX operations like Append.The HDFS classification system includes a alleged secondary namenode, which misleads some individuals into thinking that when the primary namenode goes offline, the secondary namenode takes over. In fact, the secondary namenode frequently connects with the primary namenode and builds snapshots of the primary namenode's directory info, which the system then saves to native or remote directories. These checkpointed pictures can be wont to restart a failing primary namenode without having to replay the entire journal of file-system actions, then to edit the log to form associate degree up-to-date directory structure. because the namenode is the single purpose for storage and management of data, it can become a MapReduce could be a programming model for processing large knowledge sets with a parallel, distributed algorithmic program on a cluster. A MapReduce program is composed of a Map procedure that performs filtering and sorting (such as sorting students by forename into queues, one queue for every name) and a Reduce procedure that performs a summary operation (such as investigation the number of students in every queue, yielding name frequencies). The "MapReduce System" (also
called "infrastructure"[1] or "framework") orchestrates by marshalling the distributed servers, running the varied tasks in parallel, managing all communications and knowledge transfers between the varied parts of the system, and providing for redundancy and fault tolerance.

The model is impressed by the map and reduce functions ordinarily used in purposeful programming, their purpose within the MapReduce framework isn't constant as in their original forms. the MapReduce framework are not the actual map and reduce functions, but the scalability and fault-tolerance achieved for a variety of applications by optimizing the execution engine once. As such, a single-threaded implementation of MapReduce will typically not be quicker than a conventional implementation. only when the optimized distributed shuffle operation (which reduces network communication cost) and fault tolerance options of the MapReduce framework inherit play, the utilization of this model is useful. MapReduce libraries are written in many programming languages, with
different levels of improvement. A popular open-source implementation The key contributions of perform the reduction section, on condition that that processor with all the Map all outputs of the map operation that share the same key square measure conferred to constant reducer at constant time, or that the reduction perform is associative. While this process can typically appear inefficient compared to algorithms that square measure additional sequential, MapReduce are often applied to significantly larger datasets than "commodity" servers can handle ' a large server farm can use MapReduce to sort a petabyte of data in barely a few hours. The correspondence additionally offers some possibility of recovering from partial failure of servers or storage throughout the operation: if one clerk or reducer fails, the work are often rescheduled ' assuming the input data continues to be available.Another way to look at MapReduce is as a 5-step parallel and distributed


Prepare the Map() input
1. ' the "MapReduce system" designates Map processors, assignsthe K1 input key price every processor would work on, and provides that processor with all the input data associated with that key value.

2.Run the user-provided Map() code ' Map() is run exactly once for each K1 key price, generating output organized by key values K2.

3."Shuffle" the Map output to the reduce processors ' the MapReduce system designates Reduce processors, assigns the K2 key price every processor would work on, and provides Grid is that the method of receiving knowledge from only one source at a time and although this is additional correct, the tactic isn't as efficient in obtaining info that's needed quicker.

VII. Conclusion

In this paper, we have a tendency to incontestiblethe infrastructure of Parallel ComputingUsing Open Science Grid and additionally the infrastructure of the MapReduce Grid. Also, in this paper we have a tendency to incontestible the difference of Open Science Grid and MapReduce Grid and explained clearlywhich method is additional economical and whichmethod is used additional oftentimes these days.We found that Hadoop on the Grid is challenging owing to the unreliableness of the grid. Also, HOG uses the Open Science Grid, and thus is free for researchers.

We found that with the Open Science Grid we can bear much info in a short span of time and acquire correct results quicker owing to the ability of the grid to gather multiple info quickly. We will continue to judge both the Open Science Grid and also the MapReduce Grid in the future and continue to research ways that to develop both grids.

Source: Essay UK -

About this resource

This Information Technology essay was submitted to us by a student in order to help you with your studies.

Search our content:

  • Download this page
  • Print this page
  • Search again

  • Word count:

    This page has approximately words.



    If you use part of this page in your own work, you need to provide a citation, as follows:

    Essay UK, Parallel Computing using Open Science Grid Compared to MapReduce Grid. Available from: <> [27-05-20].

    More information:

    If you are the original author of this content and no longer wish to have it published on our website then please click on the link below to request removal: