Repository logo
Communities & Collections
All of DSpace
  • English
  • العربية
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
  1. Home
  2. Browse by Author

Browsing by Author "Beghdad Bey, Kada"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Results Per Page
  • Sort Options
  • No Thumbnail Available
    Item
    CSP Formulation for scheduling independent jobs in Cloud Computing
    (2015) Mataoui, Mhamed; Sebbak, Faouzi; Beghdad Bey, Kada; Benhammadi, Farid
    This paper investigates the use of Constraint Satisfaction Problem formulation to schedule independent jobs in heterogeneous cloud environment. Our formulation provides a basis for computing an optimal Makespan using job and machine reordering heuristics based on Min-min algorithm result. The combination of these heuristics with the weighted constraints allows improving the efficiency of the tree search algorithm to schedule jobs with considerable space search reduction. The proposed CSP model is validated through simulation experiments against clusters of 10 virtual machines. The results demonstrate that our model is able to efficiently allocate resources for jobs with significant performance gains between 18%-40% compared to the Min-Min heuristic results to optimize the Makespan

DSpace software copyright © 2002-2026 LYRASIS

  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify