arXiv CSopen access
A Smallest-Need-First Job Scheduling Framework with Adaptive Optimization of Idle Node Counts for Energy-Efficient HPC Systems
distributed computing, parallel computing, cloud
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 622495
Conceptio Open Knowledge Archive — every document is proof-bundled with source, license, and retrieval metadata.