Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories (Q3680272): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Scheduling independent tasks to reduce mean finishing time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4658190 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Exact and Approximate Algorithms for Scheduling Nonidentical Processors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Task Scheduling on a Multiprocessor System with Independent Memories / rank | |||
Normal rank | |||
Latest revision as of 16:50, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories |
scientific article |
Statements
Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories (English)
0 references
1985
0 references
performance
0 references
scheduling independent jobs
0 references
algorithm
0 references
minimum mean-flow time
0 references
