Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Multiprocessor_scheduling> ?p ?o. }
Showing items 1 to 17 of
17
with 100 items per page.
- Multiprocessor_scheduling abstract "In computer science, multiprocessor scheduling is an NP-hard 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. Multiprocessor schedulers have to schedule tasks which may or may not be dependent upon one another.For example take the case of reading user credentials from console, then use it to authenticate, then if authentication is successful display some data on the console.Clearly one task is dependent upon another. This is a clear case of where some kind of ordering exists between the tasks.In fact it is clear that it can be modelled with partial ordering. Then, by definition, the set of tasks constitute a lattice structure.The general multiprocessor scheduling problem is a generalization of the optimization version of the number partitioning problem, which considers the case of partitioning a set of numbers (jobs) into two equal sets (processors).For a review of multiprocessor scheduling problems see chapter "Parallel Tasks" in .".
- Multiprocessor_scheduling wikiPageExternalLink node180.html.
- Multiprocessor_scheduling wikiPageID "3302845".
- Multiprocessor_scheduling wikiPageRevisionID "600448926".
- Multiprocessor_scheduling hasPhotoCollection Multiprocessor_scheduling.
- Multiprocessor_scheduling subject Category:Combinatorial_optimization.
- Multiprocessor_scheduling subject Category:Mathematical_optimization.
- Multiprocessor_scheduling subject Category:Scheduling_(computing).
- Multiprocessor_scheduling comment "In computer science, multiprocessor scheduling is an NP-hard 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.".
- Multiprocessor_scheduling label "Multiprocessor scheduling".
- Multiprocessor_scheduling label "Optymalne szeregowanie zadań dla wielu procesorów".
- Multiprocessor_scheduling sameAs Optymalne_szeregowanie_zadań_dla_wielu_procesorów.
- Multiprocessor_scheduling sameAs m.094d76.
- Multiprocessor_scheduling sameAs Q6935045.
- Multiprocessor_scheduling sameAs Q6935045.
- Multiprocessor_scheduling wasDerivedFrom Multiprocessor_scheduling?oldid=600448926.
- Multiprocessor_scheduling isPrimaryTopicOf Multiprocessor_scheduling.