Open Access   Article Go Back

Performance Evaluation of FCFS and EBF in Linear and Non-Linear Gridlet Size

Neha Bhardwaj1 , Karambir 2 , Ajay Jangra3

Section:Research Paper, Product Type: Journal Paper
Volume-3 , Issue-8 , Page no. 46-49, Aug-2015

Online published on Aug 31, 2015

Copyright © Neha Bhardwaj, Karambir , Ajay Jangra . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Neha Bhardwaj, Karambir , Ajay Jangra, “Performance Evaluation of FCFS and EBF in Linear and Non-Linear Gridlet Size,” International Journal of Computer Sciences and Engineering, Vol.3, Issue.8, pp.46-49, 2015.

MLA Style Citation: Neha Bhardwaj, Karambir , Ajay Jangra "Performance Evaluation of FCFS and EBF in Linear and Non-Linear Gridlet Size." International Journal of Computer Sciences and Engineering 3.8 (2015): 46-49.

APA Style Citation: Neha Bhardwaj, Karambir , Ajay Jangra, (2015). Performance Evaluation of FCFS and EBF in Linear and Non-Linear Gridlet Size. International Journal of Computer Sciences and Engineering, 3(8), 46-49.

BibTex Style Citation:
@article{Bhardwaj_2015,
author = {Neha Bhardwaj, Karambir , Ajay Jangra},
title = {Performance Evaluation of FCFS and EBF in Linear and Non-Linear Gridlet Size},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {8 2015},
volume = {3},
Issue = {8},
month = {8},
year = {2015},
issn = {2347-2693},
pages = {46-49},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=606},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=606
TI - Performance Evaluation of FCFS and EBF in Linear and Non-Linear Gridlet Size
T2 - International Journal of Computer Sciences and Engineering
AU - Neha Bhardwaj, Karambir , Ajay Jangra
PY - 2015
DA - 2015/08/31
PB - IJCSE, Indore, INDIA
SP - 46-49
IS - 8
VL - 3
SN - 2347-2693
ER -

VIEWS PDF XML
2765 2592 downloads 2422 downloads
  
  
           

Abstract

Abstract— Grid computing define as the infrastructure in which hardware as well as software resources situated at different places; shared and uses by the different organizations which coordinated to provide consistent, pervasive and transparent access. Workflow is a set of task or subtasks having dependency among them. Resource allocation is one the objective of grid computing. Efficiently use of resources to run the workflow tasks in order to achieve maximum utilization of resources. Throughput is amount of information process in given amount of time. This parameter is mainly applied to various phenomenon’s of networking systems. In this paper, first come first serve and easy backfilling algorithm performance evaluated on the basis of linear and non-linear increase in gridlet size and compare the result in both the cases. The results indicate that EBF has better resource utilization and throughput than FCFS.

Key-Words / Index Term

Grid Computing; Workflow; Resource Utilization; Throughput

References

[1] D. B. Skillicorn, “Motivating Computational Grids”, 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid, Page No (401–406), May 2002.
[2] F. Xhafa and A. Abraham, "Meta-Heuristics for Grid Scheduling Problems", Metaheuristics for Scheduling in Distributed Computing Environments, Springer-Verlag Berlin Heidelberg, Page No (1-37), 2008.
[3] A. Chakrabarti, “Grid Computing Security”, Springer-Verlag Berlin Heidelberg, 2007.
[4] I. Foster, “The physiology of the grid. Grid computing: making the global infrastructure a reality”, Page No (217–250), 2003.
[5] E. Elmroth and J. Tordsson, “Grid resource brokering algorithms enabling advance reservations and resource selection based on performance predictions”, Future Generation Computer Systems, Volume-24, Issue-6, Page No (585-593), 2008.
[6] I. Foster, C. Kesselman and S. Tuecke, “The anatomy of the grid: Enabling scalable virtual organizations”, International Journal of High Performance Computing Applications, Volume-15, Issue-3,Page No (200-222), 2001.
[7] N. Malarvizhi and V. R. Uthariaraj, “A Broker-Based Approach to Resource Discovery and Selection in Grid Environments”, International Conference on Computer and Electrical Engineering, 2008.
[8] B. Schnizler, “Resource Allocation in the Grid: A Market Engineering Approach”, Univ.-Verl. Karlsruhe, 2007.
[9] Ismail and Leila, "Dynamic Resource Allocation Mechanisms for Grid Computing Environment", 3rd International Conference on Testbeds and Research Infrastructure for the Development of Networks and Communities, Page No (1-5), 2007.
[10] K. Srikala, and S. Ramachandram, "Pre-emptive Resource Allocation in Grid Computing (PRAG)", IEEE Confernce on Information & Communication Technologies, Page No (240-243), 2013.
[11] Krawczyk, Stefan, and K. Bubendorfer, "Grid Resource Allocation: Allocation Mechanisms and Utilisation Patterns", Proceedings of the sixth Australasian workshop on Grid computing and e-research,Volume- 82, Page No (73-81), 2008.
[12] J.C Patni, P. Rastogi, V.K Jayant, M.S. Aswal, “Methods and mechanisms of security in Grid Computing”, 2nd IEEE International Conference on Computing for Sustainable Global Development, Page No (1040-1043), 2015.