Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness (Q1261479): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(93)90054-d / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1986692761 / rank | |||
Normal rank | |||
Latest revision as of 10:49, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness |
scientific article |
Statements
Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness (English)
0 references
17 February 1994
0 references
Parallel processing of jobs by distributed computing systems leads to new and more difficult problems in optimally scheduling a given set of jobs. For different types of problems formal models are described and the optimality problem is transformed to problems of linear programming. Optimality criterion is minimization of the maximal lateness for the different jobs. To obtain polynomially bounded algorithms the number of processors is assumed fixed. The different problems the authors deal with are distinguished by the way these processors are dedicated to the jobs.
0 references
polynomial time algorithms
0 references
parallel processing
0 references
distributed computing systems
0 references
maximal lateness
0 references
0 references
