Pith. sign in

REVIEW 1 cited by

Predicting the Performance of Scientific Workflow Tasks for Cluster Resource Management: An Overview of the State of the Art

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2504.20867 v1 pith:2A6EQOOO submitted 2025-04-29 cs.DC

classification cs.DC
keywords workflowperformancetaskclusterestimatespredictionresourcemanagement
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Scientific workflow management systems support large-scale data analysis on cluster infrastructures. For this, they interact with resource managers which schedule workflow tasks onto cluster nodes. In addition to workflow task descriptions, resource managers rely on task performance estimates such as main memory consumption and runtime to efficiently manage cluster resources. Such performance estimates should be automated, as user-based task performance estimates are error-prone. In this book chapter, we describe key characteristics of methods for workflow task runtime and memory prediction, provide an overview and a detailed comparison of state-of-the-art methods from the literature, and discuss how workflow task performance prediction is useful for scheduling, energy-efficient and carbon-aware computing, and cost prediction.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Carbon-Aware Workflow Scheduling with Fixed Mapping and Deadline Constraint

    cs.DC 2025-07 conditional novelty 6.0 of 10

    With fixed task mapping and ordering, minimizing carbon cost by shifting task start times is polynomial for one processor, NP-hard for multiple, and a new greedy+local-search framework approaches the ILP optimum.

Pith tools