Extremal scheduling of parallel processing with and without real-time constraints (Q4285638): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:35, 6 February 2024
scientific article; zbMATH DE number 529937
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extremal scheduling of parallel processing with and without real-time constraints |
scientific article; zbMATH DE number 529937 |
Statements
Extremal scheduling of parallel processing with and without real-time constraints (English)
0 references
11 September 1994
0 references
convex ordering
0 references
convex symmetric ordering
0 references
extremal policy
0 references
FCFS
0 references
FIFO
0 references
dateness
0 references
LCFS
0 references
LIFO
0 references
local order preserving
0 references
longest due time first
0 references
parallel processing
0 references
precedence constraints
0 references
optimal scheduling
0 references
real- time constraints
0 references
response time
0 references
Schur convex ordering
0 references
shortest due time first
0 references
stochastic ordering
0 references
throughput
0 references
