Speeding up Coarse Grain Multicomputer Based Parallel Algorithm for Optimal Binary Search Tree by Minimizing Idleness of Processors - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Speeding up Coarse Grain Multicomputer Based Parallel Algorithm for Optimal Binary Search Tree by Minimizing Idleness of Processors

Vianney Kengne Tchendji
  • Fonction : Auteur
Jean-Frédéric Myoupo
Modélisation, Information et Systèmes - UR UPJV 4290

Domaines

Informatique [cs]

Jean frédéric Myoupo  : Connectez-vous pour contacter le contributeur

https://hal.science/hal-03237640

Soumis le : mercredi 26 mai 2021-17:08:06

Dernière modification le : mercredi 22 mars 2023-11:44:12

Fichier non déposé

Dates et versions

hal-03237640 , version 1 (26-05-2021)

Identifiants

Citer

Vianney Kengne Tchendji, Jean-Frédéric Myoupo. Speeding up Coarse Grain Multicomputer Based Parallel Algorithm for Optimal Binary Search Tree by Minimizing Idleness of Processors. 2017 IEEE 19th International Conference on High Performance Computing and Communications, IEEE 15th International Conference on Smart City and IEEE 3rd International Conference on Data Science and Systems (HPCC/SmartCity/DSS), Dec 2017, Bangkok, Thailand. pp.605-608, ⟨10.1109/HPCC-SmartCity-DSS.2017.79⟩. ⟨hal-03237640⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

U-PICARDIE MIS UPJV-MIS-SDMA
62 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More