Multiprocessor scheduling
From Wikipedia, the free encyclopedia
In computer science, multiprocessor scheduling is an NP-Complete optimization problem. The problem statement is: "Given a set J of jobs where job ji has length li and a number of processors m, what is the minimum possible time required to schedule all jobs in J on m processors such that none overlap?" The applications of this problem are numerous, but are, as suggested by the name of the problem, most strongly associated with the scheduling of computational tasks in a multiprocessor environment.
[edit] Sources
 |
This computer-related article is a stub. You can help Wikipedia by expanding it. |
