Why is it Hard to Describe Properties of Algorithms?

Vladimir Voevodin, Alexander Antonov, Jack Dongarra

Research output: Contribution to journalConference articlepeer-review

10 Scopus citations

Abstract

Everyone knows what parallel algorithms are. However, as you start describing properties of real algorithms, you realize that creating a complete description of an algorithm is not a challenge, it is a large series of challenges! In the paper we will try to explain our position.

Original languageEnglish
Pages (from-to)4-7
Number of pages4
JournalProcedia Computer Science
Volume101
DOIs
StatePublished - 2016
Externally publishedYes
Event5th International Young Scientist Conference on Computational Science,YSC 2016 - Krakow , Poland
Duration: Oct 26 2016Oct 28 2016

Funding

This project is carried out in Moscow State University with the financial support of the Russian Science Foundation, Agreement No 14-11-00190.

FundersFunder number
Russian Science Foundation14-11-00190

    Keywords

    • AlgoWiki
    • algorithm properties
    • dynamic characteristics
    • information structure
    • parallel computing
    • supercomputer

    Fingerprint

    Dive into the research topics of 'Why is it Hard to Describe Properties of Algorithms?'. Together they form a unique fingerprint.

    Cite this