scholarly journals A Simplified Access to Grid Resources by Science Gateways

Author(s):  
Marco FARGETTA ◽  
Roberto Barbera ◽  
Riccardo Rotondo
Author(s):  
Jun Zhou ◽  
Karen Smith ◽  
Greg Wilsbacher ◽  
Paul Sagona ◽  
David Reddy ◽  
...  

2007 ◽  
Vol 23 (5) ◽  
pp. 688-701 ◽  
Author(s):  
Gunther Stuer ◽  
Kurt Vanmechelen ◽  
Jan Broeckhove

2007 ◽  
Vol 19 (6) ◽  
pp. 893-904 ◽  
Author(s):  
Von Welch ◽  
Jim Barlow ◽  
James Basney ◽  
Doru Marcusiu ◽  
Nancy Wilkins-Diehr
Keyword(s):  

2013 ◽  
Vol 2013 ◽  
pp. 1-13 ◽  
Author(s):  
Piyush Chauhan ◽  
Nitin

Due to monetary limitation, small organizations cannot afford high end supercomputers to solve highly complex tasks. P2P (peer to peer) grid computing is being used nowadays to break complex task into subtasks in order to solve them on different grid resources. Workflows are used to represent these complex tasks. Finishing such complex task in a P2P grid requires scheduling subtasks of workflow in an optimized manner. Several factors play their part in scheduling decisions. The genetic algorithm is very useful in scheduling DAG (directed acyclic graph) based task. Benefit of a genetic algorithm is that it takes into consideration multiple criteria while scheduling. In this paper, we have proposed a precedence level based genetic algorithm (PLBGSA), which yields schedules for workflows in a decentralized fashion. PLBGSA is compared with existing genetic algorithm based scheduling techniques. Fault tolerance is a desirable trait of a P2P grid scheduling algorithm due to the untrustworthy nature of grid resources. PLBGSA handles faults efficiently.


2009 ◽  
Vol 25 (3) ◽  
pp. 275-280 ◽  
Author(s):  
Ralf Groeper ◽  
Christian Grimm ◽  
Siegfried Makedanz ◽  
Hans Pfeiffenberger ◽  
Wolfgang Ziegler ◽  
...  
Keyword(s):  

2016 ◽  
Vol 14 (4) ◽  
pp. 641-654 ◽  
Author(s):  
Peter Kacsuk ◽  
Gabor Kecskemeti ◽  
Attila Kertesz ◽  
Zsolt Nemeth ◽  
József Kovács ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document