• Guo X and Han H. (2019). The Research of a Memory Accesses Behavior on Non-Uniform Memory Access Architecture 2019 10th International Conference on Information Technology in Medicine and Education (ITME). 10.1109/ITME.2019.00174. 978-1-7281-3918-0. (763-766).

    https://ieeexplore.ieee.org/document/8964939/

  • Guo X and Han H. (2018). The Research of Several Situations About Memory Accessing on Non-Uniform Memory Access Architecture 2018 IEEE/ACIS 17th International Conference on Computer and Information Science (ICIS). 10.1109/ICIS.2018.8466393. 978-1-5386-5892-5. (744-747).

    https://ieeexplore.ieee.org/document/8466393/

  • Guo X and Han H. (2017). A good data allocation strategy on non-uniform memory access architecture 2017 IEEE/ACIS 16th International Conference on Computer and Information Science (ICIS). 10.1109/ICIS.2017.7960048. 978-1-5090-5507-4. (527-530).

    http://ieeexplore.ieee.org/document/7960048/

  • Drebes A, Pop A, Heydemann K, Cohen A and Drach N. Scalable Task Parallelism for NUMA. Proceedings of the 2016 International Conference on Parallel Architectures and Compilation. (125-137).

    https://doi.org/10.1145/2967938.2967946

  • Madarkar J, Chand V, Reddy P and Arora H. (2016). A Novel Algorithmic Approach for an Automatic Data Placement for NUMA Based Design. Procedia Computer Science. 78:C. (276-283). Online publication date: 1-Mar-2016.

    https://doi.org/10.1016/j.procs.2016.02.044

  • Pophale S and Hernandez O. (2016). Evaluating OpenMP Affinity on the POWER8 Architecture. OpenMP: Memory, Devices, and Tasks. 10.1007/978-3-319-45550-1_3. (35-46).

    http://link.springer.com/10.1007/978-3-319-45550-1_3

  • Lifflander J, Krishnamoorthy S and Kale L. Optimizing data locality for fork/join programs using constrained work stealing. Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. (857-868).

    https://doi.org/10.1109/SC.2014.75

  • Olivier S, de Supinski B, Schulz M and Prins J. (2013). Characterizing and mitigating work time inflation in task parallel programs. Scientific Programming. 21:3-4. (123-136). Online publication date: 1-Jul-2013.

    https://doi.org/10.1155/2013/898597

  • Olivier S, de Supinski B, Schulz M and Prins J. Characterizing and mitigating work time inflation in task parallel programs. Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis. (1-12).

    /doi/10.5555/2388996.2389085

  • Olivier S, de Supinski B, Schulz M and Prins J. Characterizing and mitigating work time inflation in task parallel programs. Proceedings of the 2012 International Conference for High Performance Computing, Networking, Storage and Analysis. (1-12).

    https://doi.org/10.1109/SC.2012.27

  • Förster M and Kraus J. (2011). Scalable parallel AMG on ccNUMA machines with OpenMP. Computer Science - Research and Development. 26:3-4. (221-228). Online publication date: 1-Jun-2011.

    https://doi.org/10.1007/s00450-011-0159-z

  • Ribeiro C, Mehaut J and Carissimi A. (2010). Memory affinity management for numerical scientific applications over Multi-core Multiprocessors with Hierarchical Memory 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW 2010). 10.1109/IPDPSW.2010.5470796. 978-1-4244-6533-0. (1-4).

    http://ieeexplore.ieee.org/document/5470796/

  • Gang C. Design of Digital Educational Resource Platforms in University. Proceedings of the 2008 International Symposium on Computer Science and Computational Technology - Volume 01. (142-145).

    https://doi.org/10.1109/ISCSCT.2008.126

  • Weng T and Chapman B. (2004). Towards optimisation of openMP codes for synchronisation and data reuse. International Journal of High Performance Computing and Networking. 1:1-3. (43-54). Online publication date: 1-Jan-2004.

    https://doi.org/10.1504/IJHPCN.2004.007564

  • Liu Z, Chapman B, Wen Y, Huang L, Weng T and Hernandez O. Analyses for the translation of OpenMP codes into SPMD style with array privatization. Proceedings of the OpenMP applications and tools 2003 international conference on OpenMP shared memory parallel programming. (26-41).

    /doi/10.5555/1761900.1761904

  • Weng T and Chapman B. Asynchronous execution of OpenMP code. Proceedings of the 2003 international conference on Computational science. (667-676).

    /doi/10.5555/1757599.1757677

  • Liu Z, Chapman B, Wen Y, Huang L, Weng T and Hernandez O. (2003). Analyses for the Translation of OpenMP Codes into SPMD Style with Array Privatization. OpenMP Shared Memory Parallel Programming. 10.1007/3-540-45009-2_3. (26-41).

    http://link.springer.com/10.1007/3-540-45009-2_3

  • Weng T and Chapman B. (2003). Asynchronous Execution of OpenMP Code. Computational Science — ICCS 2003. 10.1007/3-540-44864-0_69. (667-676).

    http://link.springer.com/10.1007/3-540-44864-0_69