Vaccination was a key intervention in controlling the COVID-19 pandemic globally. In early 2021, Norway faced significant regional variations in COVID-19 incidence and prevalence, with large differences in population density, necessitating efficient vaccine allocation to reduce infections and severe outcomes. This study explored alternative vaccination strategies to minimize health outcomes (infections, hospitalizations, ICU admissions, deaths) by varying regions prioritized, extra doses prioritized, and implementation start time. Using two models (individual-based and meta-population), we simulated COVID-19 transmission during the primary vaccination period in Norway, covering the first 7 months of 2021. We investigated alternative strategies to allocate more vaccine doses to regions with a higher force of infection. We also examined the robustness of our results and highlighted potential structural differences between the two models. Our findings suggest that early vaccine prioritization could reduce COVID-19 related health outcomes by 8% to 20% compared to a baseline strategy without geographic prioritization. For minimizing infections, hospitalizations, or ICU admissions, the best strategy was to initially allocate all available vaccine doses to fewer high-risk municipalities, comprising approximately one-fourth of the population. For minimizing deaths, a moderate level of geographic prioritization, with approximately one-third of the population receiving doubled doses, gave the best outcomes by balancing the trade-off between vaccinating younger people in high-risk areas and older people in low-risk areas. The actual strategy implemented in Norway was a two-step moderate level aimed at maintaining the balance and ensuring ethical considerations and public trust. However, it did not offer significant advantages over the baseline strategy without geographic prioritization. Earlier implementation of geographic prioritization could have more effectively addressed the main wave of infections, substantially reducing the national burden of the pandemic.

Scientific computing workflows generate enormous distributed data that is short-lived, yet critical for job completion time. This class of data is called intermediate data. A common way to achieve high data availability is to replicate data. However, an increasing scale of intermediate data generated in modern scientific applications demands new storage techniques to improve storage efficiency. Erasure Codes, as an alternative, can use less storage space while maintaining similar data availability. In this paper, we adopt erasure codes for storing intermediate data and compare its performance with replication. We also use the metric of Mean-Time-To-Data-Loss (MTTDL) to estimate the lifetime of intermediate data. We propose an algorithm to proactively relocate data redundancy from vulnerable machines to reliable ones to improve data availability with some extra network overhead. Furthermore, we propose an algorithm to assign redundancy units of data physically close to each other on the network to reduce the network bandwidth for reconstructing data when it is being accessed.

Failure is inevitable in scientific computing. As scientific applications and facilities increase their scales over the last decades, finding the root cause of a failure can be very complex or at times nearly impossible. Different scientific computing customers have varying availability demands as well as a diverse willingness to pay for availability. In contrast to existing solutions that try to provide higher and higher availability in scientific grids, we propose a model called Task Replication for Userdefined Availability (Trua). Trua provides flexible, user-defined, availability in scientific grids, allowing customers to express their desire for availability to computational providers. Trua differs from existing task replication approaches in two folds. First, it relies on the historic failure information collected from the virtual layer of the scientific grids. The reliability model for the failures can be represented with a bimodal Johnson distribution which is different from any existing distributions. Second, it adopts an anomaly detector to filter out anomalous failures; it additionally adopts novel selection algorithms to mitigate the effects of temporary and spatial correlations of the failures without knowing the root cause of the failures. We apply the Trua on real-world traces collected from the Open Science Grid (OSG). Our results show that the Trua can successfully meet user-defined availability demands.

In this paper, we propose an application-aware intelligent load balancing system for high-throughput, distributed computing, and data-intensive science workflows. We leverage emerging deep learning techniques for time-series modeling to develop an application-aware predictive analytics system for accurately forecasting GridFTP connection loads. Our solution integrates with a major U.S. CMS Tier-2 site; we use a real dataset representing 670 million GridFTP transfer connections measured over 18 months to drive our predictive analytics solution. First, we perform extensive analysis on this dataset and use the connection loads as an example to study the temporal dependencies between various user-roles and workflow memberships. We use the analysis to motivate the design of a gated recurrent unit (GRU) based deep recurrent neural network (RNN) for modeling long-term temporal dependencies and predicting connection loads. We develop a novel application-aware, predictive and intelligent load balancer, APRIL, that effectively integrates application metadata and load forecast information to maximize server utilization. We conduct extensive experiments to evaluate the performance of our deep RNN predictive analytics system and compare it with other approaches such as ARIMA and multi-layer perceptron (MLP) predictors. The results show that our forecasting model, depending on the user-role, performs between 5.88%-92.6% better than the alternatives. We also demonstrate the effectiveness of APRIL by comparing it with the load balancing capabilities of an existing production Linux Virtual Server (LVS) cluster. Our approach improves server utilization, on an average, between 0.5 to 11 times, when compared with its LVS counterpart.

Named Data Networking (NDN) is one of the promising future internet architectures, which focuses on the data rather than its location (IP/host-based system). NDN has several characteristics which facilitate addressing and routing the data: fail-over, in-network caching and load balancing. This makes it useful in areas such as managing scientific data. The CMS experiment on the Large Hadron Collider (LHC) has a data access problem amenable to content-centric networking. CERN Virtual Machine File System (CVMFS) is used by High Energy Physics (HEP) community for worldwide software distribution. CVMFS maintain its data by using content-addressable storage, which makes it suitable for NDN. n this paper, we investigate the possibilities of using a content-centric networking architecture such as NDN on distributing CMS software.

This paper proposes an approach for modeling textured 3D non-rigid models based on Weighted Heat Kernel Signature(W-HKS). As a first contribution, we show how to include photometric information as a weight over the shape manifold, we also propose a novel formulation for heat diffusion over weighted manifolds. As a second contribution we present a new discretization method for the proposed equation using finite element approximation. Finally, the weighted heat kernel signature is used as a shape descriptor. The proposed descriptor encodes both the photometric, and geometric information based on the solution of one equation. We also propose a new method to introduce the scale invariance for the weighted heat kernel signature. The performance is tested on two benchmark datasets. The results have indeed confirmed the high performance of the proposed approach on the textured shape retrieval problem, and showed that the proposed method is useful in coping with different challenges of shape analysis where pure geometric and pure photometric methods fail.

MapReduce is a powerful platform for large-scale data processing. To achieve good performance, a MapReduce scheduler must avoid unnecessary data transmission by enhancing the data locality (placing tasks on nodes that contain their input data). This paper develops a new MapReduce scheduling technique to enhance map task's data locality. We have integrated this technique into Hadoop default FIFO scheduler and Hadoop fair scheduler. To evaluate our technique, we compare not only MapReduce scheduling algorithms with and without our technique but also with an existing data locality enhancement technique (i.e., the delay algorithm developed by Face book). Experimental results show that our technique often leads to the highest data locality rate and the lowest response time for map tasks. Furthermore, unlike the delay algorithm, it does not require an intricate parameter tuning process.