Algorithmic species revisited: A program code classification based on array references

@article{Nugteren2013AlgorithmicSR,
  title={Algorithmic species revisited: A program code classification based on array references},
  author={C. Nugteren and Rosilde Corvino and H. Corporaal},
  journal={2013 IEEE 6th International Workshop on Multi-/Many-core Computing Systems (MuCoCoS)},
  year={2013},
  pages={1-8}
}
  • C. Nugteren, Rosilde Corvino, H. Corporaal
  • Published 2013
  • Computer Science
  • 2013 IEEE 6th International Workshop on Multi-/Many-core Computing Systems (MuCoCoS)
  • The shift towards parallel processor architectures has made programming, performance prediction and code generation increasingly challenging. Abstract representations of program code (i.e. classifications) have been introduced to address this challenge. An example is `algorithmic species', a memory access pattern classification of loop nests. It provides an architecture-agnostic structured view of program code, allowing programmers and compilers to take for example parallelisation decisions or… CONTINUE READING
    13 Citations
    Classifying a program code for parallel computing against HPCC
    • Mustafa Basthikodi, W. Ahmed
    • Computer Science
    • 2016 Fourth International Conference on Parallel, Distributed and Grid Computing (PDGC)
    • 2016
    • 1
    Automatic Skeleton-Based Compilation through Integration with an Algorithm Classification
    • 9
    • PDF
    SPINE: From C loop-nests to highly efficient accelerators using Algorithmic Species
    • 2
    Source-to-source translation: Impact on the performance of high level synthesis
    • Meena Belwal, T. Sudarshan
    • Computer Science
    • 2017 International Conference on Computing, Communication and Automation (ICCCA)
    • 2017

    References

    SHOWING 1-10 OF 20 REFERENCES
    Algorithmic Species : Classifying Program Code for Parallel Computing
    • 10
    Automatic Skeleton-Based Compilation through Integration with an Algorithm Classification
    • 9
    • PDF
    Rapidly Selecting Good Compiler Optimizations using Performance Counters
    • 227
    • PDF
    Dataflow analysis of array and scalar references
    • P. Feautrier
    • Computer Science
    • International Journal of Parallel Programming
    • 2005
    • 454
    Hitting the memory wall: implications of the obvious
    • 1,578
    • PDF
    Deriving Efficient Data Movement from Decoupled Access/Execute Specifications
    • 40
    • PDF
    The Omega test: A fast and practical integer programming algorithm for dependence analysis
    • W. Pugh
    • Computer Science
    • Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91)
    • 1991
    • 935
    • PDF
    Beyond Do Loops: Data Transfer Generation with Convex Array Regions
    • 16
    • PDF
    An idiom-finding tool for increasing productivity of accelerators
    • 34
    • PDF