Asian Science Citation Index is committed to provide an authoritative, trusted and significant information by the coverage of the most important and influential journals to meet the needs of the global scientific community.  
ASCI Database
308-Lasani Town,
Sargodha Road,
Faisalabad, Pakistan
Fax: +92-41-8815544
Contact Via Web
Suggest a Journal
 
Articles by S. Benedict
Total Records ( 2 ) for S. Benedict
  S. Benedict and V. Vasudevan
  Grid computing environment involves all kind of resources namely network, software, data, storage and processing units, evolving towards Global computing to solve a single large problem using Grid scheduling architecture that addresses the interaction between the resource management and data management. In this study, two different approaches have been proposed to solve Grid scheduling problem with the objectives of maximizing the Job Completion Ratio (JCR) and minimizing the lateness. A population based evolutionary algorithm that involves evolution during the search process and a single point local search meta-heuristics that work on a single solution called as hybrid evolutionary algorithm. A Threshold Accepting algorithm (TA) proposed is a single point local search meta-heuristic. Proposed algorithms are evaluated and the experimental results are presented for comparison.
  S. Benedict and V.Vasudevan
  The Grid has emerged as an attractive platform to tackle various large scale problems, especially in science and engineering. The objective of this study is to generate an optimal schedule and evaluate heuristic algorithm namely Simulated Annealing (SA) with other scheduling algorithms for data intensive grid applications that maximizes Job completion ratio and minimizes lateness in job completion. The 2 objectives are aimed at achieving simultaneously by the scheduling mechanism. In addition, to create neighborhoods for simulated annealing, 3 Perturbation schemes, viz. pair wise exchange, insertion and random insertion perturbation are used. The results pinpoints that the proposed Simulated Annealing search mechanism performs well compared to other scheduling mechanisms on considering the workflow execution time within the deadline and lateness of individual workflows.
 
 
 
Copyright   |   Desclaimer   |    Privacy Policy   |   Browsers   |   Accessibility