Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Patents
  4. Greedy Scheduling for Distributed Computing Clusters
 
patent

Greedy Scheduling for Distributed Computing Clusters

Karbasi, Amin  
•
Vojnovic, Milan
2011

Allocating tasks to machines in computing clusters is described. In an embodiment a set of tasks associated with a job are received at a scheduler. In an embodiment an index can be computed for each combination of tasks and processors and stored in a lookup table. In an example the index may be include an indication of the preference for the task to be processed on a particular processor, an indication of a waiting time for the task to be processed and an indication of how other tasks being processed in the computing cluster may be penalized by assigning a task to a particular processor. In an embodiment tasks are assigned to a processor by accessing the lookup table, selecting a task for processing using the index and scheduling the selected task for allocation to a processor.

  • Details
  • Metrics
Type
patent
EPO Family ID

47007382

Author(s)
Karbasi, Amin  
Vojnovic, Milan
Subjects

Cloud computing

•

task scheduling

Note

Alternative title(s) : (en) Allocating tasks to machines in computing clusters

EPFL units
ISC  
DOICountry codeKind codeDate issued

US8695009

US

B2

2014-04-08

US2012266176

US

A1

2012-10-18

Available on Infoscience
October 27, 2011
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/72043
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés