Scheduling multiprocessor tasks on hypercubes

From MaRDI portal

Revision as of 13:40, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1892273

Jump to:navigation, search

zbMath0826.68013MaRDI QIDQ1892273

Maciej Drozdowski

Publication date: 3 July 1995

Published in: Bulletin of the Polish Academy of Sciences. Technical Sciences (Search for Journal in Brave)

zbMATH Keywords

scheduling algorithm scheduling multiprocessor tasks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Information storage and retrieval of data (68P20)

Related Items (4)

Distributed processing of divisible jobs with communication startup costs ⋮ Scheduling parallel jobs to minimize the makespan ⋮ Scheduling multiprocessor tasks on parallel processors with limited availability. ⋮ Scheduling multiprocessor tasks -- An overview

This page was built for publication: Scheduling multiprocessor tasks on hypercubes

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1892273&oldid=14301981"