Kleanthis Psarris
Affiliations: | Computer Science | The University of Texas at San Antonio, San Antonio, TX, United States |
Area:
Computer ScienceGoogle:
"Kleanthis Psarris"
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Niedzielski D, Psarris K, Theoharis T. (2019) An Analytical Evaluation of Data Dependence Analysis Techniques International Journal of Parallel Programming. 47: 781-804 |
Tai YG, Dan Lo CT, Psarris K. (2013) Scalable matrix decompositions with multiple cores on FPGAs Microprocessors and Microsystems. 37: 887-898 |
Tai YG, Lo CTD, Psarris K. (2012) Accelerating matrix operations with improved deeply pipelined vector reduction Ieee Transactions On Parallel and Distributed Systems. 23: 202-210 |
Guo J, Stiles M, Yi Q, et al. (2011) Enhancing the role of inlining in effective interprocedural parallelization Proceedings of the International Conference On Parallel Processing. 265-274 |
Tai YG, Psarris K, Dan Lo CT. (2011) Synthesizing tiled matrix decomposition on FPGAs Proceedings - 21st International Conference On Field Programmable Logic and Applications, Fpl 2011. 464-469 |
Gampe A, Ronne Jv, Niedzielski D, et al. (2011) Safe, multiphase bounds check elimination in Java Software - Practice and Experience. 41: 753-788 |
Tai YG, Dan Lo CT, Psarris K. (2010) Multiple data set reduction on FPGAs Proceedings - 2010 International Conference On Field-Programmable Technology, Fpt'10. 45-52 |
Kyriakopoulos K, Psarris K. (2009) Nonlinear symbolic analysis for advanced program parallelization Ieee Transactions On Parallel and Distributed Systems. 20: 623-640 |
Tai YG, Lo CTD, Psarris K. (2009) An improved reduction algorithm with deeply pipelined operators Conference Proceedings - Ieee International Conference On Systems, Man and Cybernetics. 3060-3065 |
Von Ronne J, Gampe A, Niedzielski D, et al. (2009) Safe bounds check annotations Concurrency Computation Practice and Experience. 21: 41-57 |