This paper deals with a systematic literature review done as a part of the research methodology course. The paper covers the review process of various literatures pertaining to the research area \u2018grid computing\u2019. It evaluates articles, journals and other information sources based on the contents of the research in the area of grid computing. It highlights the importance of the review process; also it presents some of the drawbacks that were seen in the literature review process. Based on the literature review, a topic for further research work is been formulated.

Grid Computing is a technique to perform a single task with the help of a number of computers. It is a way to implement distributed computing. Grid computing is also known as computational grids. Large computing power is needed to solve large and critical computational problems like weather forecasting, DNA analysis, data mining etc. Grid computing is a cheaper solution to solve these sorts of resource hungry tasks.

For the review process in the area of grid computing, we distributed all the tasks. All of the group members tried hard to perform well in this review. The work distribution is shown below in the Table 1.

Search papers, review papers, prepare review

Search papers, review papers, prepare review

The main focus of the review process was to get a clear idea about the current knowledge and trends about a research area. We knew about these by going through previous and current research works done in the area. The whole process was conducted in several steps, selecting research area, identifying research questions, defining search strategies, evaluation search results, reviewing selected literatures and ending up with an objective to contribute in the research are.

In the process of selecting the area of research, we found out that grid computing as an emerging topic. So, we decided to select it as our main area of research. After gathering information, collecting papers and with the help of previous knowledge in grid computing, we finally concluded to narrow down the study and work, on with task scheduling in small scale grid computing. Our area of study can be shown as the figure Fig 1.

Our first search process started with some initial general questions. Later, we revised he questions according to the previous results and at last came up with the final set of some specific questions.

We searched in the library system of BTH to search appropriate database. We prioritized the databases according to the relevancy with the research area. As our research field belongs to the computer science area, so we choose the databases with technical contents. We also used our previous experience to select the databases. At last we choose following technical databases from the list of databases relative to computer science.

According to our queries, we defined our search keywords. We used several combinations and orders of these keywords to search through all chosen databases. Our chosen keywords and their combinations are given below-

We used the combination of the keywords to search through the databases we had selected. As a result we got articles related to our research questions. Grid computing is not an old topic of research and most of the exciting breakthroughs are been achieved in the recent years. On the other hand, we were searching for better algorithms in task scheduling. So, we gave more priority on recent researches. Considering all these factors, we excluded all the papers before the year 2000. The ration of search results can be shown as a diagram in Fig 2.

We went through the titles and the abstracts of the searched articles and papers in the first phase. Then we choose the relevant papers and analyzed those to get answers of our research questions.

We selected our papers in two sets, containing information about small scale and task scheduling in grid computing. Three articles talk about small scale grid computing which is relevant to our study. Other papers concern about task scheduling techniques and algorithms. These papers were published between the years 2003 to 2008.

In the last phase of the paper and article selection, we assessed the selected articles and tried to evaluate their contents according to their introductions, used models, analyses and conclusions. The ratios of finally selected papers and articles can be shown as a diagram in Fig 3.

[1] Resource Management and
Task Scheduling in Grid
Computing

[3] A Dynamic Clustering
Heuristic for Jobs Scheduling
on Grid Computing Systems

[9] Development of a small-scale office grid computing system for electromagnetic

[6] A Pure Peer-To-Peer Desktop Grid framework with efficient fault tolerance

[5] An adaptive decentralized
scheduling mechanism for
peer-to-peer Desktop Grids

[7] An Adaptive Scheduling
Algorithm for Scheduling
Tasks in Computational Grid

[8] An Evolution-Based Dynamic Scheduling Algorithm in Grid Computing Environment

We studied the articles selected by us through the iterative process and tried to summarize those. We first discussed about some algorithms proposed from 2003 to 2008. We ended our synthesis by discussing some researches, done in the area of small scale grid computing.

In computational grid, job scheduling is an important issue. In the gridding system, different components are connected through the network and an efficient scheduling algorithm is needed to locate those scattered resources and distribute the task among the appropriate components.

Junzhou Luo et. al., 2003 [1] tells about Trust based scheduling algorithm which is grounded on 2-phase task scheduling scheme. This algorithm takes into account the trust along with the other properties of 2-phase scheduling algorithm.

Two phase task based scheduling algorithm (2PTBSA) is efficient then 2-phase algorithm. It can reduce the actual response time of a computing task by eliminating unstable nodes and LANs in the middle of a computation.

Zhihong XU et. al., 2003, [2] tells how the ant-based algorithm can be used to schedule tasks which dynamically assumes the current state of the resources and schedule tasks judging the state e.g. node down or up, execution time, transmission time.

The authors conducted experiment on the simulation process for 10 resources and 20 clients and several weights of tasks. They got the result of 95% success proportion to choose the best solution to a problem.