A Novel Algorithmic Approach for an Automatic Data Placement for NUMA Based Design
Explore this paper's citation graph
Summary
This proposed research tries to investigate, evolve and analyze one of the key design issues for NUMA machine and proposes an innovative solution to address this key design issue under investigation in the current phase of the work.
- Type
- article
- Published
- 2016-03-01
- Cited by
- 0
- References
- 9
- Access
- Open access
- OpenAlex
- https://openalex.org/W2329452785
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:61523409
Keywords
Computer science, Key (lock), Architecture, Scalability, Context (archaeology)
References
- Local and Remote Memory: Memory in a Linux/NUMA System
- The High Performance Fortran Handbook
- Efficient parallel programming on scalable shared memory systems with High Performance Fortran
- Data and thread affinity in openmp programs
- Hardware profile-guided automatic page placement for ccNUMA systems
- Extending OpenMP For NUMA Machines
- Exploiting memory affinity in OpenMP through schedule reuse
- Interactive locality optimization on NUMA architectures
- The high performance Fortran handbook
- Author manuscript, published in "International Workshop on OpenMP (IWOMP) (2009)" DOI: 10.1007/978-3-642-02303-3_7 Dynamic Task and Data Placement over NUMA Architectures: an OpenMP Runtime Perspective
Cited by
No citing papers recorded for this paper.
Related papers
- Scalability Issues of Blockchain Technology
- On the scalability of multistage interconnection networks
- INVITED PAPER: Scalability and Performance Issues in Deeply Embedded Sensor Systems
- Evaluating The Scalability of Big Data Frameworks
- Measuring the scalability of parallel computer systems
- Research of Scalability Model Based on Cloud Storage System
- The Myth of Scalable High Performance
- Archigram: Architecture without Architecture