Communication-Energy-Aware Scheduling Results for Task Graphs

2.5 MB of raw scheduling results and charts supporting a paper published in the Journal of Parallel and Distributed Computing. The dataset contains two ZIP files: one with CSV files of raw results for different graph structure types, and another with the charts created for the paper. It was authored by Raymond Li and last updated on 2026-05-20.

Use Cases

• Comparing scheduling algorithm performance based on the raw CSV results
• Reproducing or extending the visual analysis from the paper using the provided charts
• Benchmarking new scheduling heuristics against the results for different graph structure types
• Analyzing the trade-offs between communication and energy consumption in task scheduling.

Strengths

• Data is directly tied to a peer-reviewed publication in the Journal of Parallel and Distributed Computing, providing academic context.
• Includes both raw numerical results (CSV files) and derived visualizations (charts), supporting different analysis workflows.
• Input task graphs are sourced from a cited, publicly available dataset (Wang & Sinnen, 2023), enhancing reproducibility.

Limitations

• Column-level documentation is absent; field semantics must be inferred from the associated paper after download.
• Row count and the exact number of graph structures tested are unknown, which may limit suitability assessment.
• Description metadata is limited; actual data quality and completeness require manual inspection after download.

Provenance

Source

Results generated for the paper 'Communication-energy-aware Scheduling of Task Graphs'.

Collection Method

Likely contains simulation outputs from scheduling algorithms applied to task graphs.

Freshness

Last updated 2026-05-20 05:36:57; freshness should be verified.