Future Generation Computer Systems-The International Journal of Escience最新文献

筛选
英文 中文
Correlating node centrality metrics with node resilience in self-healing systems with limited neighbourhood information 在邻域信息有限的自愈系统中,将节点中心度量与节点复原力相关联
IF 6.2 2区 计算机科学
Future Generation Computer Systems-The International Journal of Escience Pub Date : 2024-10-10 DOI: 10.1016/j.future.2024.107553
Arles Rodríguez , Ada Diaconescu , Johan Rodríguez , Jonatan Gómez
{"title":"Correlating node centrality metrics with node resilience in self-healing systems with limited neighbourhood information","authors":"Arles Rodríguez ,&nbsp;Ada Diaconescu ,&nbsp;Johan Rodríguez ,&nbsp;Jonatan Gómez","doi":"10.1016/j.future.2024.107553","DOIUrl":"10.1016/j.future.2024.107553","url":null,"abstract":"<div><div>Resilient systems must self-heal their components and connections to maintain their topology and function when failures occur. This ability becomes essential to many networked and distributed systems, e.g., virtualisation platforms, cloud services, microservice architectures and decentralised algorithms. This paper builds upon a self-healing approach where failed nodes are recreated and reconnected automatically based on topology information, which is maintained within each node’s neighbourhood. The paper proposes two novel contributions. First, it offers a generic method for establishing the minimum size of a network neighbourhood to be known by each node in order to recover the system’s component interconnection topology under a certain probability of node failure. This improves the previous proposal by reducing resource consumption, as only local information is communication and stored. Second, it adopts analysis techniques from complex networks theory to correlate a node’s recovery probability with its closeness centrality within the self-healing system. This allows strengthening a system’s resilience by analysing its topological characteristics and rewiring weakly-connected nodes. These contributions are supported by extensive simulation experiments on different systems with various topological characteristics. Obtained results confirm that nodes which propagate their topology information to more neighbours are more likely to be recovered; while requiring more resources. The proposed contributions can help practitioners to: identify the most fragile nodes in their distributed systems; consider corrective measures by increasing each node’s connectivity; and, establish a suitable compromise between system resilience and costs.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"163 ","pages":"Article 107553"},"PeriodicalIF":6.2,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142533495","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Feature Bagging with Nested Rotations (FBNR) for anomaly detection in multivariate time series 用嵌套旋转(FBNR)对多变量时间序列进行特征袋化异常检测
IF 6.2 2区 计算机科学
Future Generation Computer Systems-The International Journal of Escience Pub Date : 2024-10-09 DOI: 10.1016/j.future.2024.107545
Anastasios Iliopoulos, John Violos, Christos Diou, Iraklis Varlamis
{"title":"Feature Bagging with Nested Rotations (FBNR) for anomaly detection in multivariate time series","authors":"Anastasios Iliopoulos,&nbsp;John Violos,&nbsp;Christos Diou,&nbsp;Iraklis Varlamis","doi":"10.1016/j.future.2024.107545","DOIUrl":"10.1016/j.future.2024.107545","url":null,"abstract":"<div><div>Detecting anomalies in multivariate time series poses a significant challenge across various domains. The infrequent occurrence of anomalies in real-world data, as well as the lack of a large number of annotated samples, makes it a complex task for classification algorithms. Deep Neural Network approaches, based on Long Short-Term Memory (LSTMs), Autoencoders, and Variational Autoencoders (VAEs), among others, prove effective with handling imbalanced data. However, the same does not follow when such algorithms are applied on multivariate time-series, as their performance degrades significantly. Our main hypothesis is that the above is due to anomalies stemming from a small subset of the feature set. To mitigate the above issues in the multivariate setting, we propose forming an ensemble of base models by combining different feature selection and transformation techniques. The proposed processing pipeline includes applying a Feature Bagging techniques on multiple individual models, which considers separate feature subsets for each specific model. These subsets are then partitioned and transformed using multiple nested rotations derived from Principal Component Analysis (PCA). This approach aims to identify anomalies that arise from only a small portion of the feature set while also introduces diversity by transforming the subspaces. Each model provides an anomaly score, which are then aggregated, via an unsupervised decision fusion model. A semi-supervised fusion model was also explored, in which a Logistic Regressor was applied on the individual model outputs. The proposed methodology is evaluated on the Skoltech Anomaly Benchmark (SKAB), containing multivariate time series related to water flow in a closed circuit, as well as the Server Machine Dataset (SMD), which was collected from a large Internet company. The experimental results reveal that the proposed ensemble technique surpasses state-of-the-art algorithms. The unsupervised approach demonstrated a performance improvement of 2% for SKAB and 3% for SMD, compared to the baseline models. In the semi-supervised approach, the proposed method achieved a minimum of 10% improvement in terms of anomaly detection accuracy.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"163 ","pages":"Article 107545"},"PeriodicalIF":6.2,"publicationDate":"2024-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142424405","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Enhancing interconnection network topology for chiplet-based systems: An automated design framework 增强基于芯片组系统的互连网络拓扑结构:自动设计框架
IF 6.2 2区 计算机科学
Future Generation Computer Systems-The International Journal of Escience Pub Date : 2024-10-05 DOI: 10.1016/j.future.2024.107547
Zhipeng Cao , Qinrang Liu , Zhiquan Wan , Wenbo Zhang , Ke Song , Wenbin Liu
{"title":"Enhancing interconnection network topology for chiplet-based systems: An automated design framework","authors":"Zhipeng Cao ,&nbsp;Qinrang Liu ,&nbsp;Zhiquan Wan ,&nbsp;Wenbo Zhang ,&nbsp;Ke Song ,&nbsp;Wenbin Liu","doi":"10.1016/j.future.2024.107547","DOIUrl":"10.1016/j.future.2024.107547","url":null,"abstract":"<div><div>Chiplet-based systems integrate discrete chips on an interposer and use the interconnection network to enable communication between different components. The topology of the interconnection network poses a significant challenge to overall performance, as it can greatly affect both latency and throughput. However, the design of the interconnection network topology is not currently automated. They rely heavily on expert knowledge and fail to deliver optimal performance. To this end, we propose an automated design framework for chiplet interconnection network topology, called CINT-AD. To implement CINT-AD, we first investigate topology-related properties from the perspective of design constraints and structural symmetry. Then, using these properties, we develop an automated framework to generate the topology for interposer interconnections between different chiplets. A deadlock-free routing scheme is proposed for the topologies generated by CINT-AD to fully utilize the resources of the interconnection network. Experimental results show that CINT-AD achieves lower average latency and higher throughput compared to existing state-of-the-art topologies. Furthermore, power and area analysis show that the overhead of CINT-AD is negligible.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"163 ","pages":"Article 107547"},"PeriodicalIF":6.2,"publicationDate":"2024-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142424309","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
QM-ARC: QoS-aware Multi-tier Adaptive Cache Replacement Strategy QM-ARC:QoS 感知多层自适应缓存替换策略
IF 6.2 2区 计算机科学
Future Generation Computer Systems-The International Journal of Escience Pub Date : 2024-10-03 DOI: 10.1016/j.future.2024.107548
Lydia Ait-Oucheggou , Stéphane Rubini , Abdella Battou , Jalil Boukhobza
{"title":"QM-ARC: QoS-aware Multi-tier Adaptive Cache Replacement Strategy","authors":"Lydia Ait-Oucheggou ,&nbsp;Stéphane Rubini ,&nbsp;Abdella Battou ,&nbsp;Jalil Boukhobza","doi":"10.1016/j.future.2024.107548","DOIUrl":"10.1016/j.future.2024.107548","url":null,"abstract":"<div><div>Distributed data-centric systems, such as Named Data Networking, utilize in-network caching to reduce application latency by buffering relevant data in high-speed memory. However, the significant increase in data traffic makes expanding memory capacity prohibitively expensive. To address this challenge, integrating technologies like non-volatile memory and high-speed solid-state drives with dynamic random-access memory can form a cost-effective multi-tier cache system. Additionally, most existing caching policies focus on categorizing data based on recency and frequency, overlooking the varying Quality-of-Service (QoS) requirements of applications and customers—a concept supported by Service Level Agreements in various service delivery models, particularly in Cloud computing. One of the most prominent algorithms in caching policy literature is the Adaptive Replacement Cache (ARC), that uses recency and frequency lists but does not account for QoS. In this paper, we propose a QoS-aware Multi-tier Adaptive Replacement Cache (QM-ARC) policy. QM-ARC extends ARC by incorporating QoS-based priorities between data applications and customers using a penalty concept borrowed from service-level management practices. QM-ARC is generic, applicable to any number of cache tiers, and can accommodate various penalty functions. Furthermore, we introduce a complementary feature for QM-ARC that employs Q-learning to dynamically adjust the sizes of the two ARC lists. Our solution, evaluated using both synthetic and real-world traces, demonstrates significant improvements in QoS compared to state-of-the-art methods by better considering priority levels. Results show that QM-ARC reduces penalties by up to 45% and increases the hit rate for high priority data by up to 84%, without negatively impacting the overall hit rate, which also increases by up to 61%.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"163 ","pages":"Article 107548"},"PeriodicalIF":6.2,"publicationDate":"2024-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142445687","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An intelligent native network slicing security architecture empowered by federated learning 由联合学习赋能的智能本地网络切片安全架构
IF 6.2 2区 计算机科学
Future Generation Computer Systems-The International Journal of Escience Pub Date : 2024-10-02 DOI: 10.1016/j.future.2024.107537
Rodrigo Moreira , Rodolfo S. Villaça , Moisés R.N. Ribeiro , Joberto S.B. Martins , João Henrique Corrêa , Tereza C. Carvalho , Flávio de Oliveira Silva
{"title":"An intelligent native network slicing security architecture empowered by federated learning","authors":"Rodrigo Moreira ,&nbsp;Rodolfo S. Villaça ,&nbsp;Moisés R.N. Ribeiro ,&nbsp;Joberto S.B. Martins ,&nbsp;João Henrique Corrêa ,&nbsp;Tereza C. Carvalho ,&nbsp;Flávio de Oliveira Silva","doi":"10.1016/j.future.2024.107537","DOIUrl":"10.1016/j.future.2024.107537","url":null,"abstract":"<div><div>Network Slicing (NS) has transformed the landscape of resource sharing in networks, offering flexibility to support services and applications with highly variable requirements in areas such as the next-generation 5G/6G mobile networks (NGMN), vehicular networks, industrial Internet of Things (IoT), and verticals. Although significant research and experimentation have driven the development of network slicing, existing architectures often fall short in intrinsic architectural intelligent security capabilities. This paper proposes an architecture-intelligent security mechanism to improve the NS solutions. We idealized a security-native architecture that deploys intelligent microservices as federated agents based on machine learning, providing intra-slice and architectural operation security for the Slicing Future Internet Infrastructures (SFI2) reference architecture. It is noteworthy that federated-learning approaches match the highly distributed modern microservice-based architectures, thus providing a unifying and scalable design choice for NS platforms addressing both service and security. Using ML-Agents and Security Agents, our approach identified Distributed Denial-of-Service (DDoS) and intrusion attacks within the slice using generic and non-intrusive telemetry records, achieving an average accuracy of approximately 95.60% in the network slicing architecture and 99.99% for the deployed slice – intra-slice. This result demonstrates the potential for leveraging architectural operational security and introduces a promising new research direction for network slicing architectures.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"163 ","pages":"Article 107537"},"PeriodicalIF":6.2,"publicationDate":"2024-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142424403","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Guest Editorial for the Special Issue on Federated Learning on the Edge: Challenges and Future Directions 为 "边缘联合学习:挑战与未来方向 "特刊撰写客座社论
IF 6.2 2区 计算机科学
Future Generation Computer Systems-The International Journal of Escience Pub Date : 2024-10-01 DOI: 10.1016/j.future.2024.107546
Francesco Piccialli , Antonella Guzzo , David Camacho
{"title":"Guest Editorial for the Special Issue on Federated Learning on the Edge: Challenges and Future Directions","authors":"Francesco Piccialli ,&nbsp;Antonella Guzzo ,&nbsp;David Camacho","doi":"10.1016/j.future.2024.107546","DOIUrl":"10.1016/j.future.2024.107546","url":null,"abstract":"","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"163 ","pages":"Article 107546"},"PeriodicalIF":6.2,"publicationDate":"2024-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142424406","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
PPAT: An effective scheme ensuring privacy-preserving, accuracy, and trust for worker selection in mobile crowdsensing networks PPAT:一种有效的方案,可确保移动群感网络中工人选择的隐私保护、准确性和信任度
IF 6.2 2区 计算机科学
Future Generation Computer Systems-The International Journal of Escience Pub Date : 2024-09-27 DOI: 10.1016/j.future.2024.107536
Qianxue Guo , Yasha He , Qian Li , Anfeng Liu , Neal N. Xiong , Qian He , Qiang Yang , Shaobo Zhang
{"title":"PPAT: An effective scheme ensuring privacy-preserving, accuracy, and trust for worker selection in mobile crowdsensing networks","authors":"Qianxue Guo ,&nbsp;Yasha He ,&nbsp;Qian Li ,&nbsp;Anfeng Liu ,&nbsp;Neal N. Xiong ,&nbsp;Qian He ,&nbsp;Qiang Yang ,&nbsp;Shaobo Zhang","doi":"10.1016/j.future.2024.107536","DOIUrl":"10.1016/j.future.2024.107536","url":null,"abstract":"<div><div>The data content privacy protection and data accuracy are two important research issues in Mobile Crowdsensing (MCS). However, current researches have rarely been able to satisfy privacy protection as well as data accuracy at the same time, thus hindering the development of MCS. To solve the above issues, for the first time, we have proposed a Privacy Preserving, Accuracy, and Trust data collection scheme (PPAT) for MCS, which can protect the privacy of data content and maintain high accuracy at low-cost style. In PPAT scheme, First, we proposed a scrambled data privacy protection framework which can protect the data of each worker from being known to any third party, which can protect the data privacy of workers. The second, more importantly, we propose a truth value estimation method based on trust computing, which can obtain the truth value more accurately compared to the classic methods under privacy-preserving. In the proposed trust-based truth value calculation, the worker's trust is determined by comparing it with the weight of the trusted worker. Then, the truth value is calculated by the trust of the workers, so that the truth value obtained is more accurate. Through theoretical analysis, it is proved that the proposed PPAT scheme has good worker data content, worker trust, and truth value content privacy protection. Through a large number of simulation experiments, the strategy proposed in this paper has a good ability to protect data content privacy compared to the previous strategy, while improving data quality by 0.5%∼5.7%, and reducing data collection costs by 35.6%∼54.9%.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"163 ","pages":"Article 107536"},"PeriodicalIF":6.2,"publicationDate":"2024-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142445511","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A priority-aware dynamic scheduling algorithm for ensuring data freshness in 5G networks 确保 5G 网络数据新鲜度的优先级感知动态调度算法
IF 6.2 2区 计算机科学
Future Generation Computer Systems-The International Journal of Escience Pub Date : 2024-09-26 DOI: 10.1016/j.future.2024.107542
Beom-Su Kim
{"title":"A priority-aware dynamic scheduling algorithm for ensuring data freshness in 5G networks","authors":"Beom-Su Kim","doi":"10.1016/j.future.2024.107542","DOIUrl":"10.1016/j.future.2024.107542","url":null,"abstract":"<div><div>To ensure the freshness of information in wireless communication systems, a new performance metric named the age of information (AoI) is being adopted in the design of transmission schedulers. However, most AoI schedulers rely on iterative optimization methods, which struggle to adapt to real-time changes, particularly in real-world 5G deployment scenarios, where network conditions are highly dynamic. In addition, they neglect the impact of consecutive AoI deadline violations, which result in prolonged information deficits. To address these limitations, we present a 5G scheduler that can cope with dynamic network conditions, with the aim of minimizing the long-term average AoI under deadline constraints. Specifically, we consider a dense urban massive machine-type communication (mMTC) scenario in which numerous Internet of Things (IoT) devices frequently join or leave the network under time-varying channel conditions. To facilitate real-time adaptation, we develop a per-slot scheduling method that makes locally optimal decisions for each slot without requiring extensive iterations. In addition, we combine the per-slot scheduling method with a priority-rule scheduling algorithm to satisfy the stringent timing requirements of 5G. The simulation results show that the proposed scheduler reduces the average AoI by 10%, deadline violation rate by 40%, and consecutive violation rate by 20% approximately compared with other AoI schedulers.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"163 ","pages":"Article 107542"},"PeriodicalIF":6.2,"publicationDate":"2024-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142359393","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Connected vehicles ecological driving based on deep reinforce learning: Application of Web 3.0 technologies in traffic optimization 基于深度强化学习的车联网生态驾驶:Web 3.0 技术在交通优化中的应用
IF 6.2 2区 计算机科学
Future Generation Computer Systems-The International Journal of Escience Pub Date : 2024-09-26 DOI: 10.1016/j.future.2024.107544
Minghui Ma , Xu Han , Shidong Liang , Yansong Wang , Lan Jiang
{"title":"Connected vehicles ecological driving based on deep reinforce learning: Application of Web 3.0 technologies in traffic optimization","authors":"Minghui Ma ,&nbsp;Xu Han ,&nbsp;Shidong Liang ,&nbsp;Yansong Wang ,&nbsp;Lan Jiang","doi":"10.1016/j.future.2024.107544","DOIUrl":"10.1016/j.future.2024.107544","url":null,"abstract":"<div><div>With the fast development of Web3.0 technology, connected vehicles can now handle and communicate data more safely and effectively. When combined with 5G/6G communication technology, these vehicles can optimize emissions in transportation networks to a greater extent. This study proposed an ecologically car-following model from natural driving data by using deep reinforcement learning under the context of the rapid development of Web 3.0 technologies. Firstly, by utilizing naturalistic driving data, an environment for connected vehicle car-following is created. Secondly, this paper uses SAC (Soft Actor-Critic) deep reinforcement learning algorithm and designs novel reward function based on ecological driving principles and car-following characteristics to reduce fuel consumption and emissions while maintaining safe distance with leading vehicle. Subsequently, the established model is tested, and results indicate that model not only performs well in terms of collision occurrences, Time-to-Collision (TTC), and driving comfort on test set but also achieves reduction of 5.50% in fuel consumption and reductions of 15.04%, 5.63%, and 9.60% in pollutant emissions (NOx, CO, and HC) compared to naturalistic manually driven vehicles.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"163 ","pages":"Article 107544"},"PeriodicalIF":6.2,"publicationDate":"2024-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142533498","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
MITgcm-AD v2: Open source tangent linear and adjoint modeling framework for the oceans and atmosphere enabled by the Automatic Differentiation tool Tapenade MITgcm-AD v2:由自动微分工具 Tapenade 支持的海洋和大气切线及邻接建模开源框架
IF 6.2 2区 计算机科学
Future Generation Computer Systems-The International Journal of Escience Pub Date : 2024-09-23 DOI: 10.1016/j.future.2024.107512
Shreyas Sunil Gaikwad , Sri Hari Krishna Narayanan , Laurent Hascoët , Jean-Michel Campin , Helen Pillar , An Nguyen , Jan Hückelheim , Paul Hovland , Patrick Heimbach
{"title":"MITgcm-AD v2: Open source tangent linear and adjoint modeling framework for the oceans and atmosphere enabled by the Automatic Differentiation tool Tapenade","authors":"Shreyas Sunil Gaikwad ,&nbsp;Sri Hari Krishna Narayanan ,&nbsp;Laurent Hascoët ,&nbsp;Jean-Michel Campin ,&nbsp;Helen Pillar ,&nbsp;An Nguyen ,&nbsp;Jan Hückelheim ,&nbsp;Paul Hovland ,&nbsp;Patrick Heimbach","doi":"10.1016/j.future.2024.107512","DOIUrl":"10.1016/j.future.2024.107512","url":null,"abstract":"<div><div>The Massachusetts Institute of Technology General Circulation Model (MITgcm) is widely used by the climate science community to simulate planetary atmosphere and ocean circulations. A defining feature of the MITgcm is that it has been developed to be compatible with an algorithmic differentiation (AD) tool, TAF, enabling the generation of tangent-linear and adjoint models. These provide gradient information which enables dynamics-based sensitivity and attribution studies, state and parameter estimation, and rigorous uncertainty quantification. Importantly, gradient information is essential for computing comprehensive sensitivities and performing efficient large-scale data assimilation, ensuring that observations collected from satellites and in-situ measuring instruments can be effectively used to optimize a large uncertain control space. As a result, the MITgcm forms the dynamical core of a key data assimilation product employed by the physical oceanography research community: Estimating the Circulation and Climate of the Ocean (ECCO) state estimate. Although MITgcm and ECCO are used extensively within the research community, the AD tool TAF is proprietary and hence inaccessible to a large proportion of these users.</div><div>The new version 2 (MITgcm-AD v2) framework introduced here is based on the source-to-source AD tool Tapenade, which has recently been open-sourced. Another feature of Tapenade is that it stores required variables by default (instead of recomputing them) which simplifies the implementation of efficient, AD-compatible code. The framework has been integrated with the MITgcm model’s main branch and is now freely available.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"163 ","pages":"Article 107512"},"PeriodicalIF":6.2,"publicationDate":"2024-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142359304","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信