Bounding the number of processors and checkpoints needed in time-minimal parallel reversal schedules

DOI10.1007/S00607-004-0075-1zbMath1102.68417OpenAlexW2026287624MaRDI QIDQ1884644

Andrea Walther

Publication date: 5 November 2004

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-004-0075-1

zbMATH Keywords

multi-processor machine

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Reliability, availability, maintenance, inspection in operations research (90B25) Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Approximately uniform online checkpointing with bounded memory

Uses Software

• revolve

This page was built for publication: Bounding the number of processors and checkpoints needed in time-minimal parallel reversal schedules