Due to the containerized deployment environment, microservice orchestration requires coordination of multiple independently running services. this highly decoupled and distributed architecture increases the complexity...
详细信息
ISBN:
(数字)9798350389418
ISBN:
(纸本)9798350389425
Due to the containerized deployment environment, microservice orchestration requires coordination of multiple independently running services. this highly decoupled and distributed architecture increases the complexity of orchestration, and existing static resource allocation strategies are difficult to provide sufficient fault tolerance in the face of sudden failures. therefore, this article introduced a dynamic fault-tolerant scheduling algorithm based on Qlearning, which monitored service status in real-time, predicted potential faults, and dynamically adjusted resource allocation to improve system stability and fault tolerance. Firstly, microservices are modularized using the container orchestration tool Kubernetes, and containerization technology is utilized to encapsulate each service in a separate Pod for operation. Elastic allocation of resources can be achieved through Kubernetes’ automated scheduling mechanism, while efficient service communication and load balancing can be achieved through service mesh; Secondly, a dynamic faulttolerant scheduling algorithm based on Q-learning is introduced, combined with real-time monitoring data of CPU (Central processing Unit), memory, network traffic, etc., deployed in containers, to establish a fault prediction model. Finally, long short-term memory networks can be used to dynamically analyze and predict the load status and historical fault records of each service node, identify potential faults in real time, and automatically adjust resource allocation strategies based on the prediction results, reallocate service loads or start backup instances. the experimental results show that the Q-learningbased dynamic fault-tolerant scheduling algorithm effectively improves the system’s fault tolerance and stability. the analysis of fault recovery time showed that the recovery time for CPU overload, memory leakage, and network congestion was significantly reduced within 48 hours, to 7 seconds, 9 seconds, and 12 seconds, respec
this paper considers the possibility of massively parallel solution to the Lambert problem on graphics processing units. Several of the most popular solution algorithms were used for this problem. Software implementat...
详细信息
A radar warning receiver (RWR) can detect and process radar signals to alarm radar threats in battlefields, and it has become an important sensor in the modern warfare. the multi-task RWR can improve the multi-signal ...
详细信息
We investigate two parallel dedicated machine scheduling with conflict constraints. the problem of minimizing the makespan has been shown to be NP-hard in the strong sense under the assumption that the processing sequ...
详细信息
ISBN:
(数字)9783030926816
ISBN:
(纸本)9783030926816;9783030926809
We investigate two parallel dedicated machine scheduling with conflict constraints. the problem of minimizing the makespan has been shown to be NP-hard in the strong sense under the assumption that the processing sequence of jobs on one machine is given and fixed a priori. the problem without any fixed sequence was previously recognized as weakly NP-hard. In this paper, we first present a 9/5-approximation algorithm for the problem with a fixed sequence. then we show that the tight approximation ratios of the algorithm are 7/4 and 5/3 for two subproblems which remain strongly NP-hard. We also send an improved algorithm with approximation ratio 3 - root 2 approximate to 1.586 for one subproblem. Finally, we prove that the problem without any fixed sequence is actually strongly NP-hard, and design a 5/3-approximation algorithm to solve it.
Sliding window sums are widely used for string indexing, hashing, time series analysis and machine learning. New vector algorithms which utilize the advanced vector extension (AVX) instructions available on modern pro...
详细信息
ISBN:
(纸本)9783030389611;9783030389604
Sliding window sums are widely used for string indexing, hashing, time series analysis and machine learning. New vector algorithms which utilize the advanced vector extension (AVX) instructions available on modern processors, or the parallel compute units on GPUs and FPGAs, would provide a significant performance boost. We develop a generic vectorized sliding sum algorithm with speedup for window size w and number of processors P is O(P/w) for a generic sliding sum. For a sum with commutative operator the speedup is improved to O(P/log(w)). Implementing the algorithm for the bioinformatics application of minimizer based k-mer table generation using AVX instructions, we obtain a speedup of over 5x.
parallel data platforms are recognized as a key solution for processing analytical queries running on extremely large data warehouses (DWs). Deploying a DW on such platforms requires efficient data partitioning and al...
详细信息
ISBN:
(纸本)9783030389611;9783030389604
parallel data platforms are recognized as a key solution for processing analytical queries running on extremely large data warehouses (DWs). Deploying a DW on such platforms requires efficient data partitioning and allocation techniques. Most of these techniques assume a priori knowledge of workload. To deal withtheir evolution, reactive strategies are mainly used. the BI 2.0 requirements have put large batch and ad-hoc user queries at the center. Consequently, reactive-based solutions for deploying a DW in parallel platforms are not sufficient. Autonomous computing has emerged as a paradigm that allows digital objects managing themselves in accordance with high-level guidance by the means of proactive approaches. Being inspired by this paradigm, we propose in this paper, a proactive approach based on a query clustering model to deploying a DW over a parallel platform. the query clustering triggers partitioning and allocation processes by considering only evolved query groups. Intensive experiments were conducted to show the efficiency of our proposal.
People can easily reveal their aggressive remarks on social media platforms using the anonymity it provides. During the COVID-19 pandemic, the usage of social media has been increased several times according to survey...
详细信息
ISBN:
(纸本)9781665439022
People can easily reveal their aggressive remarks on social media platforms using the anonymity it provides. During the COVID-19 pandemic, the usage of social media has been increased several times according to surveys and people are vulnerable to cyber attacks now more than ever. Prevention of cyberbullying needs careful monitoring and identification. Most of the existing works on cyberbullying detection employed traditional machine learning classifiers with handcrafted features, and deep learning-based models have made their way in this domain very recently. Categorizing cyberbullying based on traits is a complex task and needs contextual consideration. In this work, we have proposed a new approach to detect cyberbullying on social media platforms using a neural ensemble method of transformer-based architectures with attention mechanism. Our proposed architecture is trained on one balanced and one imbalanced dataset and outperforms the given ML and DNN baselines by a significant margin in both cases. We achieved an average F1-score of 95.59% for five classes and 90.65% for six classes on the Fine-Grained Cyberbullying Dataset (FGCD), and 87.28% on Twitter parsed dataset. Our in-depth results provide great insights into the effectiveness of transformer-based models in cyberbullying detection and paves the way for future researches to combat this serious online issue. We have released our models and code.(1)
the proceedings contain 5 papers. the topics discussed include: sparse matrix-dense matrix multiplication on heterogeneous CPU+FPGA embedded system;run-time power modeling in embedded GPUs with dynamic voltage and fre...
ISBN:
(纸本)9781450375450
the proceedings contain 5 papers. the topics discussed include: sparse matrix-dense matrix multiplication on heterogeneous CPU+FPGA embedded system;run-time power modeling in embedded GPUs with dynamic voltage and frequency scaling;fault-tolerant online scheduling algorithms for CubeSats;an OpenMP parallel genetic algorithm for design space exploration of heterogeneous multi-processor embedded systems;and automated precision tuning in activity classification systems: a case study.
Heterogeneous multiprocessor platforms are becoming widespread in the embedded system domain, mainly for the opportunity to improve timing performance and to minimize energy/power consumption and costs. therefore, whe...
详细信息
the solution of large scale eigenvalue problems (EVP) is often the computational bottleneck for many scientific and engineering applications. Traditional eigensolvers, such as direct (e.g. ScaLAPACK) and Krylov subspa...
详细信息
ISBN:
(纸本)9781450388160
the solution of large scale eigenvalue problems (EVP) is often the computational bottleneck for many scientific and engineering applications. Traditional eigensolvers, such as direct (e.g. ScaLAPACK) and Krylov subspace (e.g. Lanczos) methods, have struggled in achieving high scalability on large computing resources due to communication and synchronization bottlenecks which are inherent in their implementation. this includes a difficulty in developing well-performing ports of these algorithms to architectures which rely on the use of accelerators, such as graphics processing units (GPU), for the majority of their floating point operations. Recently, there has been significant research into the development of eigensolvers based on spectrum slicing, in particular shift-invert spectrum slicing, to alleviate the communication and synchronization bottlenecks of traditional eigensolvers. In general, spectrum slicing trades the global EVP for many smaller, independent EVPs which may be combined to assemble some desired subset of the entire eigenspectrum. the result is a method which utilizes more floating point operations than traditional eigensolvers, but in a way which allows for the expression of massive concurrency leading to an overall improvement in time-to-solution on large computing resources. In this work, we will examine the performance of parallel shift-invert spectrum slicing on modern GPU clusters using state-of-the-art linear algebra software.
暂无评论