All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Parallel computing of GAME models

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F08%3A03147065" target="_blank" >RIV/68407700:21230/08:03147065 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Parallel computing of GAME models

  • Original language description

    With recent development of multi-core and multi-processor computers, single thread algorithms use just fraction of possible computing resources available on single personal computer. The trend is to develop distributed versions of algorithms so they canrun on several cores in parallel efficiently using all resources available. In this paper we present an efficient distributed version of the GAME algorithm for inductive models evolution. We also discuss the possibilities and assets of parallelizing evolution of inductive models. Our experimental results demonstrate that for two core processors the distributed GAME algorithm achieves 1.7 speedup in average against the serial version. For eight cores, the speedup is 3.5 in average.

  • Czech name

    Parallel computing of GAME models

  • Czech description

    With recent development of multi-core and multi-processor computers, single thread algorithms use just fraction of possible computing resources available on single personal computer. The trend is to develop distributed versions of algorithms so they canrun on several cores in parallel efficiently using all resources available. In this paper we present an efficient distributed version of the GAME algorithm for inductive models evolution. We also discuss the possibilities and assets of parallelizing evolution of inductive models. Our experimental results demonstrate that for two core processors the distributed GAME algorithm achieves 1.7 speedup in average against the serial version. For eight cores, the speedup is 3.5 in average.

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/KJB201210701" target="_blank" >KJB201210701: Automated Knowledge Extraction</a><br>

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2008

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of the 2nd International Conference on Inductive Modelling

  • ISBN

    978-966-02-4889-2

  • ISSN

  • e-ISSN

  • Number of pages

    4

  • Pages from-to

  • Publisher name

    Ukr. INTEI

  • Place of publication

    Kiev

  • Event location

    Kyjev

  • Event date

    Sep 15, 2008

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article