A Study of the Dynamic Characteristics of Software Implementation as an Essential Part for a Universal Description of Algorithm Properties
Citations Over TimeTop 10% of 2016 papers
Abstract
The AlgoWiki open encyclopedia of parallel algorithmic features enables the entire computing community to work together to describe the properties of a multitude of mathematical algorithms and their implementation for various software and hardware platforms. As part of the AlgoWiki project, a structure has been suggested for providing universal descriptions of algorithm properties. Along with the first part of the description, dedicated to machine-independent properties of the algorithms, it is extremely important to study and describe the dynamic characteristics of their software implementation. By studying fundamental algorithm properties such as execution time, performance, data locality, efficiency and scalability, we can give some estimate of the potential implementation quality for a given algorithm on a specific computer and lay the foundation for comparative analysis of various computing platforms with regards to the algorithms presented in AlgoWiki.
Related Papers
- → Scalable Multi-purpose Network Representation for Large Scale Distributed System Simulation(2012)21 cited
- → A Study of Data Locality in YARN(2015)15 cited
- → A Graph-Based Locality-Aware Approach to Scalable Parallel Agent-Based Models of Spatial Interaction(2017)1 cited
- → BEAST: A Buffer Replacement Algorithm Using Spatial and Temporal Locality(2006)1 cited