


default search action
Journal of Parallel and Distributed Computing, Volume 165
Volume 165, July 2022
- Emin Nuriyev
, Juan-Antonio Rico-Gallego
, Alexey L. Lastovetsky
:
Model-based selection of optimal MPI broadcast algorithms for multi-core clusters. 1-16
- Othmane Friha
, Mohamed Amine Ferrag
, Lei Shu, Leandros Maglaras
, Kim-Kwang Raymond Choo, Mehdi Nafaa
:
FELIDS: Federated learning-based intrusion detection system for agricultural Internet of Things. 17-31
- Francisco Mendes, Pedro Tomás
, Nuno Roma
:
Decoupling GPGPU voltage-frequency scaling for deep-learning applications. 32-51
- Ketan Sabale
, S. Mini:
Path planning mechanism for mobile anchor-assisted localization in wireless sensor networks. 52-65
- Chen Chen
, Jiange Jiang, Yang Zhou, Ning Lv, Xiaoxu Liang, Shaohua Wan
:
An edge intelligence empowered flooding process prediction using Internet of things in smart city. 66-78
- Farnaz Niknia, Vesal Hakami
, Kiamehr Rezaee:
An SMDP-based approach to thermal-aware task scheduling in NoC-based MPSoC platforms. 79-106
- Zheng Xiao
, Mengyuan Wang, Anthony Theodore Chronopoulos, Jiuchuan Jiang:
A method for reducing cloud service request peaks based on game theory. 107-119
- Germán Castaño, Youssef Faqir-Rhazoui
, Carlos García Sánchez
, Manuel Prieto-Matías:
Evaluation of Intel's DPC++ Compatibility Tool in heterogeneous computing. 120-129 - Elham Monifi, Nezam Mahdavi-Amiri
:
Time-varying dual accelerated gradient ascent: A fast network optimization algorithm. 130-141
- Oumaima El Joubari, Jalel Ben-Othman
, Véronique Vèque
:
A stochastic mobility model for traffic forecasting in urban environments. 142-155
- Da-Ming Zhao
, Jiantao Zhou:
An energy and carbon-aware algorithm for renewable energy usage maximization in distributed cloud data centers. 156-166

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.