The growing complexity of Cyber-Physical Systems (CPS) in industrial and manufacturing environments calls for more sophisticated methods to represent heterogeneous assets and processes. In response, hierarchical Digital Twins (DTs)–virtual representations of physical, taxonomy-based processes–offer transparent, layered modeling of diverse data sources. This layered structure fuels renewed interest in intelligent engines capable of extracting meaningful insights and mapping them within the stratified DT ecosystem. While current Intelligent Digital Twin (I-DT) engines based on Deep Learning are computationally demanding, lightweight alternatives like Reservoir Computing (RC) offer efficient solutions with low training costs and fast inference for modeling causal dynamics. This inherent trade-off between performance and practicality underscores the limitations of evaluating I-DTs on accuracy alone. To address this gap, this work introduces a novel metric, Fidelity , designed to provide a comprehensive evaluation. Unlike traditional approaches, Fidelity also accounts for maintainability and deployability, especially in contexts involving time-varying and hierarchical data dynamics. Extensive experiments on two multimodal datasets demonstrate the competitiveness of our RC-based engine and highlight the value of introducing Fidelity for effectively profiling I-DTs. Specifically, our RC-based engine, identified as optimal through a higher Fidelity score, consumes an order of magnitude less energy and achieves up to 39 % higher accuracy (about 10 % increase on average) compared to both canonical and other RC-based alternatives.

Scientific workflows are widely used to automate scientific data analysis and often involve computationally intensive processing of large datasets on compute clusters. As such, their execution tends to be long-running and resource-intensive, resulting in substantial energy consumption and, depending on the energy mix, carbon emissions. Meanwhile, a wealth of carbon-aware computing methods have been proposed, yet little work has focused specifically on scientific workflows, even though they present a substantial opportunity for carbon-aware computing because they are often significantly delay tolerant, efficiently interruptible, highly scalable and widely heterogeneous. In this study, we first exemplify the problem of carbon emissions associated with running scientific workflows, and then show the potential for carbon-aware workflow execution. For this, we estimate the carbon footprint of seven real-world Nextflow workflows executed on different cluster infrastructures using both average and marginal carbon intensity data. Furthermore, we systematically evaluate the impact of carbon-aware temporal shifting, and the pausing and resuming of the workflow. Moreover, we apply resource scaling to workflows and workflow tasks. Finally, we report the potential reduction in overall carbon emissions, with temporal shifting capable of decreasing emissions by over 80%, and resource scaling capable of decreasing emissions by 67%.

Modern high-performance computing (HPC) storage systems use heterogeneous storage technologies organized in tiers to find a compromise between capacity, performance, and cost. In these systems, prefetching is a common technique used to move the right data at the right moment from a slow to a fast tier to improve overall performance while using the costly high-performance tier only when needed. Effective prefetching requires precise knowledge of the application I/O patterns. This knowledge can be extracted through the source code, I/O tracing tools or I/O functions call stacks. State-of-the-art solutions based on the latter approach mainly focus on applications with regular I/O profiles to avoid scalability issues due to the grammar-based techniques used. In this paper, we present an approach based on I/O call stacks that models POSIX and STDIO I/O patterns for both regular and irregular applications, thanks to the use of directed graphs. We present different models usable for prefetching. Our models were used to predict the next I/O call stack on five real HPC applications with a prediction accuracy of up to 98%. Compared to the state-of-the-art Omnisc’IO, they incurred up to 120x lower model overhead (334 ns vs. 45 μ s on LAMMPS) and had a model size 10x to 15x smaller (463 B vs. 7 kB on LQCD). • A graph-based prediction model for HPC I/Os for predictive prefetch. • The overhead in terms of model size and time is much lower than in previous work. • Three new modeling granularities are introduced.

This paper presents a novel approach to the joint optimization of job scheduling and data allocation in grid computing environments. We formulate this joint optimization problem as a mixed integer quadratically constrained program. To tackle the nonlinearity in the constraint, we alternatively fix a subset of decision variables and optimize the remaining ones via Mixed Integer Linear Programming (MILP). We solve the MILP problem at each iteration via an off-the-shelf MILP solver. Our experimental results show that our method significantly outperforms existing heuristic methods, employing either independent optimization or joint optimization strategies. We have also verified the generalization ability of our method over grid environments with various sizes and its high robustness to the algorithm setting.