Affordable Access

Greedy and metaheuristics for the offline scheduling problem in grid computing

Authors
Publisher
DTU Management
Publication Date
Keywords
  • In Grid Computing A Number Of Geographically Distributed Resources Connected Through A Wide Area Net
  • Are Utilized As One Computations Unit
  • The Np-Hard Offline Scheduling Problem In Grid Computing Consists Of Assigning Jobs To Resources In
  • In This Paper
  • Five Greedy Heuristics And Two Metaheuristics For Solving The Offline Scheduling Problem Are Introdu
  • Computationally Evaluating The Heuristics Shows That All Heuristics Find Useful Solutions With A Gap
  • The Metaheuristics Give Better Results Than The Greedy Heuristics
  • But Also Have Larger Time Usage
  • All Heuristics Solve Instances With Up To 2000 Jobs And 1000 Resources
  • Thus The Results Are Useful Both With Respect To Running Times And To Solution Values
Disciplines
  • Computer Science

Abstract

Greedy and metaheuristics for the offline scheduling problem in grid computing - DTU Orbit (04/03/14) Greedy and metaheuristics for the offline scheduling problem in grid computing - DTU Orbit (04/03/14) Gamst, Mette Greedy and metaheuristics for the offline scheduling problem in grid computing Kgs. Lyngby: DTU Management. 2010. (DTU Management 2010; Journal number 2).

There are no comments yet on this publication. Be the first to share your thoughts.