A COMPARISON STUDY OF HEURISTICS FOR MAPPING PARALLEL ALGORITHMS TO MESSAGE-PASSING MULTIPROCESSORS (Q4820138): 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.1080/10637199508915537 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2134647130 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Assigning dependency graphs onto processor networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3994933 / rank | |||
Normal rank | |||
Latest revision as of 14:30, 7 June 2024
scientific article; zbMATH DE number 2106725
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A COMPARISON STUDY OF HEURISTICS FOR MAPPING PARALLEL ALGORITHMS TO MESSAGE-PASSING MULTIPROCESSORS |
scientific article; zbMATH DE number 2106725 |
Statements
A COMPARISON STUDY OF HEURISTICS FOR MAPPING PARALLEL ALGORITHMS TO MESSAGE-PASSING MULTIPROCESSORS (English)
0 references
6 October 2004
0 references
0 references
