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

{"title":"Towards benchmarking erasure coding schemes in object storage system: A systematic review","authors":"","doi":"10.1016/j.future.2024.107522","DOIUrl":"10.1016/j.future.2024.107522","url":null,"abstract":"<div><p>Erasure Coding (EC) in cloud storage minimizes data replication by reconstructing data from parity fragments. This method enhances data redundancy and efficiency while reducing storage costs and improving fault tolerance. It is more advantageous than replication in Object Storage Systems. EC guarantees data integrity by ensuring lossless transmission of all coded pieces. As data volumes continue to increase rapidly, the time efficiency of the EC method becomes crucial in ensuring optimal system performance. Various variables, including the algorithm employed, data size, number of storage nodes, hardware resources, and network conditions, can influence the speed of EC operations. Although some literature covers various aspects, there is still a research gap in understanding the I/O activities, time efficiency, and fault tolerance of EC in object storage systems. Hence, our research aims to address these challenges in cloud-based object storage systems. We analyze and benchmark the data storage I/O performance of OpenStack Swift, focusing on the time efficiency of the Reed–Solomon (RS) algorithm across two datasets. Additionally, our contributions include benchmarking EC performance in both local and remote testbeds, utilizing the SimEDC simulator for comprehensive efficiency and fault tolerance assessments. Moreover, we create a comprehensive dataset (MCSD-100) for benchmarking and conduct a systematic literature review. Finally, we identify and discuss future opportunities for enhancing EC in cloud-based object storage systems.</p></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":null,"pages":null},"PeriodicalIF":6.2,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142241708","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}

{"title":"Trajectory privacy preservation model based on LSTM-DCGAN","authors":"","doi":"10.1016/j.future.2024.107496","DOIUrl":"10.1016/j.future.2024.107496","url":null,"abstract":"<div><p>Rapid scientific and technological development has brought many innovations to electronic devices, which has greatly improved our daily lives. Nowadays, many apps require the permission to access user location information, causing the concern on user privacy and making it an important task to protect user trajectory information. This paper proposes a novel model called LSTM-DCGAN by integrating LSTM (Long Short-Term Memory Network) with DCGAN (Deep Convolution Generative Adversarial Network). LSTM-DCGAN takes the advantages of LSTM to remember attributes in the trajectory data and the generator and the discriminator in DCGAN to generate and discriminate the trajectories. The proposed model is trained using real user trajectory data and the experimental results are validated from the perspectives of both effectiveness and practicality. Results show that the proposed LSTM-DCGAN model outperforms similar methods in generating synthesized trajectories that are similar to real trajectories in terms of the temporal and the spatial characteristics. In addition, various influencing factors are evaluated to investigate ways of further improving and optimizing the model. Overall, the proposed LSTM-DCGAN model can achieve the balance between the effectiveness of privacy protection and the practicality of user trajectory data and can thus be applied to safeguarding user trajectory information.</p></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":null,"pages":null},"PeriodicalIF":6.2,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142148265","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}

{"title":"Two-stage multi-objective optimization based on knowledge-driven approach: A case study on production and transportation integration","authors":"","doi":"10.1016/j.future.2024.107494","DOIUrl":"10.1016/j.future.2024.107494","url":null,"abstract":"<div><p>The multi-objective evolutionary algorithm (MOEA) has been widely applied to solve various optimization problems. Existing search models based on dominance and decomposition are extensively used in MOEAs to balance convergence and diversity during the search process. In this paper, we propose for the first time a two-stage MOEA based on a knowledge-driven approach (TMOK). The first stage aims to find a rough Pareto front through an improved nondominated sorting algorithm, whereas the second stage incorporates a dynamic learning mechanism into a decomposition-based search model to reasonably allocate computational resources. To further speed up the convergence of TMOK, we present a Markov chain-based TMOK (MTMOK), which can potentially capture variable dependencies. In particular, MTMOK employs a marginal probability distribution of single variables and an <em>N</em>-state Markov chain of two adjacent variables to extract valuable knowledge about the problem solved. Moreover, a simple yet effective local search is embedded into MTMOK to improve solutions through variable neighborhood search procedures. To illustrate the potential of the proposed algorithms, we apply them to solve a distributed production and transportation-integrated problem encountered in many industries. Numerical results and comparisons on 54 test instances with different sizes verify the effectiveness of TMOK and MTMOK. We have made the 54 instances and the source code of our algorithms publicly available to support future research and real-life applications.</p></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":null,"pages":null},"PeriodicalIF":6.2,"publicationDate":"2024-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142232101","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}

{"title":"Software stewardship and advancement of a high-performance computing scientific application: QMCPACK","authors":"","doi":"10.1016/j.future.2024.107502","DOIUrl":"10.1016/j.future.2024.107502","url":null,"abstract":"<div><p>We provide an overview of the software engineering efforts and their impact in QMCPACK, a production-level ab-initio Quantum Monte Carlo open-source code targeting high-performance computing (HPC) systems. Aspects included are: (i) strategic expansion of continuous integration (CI) targeting CPUs, using GitHub Actions own runners, and NVIDIA and AMD GPUs used in pre-exascale systems, (ii) incremental reduction of memory leaks using sanitizers, (iii) incorporation of Docker containers for CI and reproducibility, and (iv) refactoring efforts to improve maintainability, testing coverage, and memory lifetime management. We quantify the value of these improvements by providing metrics to illustrate the shift towards a predictive, rather than reactive, maintenance approach. Our goal, in documenting the impact of these efforts on QMCPACK, is to contribute to the body of knowledge on the importance of research software engineering (RSE) for the stewardship and advancement of community HPC codes to enable scientific discovery at scale.</p></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":null,"pages":null},"PeriodicalIF":6.2,"publicationDate":"2024-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142167924","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}

{"title":"Special Collection on Advances in Quantum Computing: Methods, Algorithms, and Systems","authors":"","doi":"10.1016/j.future.2024.107503","DOIUrl":"10.1016/j.future.2024.107503","url":null,"abstract":"","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":null,"pages":null},"PeriodicalIF":6.2,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142229599","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}

{"title":"CSMD: Container state management for deployment in cloud data centers","authors":"","doi":"10.1016/j.future.2024.107495","DOIUrl":"10.1016/j.future.2024.107495","url":null,"abstract":"<div><p>As the containers are lightweight in resource usage, they are preferred for cloud and edge computing service deployment. Containers serve the requests whenever a user sends a query; however, they remain idle when no user request comes. Again, improving the consolidation ratio of container deployments is essential to ensure fewer servers are used in a cloud data center with an optimal resource balance. To increase the consolidation ratio of a cloud data center, in this paper, we propose a system called <em>Container State Management for Deployment</em> (CSMD) to manage the container states. CSMD uses an algorithm to checkpoint the idle containers so that their resources can be released. The new containers are deployed using the released resources in a server. In addition, CSMD uses an algorithm to check the container status periodically, and the containers are resumed from the checkpoint state when the user requests them. We evaluate CSMD in Amazon Elastic Compute Cloud (Amazon EC2) by performing efficient state management of the containers. The experiments in the Amazon cloud show that the proposed CSMD system is superior to the existing algorithms as the proposed system increases the consolidation ratio of data centers.</p></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":null,"pages":null},"PeriodicalIF":6.2,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142122072","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}

{"title":"VLR-BPP: An intelligent virtual location replacement based bilateral privacy-preserving architecture for edge cloud systems","authors":"","doi":"10.1016/j.future.2024.107488","DOIUrl":"10.1016/j.future.2024.107488","url":null,"abstract":"<div><p>Mobile Crowdsourcing (MCS) has emerged as a significant edge-cloud computing paradigm in which workers perceive data at the network edge and report it to cloud-based computing services for processing, enabling the construction of various applications. Consequently, it is imperative to achieve Bilateral Location Privacy-Preserving (BLPP) to protect the privacy of both Data Requester (DR) and workers, as disclosing location information entails many sensitive details that can result in losses for DR and workers alike. The Local Differential Privacy (LDP) approach is widely employed in Privacy-Preserving (PP) techniques due to its inherent advantages, wherein owners release data with added noise, allowing for proactive customization of privacy strength without relying on any third party. However, the current state of LDP methods presents a dilemma: when privacy protection is strong, introducing excessive location noise can lead to a decrease in the accuracy of task-worker matching, while a high rate of task-worker matching necessitates the compromise of privacy strength. In this paper, an intelligent Virtual Location Replacement based enhanced Bilateral Privacy-Preserving (VLR-BPP) architecture is proposed to improve privacy protection strength and matching accuracy in MCS simultaneously. Within the VLR-BPP architecture, a Bipartite-Graph-based Matrix Completion (BGMC) model is employed to establish the spatiotemporal correlations among data. Then, a Virtual Location Replacement (VLR) strategy is proposed to obfuscate the locations of tasks or workers to their highly correlated virtual location before publishing. Based on VLR, three preemptive location virtualization approaches are introduced: Only Task Location Virtual (OTLV), Only Workers Location Virtual (OWLV), and Both Task and Workers Location Virtual (BTWLV). For workers and DR, Randomized Response (RR) techniques and Random Matrix Multiplication Mechanism (RMM) are used to implement LDP independently. A greedy algorithm is adopted to recruit workers for tasks. In response to the data submitted by workers, BGMC imputation mechanism is utilized to enhance data quality. Finally, simulations based on real-world datasets demonstrate that the performance of our architecture surpasses existing state-of-the-art methods in privacy protection and data collection quality by 18.92∼38.17% and 15.49∼50.77%, respectively.</p></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":null,"pages":null},"PeriodicalIF":6.2,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142241710","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}

{"title":"HashGrid: An optimized architecture for accelerating graph computing on FPGAs","authors":"","doi":"10.1016/j.future.2024.107497","DOIUrl":"10.1016/j.future.2024.107497","url":null,"abstract":"<div><p>Large-scale graph processing poses challenges due to its size and irregular memory access patterns, causing performance degradation in common architectures, such as CPUs and GPUs. Recent research includes accelerating graph processing using Field Programmable Gate Arrays (FPGAs). FPGAs can provide very efficient acceleration thanks to reconfigurable on-chip resources. Although limited, these resources offer a larger design space than CPUs and GPUs.</p><p>We propose an approach in which data are preprocessed in small chunks with an optimized graph partitioning technique for execution on FPGA accelerators. The chunks, located on the host, are streamed directly into a customized memory layer implemented in the FPGA, which is tightly coupled with the processing elements responsible for the graph algorithm execution. This improves application memory access latency, which is crucial in large-sale graph computing performance.</p><p>This work presents a hardware design that, combined with graph partitioning, enables us to achieve high-performance and potentially scalable handling of large graphs (i.e., graphs with millions of vertices and billions of edges in current scenarios) while using popular graph algorithms. The proposed framework accelerates performance 56 times compared with CPU (multicore with 16 logical cores in our reference experiments), 2.5 times and 4 times faster compared to state-of-the-art FPGA and GPU solutions (FPGA has 15 compute units, and GPU reference has 128 streaming-multiprocessors in our experiments), respectively, when using the PageRank algorithm. For the Single-Source-Shortest-Past (SSSP) algorithm, we achieve speedups of up to 65x, 26x, and 18x compared to CPU, GPU, and FPGA works, respectively. Lastly, in the context of the Weakly Connected Component (WCC) algorithm, our framework achieves a speedup of up to 403 times compared to the CPU, 7.4x against the GPU, and it is faster than the FPGA alternatives up to 10.3x.</p></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":null,"pages":null},"PeriodicalIF":6.2,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0167739X24004618/pdfft?md5=7e32540f7a3e9f063a049f49611d08e9&pid=1-s2.0-S0167739X24004618-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142129251","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}

{"title":"Big Data-driven MLOps workflow for annual high-resolution land cover classification models","authors":"","doi":"10.1016/j.future.2024.107499","DOIUrl":"10.1016/j.future.2024.107499","url":null,"abstract":"<div><p>Developing an annual and global high-resolution land cover map is one of the most ambitious tasks in remote sensing, with increasing importance due to the continual rise in validated data and satellite imagery. The success of land cover classification models largely hinges on the data quality, coupled with the application of Big Data techniques and distributed computing. This is essential for efficiently processing the extensive volume of available satellite data. However, maintaining the lifecycle of several annual Machine Learning models presents a complex challenge. The rise of Machine Learning Operations offers an opportunity to automate the maintenance of these models, a feature particularly beneficial in systems that require generating new models each year alongside the continuous integration of validated data. This article details the development of an end-to-end MLOps workflow, meticulously integrating land cover classification models that employ Big Data strategies for processing large-scale, high-resolution spatial data. The workflow is designed within a Kubernetes environment, achieving on-demand auto-scaling, distributed computing, and load balancing. This integration demonstrates the practicality and efficiency of managing and deploying models that treat satellite imagery in an automated, scalable framework, thus marking a significant advancement in remote sensing and MLOps.</p></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":null,"pages":null},"PeriodicalIF":6.2,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0167739X24004631/pdfft?md5=523bb92402be8f64ea38e47ead45e895&pid=1-s2.0-S0167739X24004631-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142129784","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}

{"title":"A multi-level IIOT platform for boosting mines digitalization","authors":"","doi":"10.1016/j.future.2024.107501","DOIUrl":"10.1016/j.future.2024.107501","url":null,"abstract":"<div><p>This paper presents an innovative IIoT multi-level platform tailored to address the specific needs of the mining domain. The platform has been conceptualized and built in the context of the illuMINEation European project. For this purpose, mining specific use cases have been designed such as promoting underground safe areas, performing efficient mining operations or boosting predictive maintenance approaches. Then, specific requirements have been identified and, as a result, the platform has been developed. It consists of four-level layered platform: (1) edge devices layer to manage several sensors deployed in the mines; (2) edge box layer to provide in-mine operations such as filtering, streaming and processing; (3) fog layer which offers an overall perspective of each mine; and (4) cloud layer to centralize the data of all the mines and to provide powerful processing capabilities. In addition, the platform is robustly secured in terms of protecting communications confidentiality and access control and also provides a toolbox aimed at manipulating 3D complex images to obtain operable mine-domain novel user interfaces. Finally, a platform validation is proposed where three different use cases are explained to better show and demonstrate the capabilities of the platform.</p></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":null,"pages":null},"PeriodicalIF":6.2,"publicationDate":"2024-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0167739X24004655/pdfft?md5=6c000f9cf46b5f632c7b9dd3ce2bce46&pid=1-s2.0-S0167739X24004655-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142130205","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}