Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length (Q3826356): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1137/0402016 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2078795041 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 20:02, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length |
scientific article |
Statements
Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length (English)
0 references
1989
0 references
multiprocessor scheduling
0 references
nonpreemptive scheduling
0 references
n tasks
0 references
tree- structured precedence relation
0 references
minimum length schedule
0 references
two identical processors
0 references