On the load imbalance problem of I/O forwarding layer in HPC systems

2017 ◽  
Author(s):  
Jie Yu ◽  
Guangming Liu ◽  
Wenrui Dong ◽  
Xiaoyong Li ◽  
Jian Zhang ◽  
...  
Keyword(s):  
Imbalance Problem ◽  
Load Imbalance

scholarly journals A GPU-based solution for fast calculation of the betweenness centrality in large weighted networks

2017 ◽  
Vol 3 ◽  
pp. e140 ◽  
Author(s):  
Rui Fan ◽  
Ke Xu ◽  
Jichang Zhao
Keyword(s):  
Betweenness Centrality ◽  
Network Science ◽  
Computational Cost ◽  
Dijkstra Algorithm ◽  
Weighted Networks ◽  
Imbalance Problem ◽  
Load Imbalance ◽  
Fast Solution ◽  
High Computational Cost

Betweenness, a widely employed centrality measure in network science, is a decent proxy for investigating network loads and rankings. However, its extremely high computational cost greatly hinders its applicability in large networks. Although several parallel algorithms have been presented to reduce its calculation cost for unweighted networks, a fast solution for weighted networks, which are commonly encountered in many realistic applications, is still lacking. In this study, we develop an efficient parallel GPU-based approach to boost the calculation of the betweenness centrality (BC) for large weighted networks. We parallelize the traditional Dijkstra algorithm by selecting more than one frontier vertex each time and then inspecting the frontier vertices simultaneously. By combining the parallel SSSP algorithm with the parallel BC framework, our GPU-based betweenness algorithm achieves much better performance than its CPU counterparts. Moreover, to further improve performance, we integrate the work-efficient strategy, and to address the load-imbalance problem, we introduce a warp-centric technique, which assigns many threads rather than one to a single frontier vertex. Experiments on both realistic and synthetic networks demonstrate the efficiency of our solution, which achieves 2.9× to 8.44× speedups over the parallel CPU implementation. Our algorithm is open-source and free to the community; it is publicly available through https://dx.doi.org/10.6084/m9.figshare.4542405. Considering the pervasive deployment and declining price of GPUs in personal computers and servers, our solution will offer unprecedented opportunities for exploring betweenness-related problems and will motivate follow-up efforts in network science.

scholarly journals Reducing Call Blocks in Cellular Network with Non-Uniform Traffic Conditions

2014 ◽  
Vol 39 (4) ◽  
pp. 301-318
Author(s):  
Abhijit Sharma ◽  
Pratik Sharma ◽  
Rituparna Chaki ◽  
Uma Bhattacharya
Keyword(s):  
Blocking Probability ◽  
Heavy Traffic ◽  
Cost Effective ◽  
Call Blocking ◽  
Traffic Demand ◽  
Call Blocking Probability ◽  
Traffic Conditions ◽  
Imbalance Problem ◽  
Load Imbalance ◽  
Consequent Reduction

Abstract In cellular networks, while the motivation behind all basic channel assignment strategies is the better utilization of the available frequency spectrum with the consequent reduction of the call blocking probability in each cell, very few of them deal with the problem of non-uniform traffic demand in different cells which may lead to a gross imbalance in the system performance. Mobile users in hot cells (the cells with heavy traffic loads) may suffer from low throughput due to the load imbalance problem. In this paper, we propose a cost effective and simple load balancing scheme that can effectively reduce the overall call blocking. A common set of channels are determined dynamically which can be used simultaneously in all the cells. Cell tiers with different radii are used to cope with the interference introduced by using same set of channels simultaneously in all cells. The performance of the proposed scheme is presented in terms of call blocking probability and channel utilization. Simulation results show that the proposed scheme can reduce the call blocking significantly in highly congested cell.

scholarly journals Detection of Myocardial Infarction Using ECG and Multi-Scale Feature Concatenate

Sensors ◽  
2021 ◽  
Vol 21 (5) ◽  
pp. 1906
Author(s):  
Jia-Zheng Jian ◽  
Tzong-Rong Ger ◽  
Han-Hua Lai ◽  
Chi-Ming Ku ◽  
Chiung-An Chen ◽  
...  
Keyword(s):  
Myocardial Infarction ◽  
Network Structure ◽  
Class Imbalance ◽  
Class Imbalance Problem ◽  
Multi Scale ◽  
Imbalance Problem ◽  
Average Accuracy ◽  
Significant Difference ◽  
Electrocardiogram Ecg

Diverse computer-aided diagnosis systems based on convolutional neural networks were applied to automate the detection of myocardial infarction (MI) found in electrocardiogram (ECG) for early diagnosis and prevention. However, issues, particularly overfitting and underfitting, were not being taken into account. In other words, it is unclear whether the network structure is too simple or complex. Toward this end, the proposed models were developed by starting with the simplest structure: a multi-lead features-concatenate narrow network (N-Net) in which only two convolutional layers were included in each lead branch. Additionally, multi-scale features-concatenate networks (MSN-Net) were also implemented where larger features were being extracted through pooling the signals. The best structure was obtained via tuning both the number of filters in the convolutional layers and the number of inputting signal scales. As a result, the N-Net reached a 95.76% accuracy in the MI detection task, whereas the MSN-Net reached an accuracy of 61.82% in the MI locating task. Both networks give a higher average accuracy and a significant difference of p < 0.001 evaluated by the U test compared with the state-of-the-art. The models are also smaller in size thus are suitable to fit in wearable devices for offline monitoring. In conclusion, testing throughout the simple and complex network structure is indispensable. However, the way of dealing with the class imbalance problem and the quality of the extracted features are yet to be discussed.

scholarly journals A Novel Focal Phi Loss for Power Line Segmentation with Auxiliary Classifier U-Net

Sensors ◽  
2021 ◽  
Vol 21 (8) ◽  
pp. 2803
Author(s):  
Rabeea Jaffari ◽  
Manzoor Ahmed Hashmani ◽  
Constantino Carlos Reyes-Aldasoro
Keyword(s):  
Loss Function ◽  
Class Imbalance ◽  
Power Line ◽  
Aerial Images ◽  
Class Imbalance Problem ◽  
Trade Off ◽  
Urban Scenes ◽  
Imbalance Problem ◽  
A Minor ◽  
Evaluation Parameters

The segmentation of power lines (PLs) from aerial images is a crucial task for the safe navigation of unmanned aerial vehicles (UAVs) operating at low altitudes. Despite the advances in deep learning-based approaches for PL segmentation, these models are still vulnerable to the class imbalance present in the data. The PLs occupy only a minimal portion (1–5%) of the aerial images as compared to the background region (95–99%). Generally, this class imbalance problem is addressed via the use of PL-specific detectors in conjunction with the popular class balanced cross entropy (BBCE) loss function. However, these PL-specific detectors do not work outside their application areas and a BBCE loss requires hyperparameter tuning for class-wise weights, which is not trivial. Moreover, the BBCE loss results in low dice scores and precision values and thus, fails to achieve an optimal trade-off between dice scores, model accuracy, and precision–recall values. In this work, we propose a generalized focal loss function based on the Matthews correlation coefficient (MCC) or the Phi coefficient to address the class imbalance problem in PL segmentation while utilizing a generic deep segmentation architecture. We evaluate our loss function by improving the vanilla U-Net model with an additional convolutional auxiliary classifier head (ACU-Net) for better learning and faster model convergence. The evaluation of two PL datasets, namely the Mendeley Power Line Dataset and the Power Line Dataset of Urban Scenes (PLDU), where PLs occupy around 1% and 2% of the aerial images area, respectively, reveal that our proposed loss function outperforms the popular BBCE loss by 16% in PL dice scores on both the datasets, 19% in precision and false detection rate (FDR) values for the Mendeley PL dataset and 15% in precision and FDR values for the PLDU with a minor degradation in the accuracy and recall values. Moreover, our proposed ACU-Net outperforms the baseline vanilla U-Net for the characteristic evaluation parameters in the range of 1–10% for both the PL datasets. Thus, our proposed loss function with ACU-Net achieves an optimal trade-off for the characteristic evaluation parameters without any bells and whistles. Our code is available at Github.

scholarly journals Hybridization of ring theory-based evolutionary algorithm and particle swarm optimization to solve class imbalance problem

2021 ◽  
Author(s):  
Sayan Surya Shaw ◽  
Shameem Ahmed ◽  
Samir Malakar ◽  
Laura Garcia-Hernandez ◽  
Ajith Abraham ◽  
...  
Keyword(s):  
Particle Swarm Optimization ◽  
Real Life ◽  
Class Imbalance ◽  
Ring Theory ◽  
Class Imbalance Problem ◽  
Minority Class ◽  
Swarm Optimization ◽  
Imbalance Problem ◽  
Representative Samples ◽  
Selection Of

AbstractMany real-life datasets are imbalanced in nature, which implies that the number of samples present in one class (minority class) is exceptionally less compared to the number of samples found in the other class (majority class). Hence, if we directly fit these datasets to a standard classifier for training, then it often overlooks the minority class samples while estimating class separating hyperplane(s) and as a result of that it missclassifies the minority class samples. To solve this problem, over the years, many researchers have followed different approaches. However the selection of the true representative samples from the majority class is still considered as an open research problem. A better solution for this problem would be helpful in many applications like fraud detection, disease prediction and text classification. Also, the recent studies show that it needs not only analyzing disproportion between classes, but also other difficulties rooted in the nature of different data and thereby it needs more flexible, self-adaptable, computationally efficient and real-time method for selection of majority class samples without loosing much of important data from it. Keeping this fact in mind, we have proposed a hybrid model constituting Particle Swarm Optimization (PSO), a popular swarm intelligence-based meta-heuristic algorithm, and Ring Theory (RT)-based Evolutionary Algorithm (RTEA), a recently proposed physics-based meta-heuristic algorithm. We have named the algorithm as RT-based PSO or in short RTPSO. RTPSO can select the most representative samples from the majority class as it takes advantage of the efficient exploration and the exploitation phases of its parent algorithms for strengthening the search process. We have used AdaBoost classifier to observe the final classification results of our model. The effectiveness of our proposed method has been evaluated on 15 standard real-life datasets having low to extreme imbalance ratio. The performance of the RTPSO has been compared with PSO, RTEA and other standard undersampling methods. The obtained results demonstrate the superiority of RTPSO over state-of-the-art class imbalance problem-solvers considered here for comparison. The source code of this work is available in https://github.com/Sayansurya/RTPSO_Class_imbalance.

Sign in / Sign up

Export Citation Format

Share Document