Scheduling independent 2-processor tasks to minimize schedule length (Q796987): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(84)90006-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1981443073 / rank | |||
Normal rank | |||
Revision as of 17:43, 21 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling independent 2-processor tasks to minimize schedule length |
scientific article |
Statements
Scheduling independent 2-processor tasks to minimize schedule length (English)
0 references
1984
0 references
The problem considered in this paper is the deterministic scheduling of tasks on a set of identical processors. However, the model presented differs from the classical one by the requirement that certain tasks need more than one processor at a time for their processing. In the paper an O(n log n) algorithm is given for scheduling n preemtable tasks on m processors to minimize schedule length, when tasks are divided into two subsets. Each task from the first subset requires one processor at a time, and each task from the second subset requires two processors at a time for its processing.
0 references
multiprocessor tasks
0 references
polynomial-time algorithm
0 references
deterministic scheduling
0 references
identical processors
0 references
