Farshad Safaei
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Farshad Safaei has a total of 46 co-authors. Here are the top co-authors by number of shared publications:
- Ahmad Khonsari
University of Tehran
4 shared publications - Hossein Bitalebi
Faculty of Computer Science and Engineering, Shahid Beheshti University, Tehran, Iran
3 shared publications - Mehrnaz Moudi
Department of Computer Engineering, University of Torbat Heydarieh, Torbat Heydarieh, Iran
3 shared publications - Mohammad Mahdi Emadi Kouchak
Department of Computer Engineering , Science and Research Branch Tehran
3 shared publications Reza Akbar
Shahid Beheshti Univ, Fac Comp Sci & Engn, GC, Tehran 1983963113, Iran
3 shared publicationsL. Shooshtarian
Shahid Beheshti University G.C.
2 shared publications
Latest Publications
- 5 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Quantifying Heterogeneity of Complex Networks Based on Gintropy and Gini Indices
Characterizing the heterogeneity of complex networks is a fundamental challenge in studying complex networks. Most of the proposed measures are vertex-degree based, falling short of capturing essential characteristic features of heterogeneous networks. The Gini index is an inequality measure extensively used in economics and the social sciences and Gintropy is a newly proposed inequality measure based on the Gini index. In this paper, we use Gintropy to characterize the heterogeneity of complex networks. Our experimental results show that Gintropy can be effectively used as a heterogeneity index. The benefit of adopting Gintropy as a heterogeneity index is that it accurately quantifies the rich club graph as the most heterogeneous graph.
- 5 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Quantifying Heterogeneity of Complex Networks Based on Gintropy and Gini Indices
Characterizing the heterogeneity of complex networks is a fundamental challenge in studying complex networks. Most of the proposed measures are vertex-degree based, falling short of capturing essential characteristic features of heterogeneous networks. The Gini index is an inequality measure extensively used in economics and the social sciences and Gintropy is a newly proposed inequality measure based on the Gini index. In this paper, we use Gintropy to characterize the heterogeneity of complex networks. Our experimental results show that Gintropy can be effectively used as a heterogeneity index. The benefit of adopting Gintropy as a heterogeneity index is that it accurately quantifies the rich club graph as the most heterogeneous graph.
- 30 October 2024
- Published by Elsevier in Sustainable Computing: Informatics and Systems
- Vol. 44
Nearest data processing in GPU
- 30 October 2024
- Published by Elsevier in Sustainable Computing: Informatics and Systems
- Vol. 44
Nearest data processing in GPU
- 24 October 2024
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 68 (3) , 283-305
Error and attack vulnerability of Apollonian networks
This article examines the resilience of different Apollonian network (AN) types—deterministic, random, and evolutionary—to systematic attacks. ANs, members of the family of maximal planar graphs, possess unique properties such as high clustering coefficients, small-world properties, scale-free behavior, Euclidean and space-filling properties, and modularity. These peculiarities require a thorough investigation of their robustness. This work presents a novel approach to studying ANs by implementing evolutionary Apollonian networks (EANs). These EANs include various probabilities distribution functions, including exponential, degenerate, logistic, Pareto, and stable (Cauchy, Lévy, Normal) distributions. To improve the robustness of these networks, we propose a novel edge rewiring mechanism using a genetic algorithm (GA). The GA aims to optimize a combined metric that includes the Flow Robustness of Degree (SFRD), Betweenness (SFRB), and Dangalchev's closeness (SFRC) centralities while preserving the original degree distribution and structural properties of the network. To evaluate the effectiveness of this approach, we use various robustness measures to assess the resilience of different AN types. The results show that SFRB, SFRD, and SFRC effectively rank ANs based on their robustness.
- 24 October 2024
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 68 (3) , 283-305
Error and attack vulnerability of Apollonian networks
This article examines the resilience of different Apollonian network (AN) types—deterministic, random, and evolutionary—to systematic attacks. ANs, members of the family of maximal planar graphs, possess unique properties such as high clustering coefficients, small-world properties, scale-free behavior, Euclidean and space-filling properties, and modularity. These peculiarities require a thorough investigation of their robustness. This work presents a novel approach to studying ANs by implementing evolutionary Apollonian networks (EANs). These EANs include various probabilities distribution functions, including exponential, degenerate, logistic, Pareto, and stable (Cauchy, Lévy, Normal) distributions. To improve the robustness of these networks, we propose a novel edge rewiring mechanism using a genetic algorithm (GA). The GA aims to optimize a combined metric that includes the Flow Robustness of Degree (SFRD), Betweenness (SFRB), and Dangalchev's closeness (SFRC) centralities while preserving the original degree distribution and structural properties of the network. To evaluate the effectiveness of this approach, we use various robustness measures to assess the resilience of different AN types. The results show that SFRB, SFRD, and SFRC effectively rank ANs based on their robustness.
- 24 June 2024
- Published by Springer Nature in Quantum Information Processing
- Vol. 23 (7) , 1-29
QRP: quantum reliability polynomial for stochastic reliability analysis of reversible circuits
- 24 June 2024
- Published by Springer Nature in Quantum Information Processing
- Vol. 23 (7) , 1-29
QRP: quantum reliability polynomial for stochastic reliability analysis of reversible circuits
- Open Access
A Novel Reinforcement Learning Routing Algorithm for Congestion Control in Complex Networks
Despite technological advancements, the significance of interdisciplinary subjects like complex networks has grown. Exploring communication within these networks is crucial, with traffic becoming a key concern due to the expanding population and increased need for connections. Congestion tends to originate in specific network areas but quickly proliferates throughout. Consequently, understanding the transition from a flow-free state to a congested state is vital. Numerous studies have delved into comprehending the emergence and control of congestion in complex networks, falling into three general categories: soft strategies, hard strategies, and resource allocation strategies. This article introduces a routing algorithm leveraging reinforcement learning to address two primary objectives: congestion control and optimizing path length based on the shortest path algorithm, ultimately enhancing network throughput compared to previous methods. Notably, the proposed method proves effective not only in Barabási-Albert scale-free networks but also in other network models such as Watts-Strogatz (small-world) and Erdös-Rényi (random network). Simulation experiment results demonstrate that, across various traffic scenarios and network topologies, the proposed method can enhance efficiency criteria by up to 30% while reducing maximum node congestion by five times.
Open AccessA Novel Reinforcement Learning Routing Algorithm for Congestion Control in Complex Networks
Despite technological advancements, the significance of interdisciplinary subjects like complex networks has grown. Exploring communication within these networks is crucial, with traffic becoming a key concern due to the expanding population and increased need for connections. Congestion tends to originate in specific network areas but quickly proliferates throughout. Consequently, understanding the transition from a flow-free state to a congested state is vital. Numerous studies have delved into comprehending the emergence and control of congestion in complex networks, falling into three general categories: soft strategies, hard strategies, and resource allocation strategies. This article introduces a routing algorithm leveraging reinforcement learning to address two primary objectives: congestion control and optimizing path length based on the shortest path algorithm, ultimately enhancing network throughput compared to previous methods. Notably, the proposed method proves effective not only in Barabási-Albert scale-free networks but also in other network models such as Watts-Strogatz (small-world) and Erdös-Rényi (random network). Simulation experiment results demonstrate that, across various traffic scenarios and network topologies, the proposed method can enhance efficiency criteria by up to 30% while reducing maximum node congestion by five times.
- Open Access
- 25 February 2023
- Published by Association for Computing Machinery (ACM)
- p. 7-13
LATOA: Load-Aware Task Offloading and Adoption in GPU
The emerging new applications, such as data mining and graph analysis, demand extra processing power at the hardware level. Conventional static task scheduling is no longer able to meet the requirements of such complicated applications. This inefficiency is a major concern when the application is supposed to run on a Graphics Processing Unit (GPU), where millions of instructions should be distributed among a limited number of processing cores. A non-optimal scheduling strategy leads to unfair load distribution among the GPU’s processing cores. Consequently, while busy cores are stalled due to the lack of resources, waiting for their data from the main memory, other cores are idle, waiting for busy cores to complete their tasks. Our study introduces LATOA, a Load-Aware Task Offloading and Adoption method that tackles this problem by reducing both stall and idle cycles. LATOA is the first study moving from static to dynamic task scheduling based on run-time information obtained from the Miss Status Holding Register (MSHR) tables. In LATOA, all processing cores are dynamically tagged with critical, neutral, or relaxed states. Then, irregular warps with low locality properties are detected and offloaded from critical cores (going to the stall state) to relaxed ones (going to the idle state). Based on our experiments, LATOA reduces the number of stall cycles on average by 24% and increases the neutral states on average by 38%. In addition, with negligible hardware overhead, LATOA improves system performance and power efficiency on average by 26% and 7%, respectively.
- 25 February 2023
- Published by Association for Computing Machinery (ACM)
- p. 7-13
Open AccessLATOA: Load-Aware Task Offloading and Adoption in GPU
The emerging new applications, such as data mining and graph analysis, demand extra processing power at the hardware level. Conventional static task scheduling is no longer able to meet the requirements of such complicated applications. This inefficiency is a major concern when the application is supposed to run on a Graphics Processing Unit (GPU), where millions of instructions should be distributed among a limited number of processing cores. A non-optimal scheduling strategy leads to unfair load distribution among the GPU’s processing cores. Consequently, while busy cores are stalled due to the lack of resources, waiting for their data from the main memory, other cores are idle, waiting for busy cores to complete their tasks. Our study introduces LATOA, a Load-Aware Task Offloading and Adoption method that tackles this problem by reducing both stall and idle cycles. LATOA is the first study moving from static to dynamic task scheduling based on run-time information obtained from the Miss Status Holding Register (MSHR) tables. In LATOA, all processing cores are dynamically tagged with critical, neutral, or relaxed states. Then, irregular warps with low locality properties are detected and offloaded from critical cores (going to the stall state) to relaxed ones (going to the idle state). Based on our experiments, LATOA reduces the number of stall cycles on average by 24% and increases the neutral states on average by 38%. In addition, with negligible hardware overhead, LATOA improves system performance and power efficiency on average by 26% and 7%, respectively.
- 2 August 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (2) , 1705-1749
Graph entropies-graph energies indices for quantifying network structural irregularity
- 2 August 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (2) , 1705-1749
Graph entropies-graph energies indices for quantifying network structural irregularity
- 6 July 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (1) , 188-213
Criticality-aware priority to accelerate GPU memory access
- 6 July 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (1) , 188-213
Criticality-aware priority to accelerate GPU memory access
- 1 February 2022
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 32 (2) , 021105
Application of hyperbolic geometry of multiplex networks under layer link-based attacks
At present, network science can be considered one of the prosperous scientific fields. The multi-layered network approach is a recent development in this area and focuses on identifying the interactions of several interconnected networks. In this paper, we propose a new method for predicting redundant links for multiplex networks using the similarity criterion based on the hyperbolic distance of the node pairs. We retrieve lost links found on various attack strategies in multiplex networks by predicting redundant links in these networks using the proffered method. We applied the recommended algorithm to real-world multiplex networks, and the numerical simulations show its superiority over other advanced algorithms. During the studies and numerical simulations, the power of the hyperbolic geometry criterion over different standard and current methods based on link prediction used for network retrieval is evident, especially in the case of attacks based on the edge betweenness and random strategies illustrated in the results.
- 1 February 2022
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 32 (2) , 021105
Application of hyperbolic geometry of multiplex networks under layer link-based attacks
At present, network science can be considered one of the prosperous scientific fields. The multi-layered network approach is a recent development in this area and focuses on identifying the interactions of several interconnected networks. In this paper, we propose a new method for predicting redundant links for multiplex networks using the similarity criterion based on the hyperbolic distance of the node pairs. We retrieve lost links found on various attack strategies in multiplex networks by predicting redundant links in these networks using the proffered method. We applied the recommended algorithm to real-world multiplex networks, and the numerical simulations show its superiority over other advanced algorithms. During the studies and numerical simulations, the power of the hyperbolic geometry criterion over different standard and current methods based on link prediction used for network retrieval is evident, especially in the case of attacks based on the edge betweenness and random strategies illustrated in the results.
- 19 January 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 78 (7) , 9741-9781
Efficient methods for computing the reliability polynomials of graphs and complex networks
- 19 January 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 78 (7) , 9741-9781
Efficient methods for computing the reliability polynomials of graphs and complex networks