Task scheduling in multi-layer CLOS topology networks based on shortest path (Q6955056)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8067841
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Task scheduling in multi-layer CLOS topology networks based on shortest path |
scientific article; zbMATH DE number 8067841 |
Statements
Task scheduling in multi-layer CLOS topology networks based on shortest path (English)
0 references
23 July 2025
0 references
CLOS network
0 references
AI large model
0 references
Kruskal
0 references
shortest path
0 references
