AlgoWiki: An open encyclopedia of parallel algorithmic features

35Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

The main goal of this project is to formalize the mapping of algorithms onto the architecture of parallel computing systems. The basic idea is that features of algorithms are independent of any computing system. A detailed description of a given algorithm with a special emphasis on its parallel properties is made once, and after that it can be used repeatedly for various implementations of the algorithm on different computing platforms. Machine-dependent, part of this work is devoted to describing features of algorithms implementation for different parallel architectures. The proposed description of algorithms includes many non-trivial features such as: parallel algorithm complexity, resource of parallelism and its properties, features of the informational graph, computational cost of algorithms, data locality analysis as well as analysis of scalability potential, and many others. Descriptions of algorithms form the basis of AlgoWiki, which allows for collaboration with the computing community in order to produce different implementations and achieve improvement.

Cite

CITATION STYLE

APA

Voevodin, V. V., Antonov, A. S., & Dongarra, J. (2015). AlgoWiki: An open encyclopedia of parallel algorithmic features. Supercomputing Frontiers and Innovations, 2(1), 4–18. https://doi.org/10.14529/jsfi150101

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free