Facultatea de Matematică şi Informatică / Faculty of Methematics and Informatics

Permanent URI for this communityhttps://msuir.usm.md/handle/123456789/12

Browse

Start date: 2015Subject: search.filters.subject.parallel algorithm

Search Results

Now showing 1 - 4 of 4
  • Thumbnail Image
    Item
    UN ALGORITM PARALEL DE SOLUȚIONARE A JOCURILOR BIMATRICEALE FOLOSIND SISTEMUL MATEMATICA
    (CEP USM, 2020) Hâncu, Boris; Antohi, Ionel
    În articol se face o analiză a posibilităților si stemului de calcul simbolic Matematica pentru elaborarea programelor paralele pe sistemul de calcul paralel de tip DMM (clastere). Este elaborat un algoritm paralel pentru determinarea situațiilor Nash de echilibru în strategii pure pentru jocurile bimatriceale. Pentru acest algoritm sunt elaborate programe paralele utilizând sistemul Matematica și modele de programare MPI, în care se realizează diferite modalități de distribuire a calculelor pe nuclee și diferite modalități de paralelizare la nivel de date. Se realizează o analiză comparativă a timpului de calcul pentru programele elaborate.
  • Thumbnail Image
    Item
    PARALLEL ALGORITHM TO FIND BAYES-NASH SOLUTION
    (Institutul de Matematică şi Informatică al Academiei de Ştiinţe a Moldovei, 2018) Hancu, Boris; Gladei, Anatolie
    We propose to use the new methodology for solving the com- plete and perfect information bimatrix game. To solve the ga- mes of these type we construct the incomplete and imperfect information game generated by the informational extended stra- tegies. Then we construct associated Bayesian game with non- informational extended strategies. For a HPC cluster computing system with shared and distributed memory, we constuct a paral- lel algorithm for computing Bayes-Nash solutions to the bimatrix informational extended games. The complexity and time perfor- mance analysis of the algorithm are provided.
  • Thumbnail Image
    Item
    PARALLEL ALGORITHM TO FIND THE BAYES-NASH SOLUTION IN THE INFORMATIONAL EXTENDED GAME
    (2017) Hancu, Boris
    The Bayes-Nash solutions for informational extended games are discussed. Also the parallel algorithm for mixed system with shared and distributed memory to determine the Bayes-Nash solutions in the bimatrix informational extended games are presented.
  • Thumbnail Image
    Item
    PARALLEL ALGORITHM TO SOLVE THE BIMATRICEAL SUBGAMES GENERATED BY THE INFORMATIONAL EXTENDED STRATEGIES
    (CEP USM, 2017) Gladei, Anatol
    Parallel algorithm for mixed system with shared and distributed memory to solve bimatrix game generated by the informational extended strategies is described.