<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[RSS Feed]]></title><description><![CDATA[RSS Feed]]></description><link>https://ecency.com</link><image><url>https://ecency.com/logo512.png</url><title>RSS Feed</title><link>https://ecency.com</link></image><generator>RSS for Node</generator><lastBuildDate>Sun, 28 Jun 2026 15:36:56 GMT</lastBuildDate><atom:link href="https://ecency.com/@joelmuaka/rss" rel="self" type="application/rss+xml"/><item><title><![CDATA[Message Passing Interface (MPI)]]></title><description><![CDATA[Message Passing Interface (MPI) Le Message Passing Interface est un standard de communication utilisé dans la programmation parallèle pour permettre à des processus distincts de partager des informations]]></description><link>https://ecency.com/@joelmuaka/message-passing-interface-mpi</link><guid isPermaLink="true">https://ecency.com/@joelmuaka/message-passing-interface-mpi</guid><category><![CDATA[hive-114606]]></category><dc:creator><![CDATA[joelmuaka]]></dc:creator><pubDate>Thu, 30 Nov 2023 11:09:57 GMT</pubDate></item><item><title><![CDATA[Practical Byzantine Fault Tolerance (PBFT)]]></title><description><![CDATA[Algorithme de consensus : Practical Byzantine Fault Tolerance (PBFT) Les algorithmes de consensus sont des processus qui permettent de trouver un accord sur une valeur unique de données entre des processus]]></description><link>https://ecency.com/@joelmuaka/practical-byzantine-fault-tolerance-pbft</link><guid isPermaLink="true">https://ecency.com/@joelmuaka/practical-byzantine-fault-tolerance-pbft</guid><category><![CDATA[hive-114606]]></category><dc:creator><![CDATA[joelmuaka]]></dc:creator><pubDate>Tue, 21 Nov 2023 23:57:06 GMT</pubDate><enclosure url="https://i.ecency.com/DQmdscFUTxNwNPPhV5owyGYGEm1BjA9SzSfcBHwBAFcJmPF/41598_2022_8587_fig1_html.png" length="0" type="image/png"/></item></channel></rss>