Scheduling chains on uniform processors with communication delays (Q1860371): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jos.121 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1991906005 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Preemptive Scheduling of Uniform Processor Systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling with Deadlines and Loss Functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Almost-Linear Algorithm for Two-Processor Scheduling / rank | |||
Normal rank | |||
Latest revision as of 12:05, 5 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling chains on uniform processors with communication delays |
scientific article |
Statements
Scheduling chains on uniform processors with communication delays (English)
0 references
23 February 2003
0 references
scheduling
0 references
chains
0 references
uniform processors
0 references
communication delays
0 references
