default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKleanthis Psarris
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j17]Jichi Guo, Qing Yi, Kleanthis Psarris
:
Enhancing the Effectiveness of Inlining in Automatic Parallelization. Int. J. Parallel Program. 50(1): 65-88 (2022)
2010 – 2019
- 2019
- [j16]David Niedzielski, Kleanthis Psarris, Theoharis Theoharis:
An Analytical Evaluation of Data Dependence Analysis Techniques. Int. J. Parallel Program. 47(5-6): 781-804 (2019) - 2013
- [j15]Yi-Gang Tai, Chia-Tien Dan Lo, Kleanthis Psarris:
Scalable matrix decompositions with multiple cores on FPGAs. Microprocess. Microsystems 37(8-B): 887-898 (2013) - 2012
- [j14]Yi-Gang Tai, Chia-Tien Dan Lo, Kleanthis Psarris:
Accelerating Matrix Operations with Improved Deeply Pipelined Vector Reduction. IEEE Trans. Parallel Distributed Syst. 23(2): 202-210 (2012) - 2011
- [j13]Andreas Gampe, Jeffery von Ronne, David Niedzielski, Jonathan Vasek, Kleanthis Psarris:
Safe, multiphase bounds check elimination in Java. Softw. Pract. Exp. 41(7): 753-788 (2011) - [c36]Yi-Gang Tai, Kleanthis Psarris, Chia-Tien Dan Lo:
Synthesizing Tiled Matrix Decomposition on FPGAs. FPL 2011: 464-469 - [c35]Jichi Guo, Mike Stiles, Qing Yi, Kleanthis Psarris:
Enhancing the Role of Inlining in Effective Interprocedural Parallelization. ICPP 2011: 265-274 - 2010
- [c34]Yi-Gang Tai, Chia-Tien Dan Lo, Kleanthis Psarris:
Multiple data set reduction on FPGAs. FPT 2010: 45-52
2000 – 2009
- 2009
- [j12]Jeffery von Ronne, Andreas Gampe, David Niedzielski, Kleanthis Psarris:
Safe bounds check annotations. Concurr. Comput. Pract. Exp. 21(1): 41-57 (2009) - [j11]Konstantinos Kyriakopoulos, Kleanthis Psarris:
Nonlinear Symbolic Analysis for Advanced Program Parallelization. IEEE Trans. Parallel Distributed Syst. 20(5): 623-640 (2009) - [c33]David Niedzielski, Jeffery von Ronne, Andreas Gampe, Kleanthis Psarris:
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination. SAS 2009: 137-153 - [c32]Yi-Gang Tai, Chia-Tien Dan Lo, Kleanthis Psarris:
An Improved Reduction Algorithm With Deeply Pipelined Operators. SMC 2009: 3060-3065 - 2008
- [c31]Johnnie Birch, Kleanthis Psarris:
Discovering Maximum Parallelization Using Advanced Data Dependence Analysis. HPCC 2008: 103-112 - [c30]Kleanthis Psarris:
Symbolic Analysis for Increased Program Execution Performance. ICA3PP 2008: 318 - [c29]Yi-Gang Tai, Chia-Tien Dan Lo, Kleanthis Psarris:
Accelerating matrix decomposition with replications. IPDPS 2008: 1-8 - [c28]Andreas Gampe, Jeffery von Ronne, David Niedzielski, Kleanthis Psarris:
Speculative improvements to verifiable bounds check elimination. PPPJ 2008: 85-94 - [c27]Chia-Tien Dan Lo, Yi-Gang Tai, Kleanthis Psarris:
Hardware implementation for network intrusion detection rules with regular expression support. SAC 2008: 1535-1539 - 2007
- [c26]Yi-Gang Tai, Chia-Tien Dan Lo, Kleanthis Psarris:
Applying Out-of-Core QR Decomposition Algorithms on FPGA-Based Systems. FPL 2007: 86-91 - 2006
- [c25]Chia-Tien Dan Lo, Yi-Gang Tai, Kleanthis Psarris, Wen-Jyi Hwang:
Super fast hardware string matching. FPT 2006: 385-388 - [c24]Robert van Engelen, Madhusudhan Govindaraju, Nectarios Koziris, Kleanthis Psarris:
Editorial message: special track on distributed systems and grid computing. SAC 2006: 739-740 - 2005
- [c23]Konstantinos Kyriakopoulos, Kleanthis Psarris:
Efficient Techniques for Advanced Data Dependence Analysis. IEEE PACT 2005: 143-156 - [c22]Konstantinos Kyriakopoulos, Kleanthis Psarris:
Addressing the Issues in Data Dependence Analysis. PDCS 2005: 199-205 - [c21]Robert van Engelen, Nectarios Koziris, Madhusudhan Govindaraju, Kleanthis Psarris:
Editorial message: special track on distributed systems and grid computing. SAC 2005: 678-679 - 2004
- [j10]Konstantinos Kyriakopoulos, Kleanthis Psarris:
Data Dependence Analysis Techniques for Increased Accuracy and Extracted Parallelism. Int. J. Parallel Program. 32(4): 317-359 (2004) - [j9]Kleanthis Psarris, Konstantinos Kyriakopoulos:
An Experimental Evaluation of Data Dependence Analysis Techniques. IEEE Trans. Parallel Distributed Syst. 15(3): 196-213 (2004) - [c20]Robert van Engelen, Nectarios Koziris, Mario Mango Furnari, Kleanthis Psarris:
Editorial message: special track on parallel and distributed systems. SAC 2004: 1405-1406 - 2003
- [c19]Kleanthis Psarris, Konstantinos Kyriakopoulos:
The impact of data dependence analysis on compilation and program parallelization. ICS 2003: 205-214 - [c18]Robert van Engelen, Turgay Korkmaz, Nectarios Koziris, Kleanthis Psarris:
Parallel and Distributed Systems and Networking Track Editorial. SAC 2003: 983-984 - 2002
- [j8]Kleanthis Psarris:
Program analysis techniques for transforming programs for parallel execution. Parallel Comput. 28(3): 455-469 (2002) - 2001
- [c17]Kleanthis Psarris, Konstantinos Kyriakopoulos:
Measuring the Accuracy and Efficiency of the Data Dependence Tests. PDCS 2001: 211-218 - [c16]Konstantinos Kyriakopoulos, Kleanthis Psarris:
Data Dependence Analysis for Complex Loop Regions. ICPP 2001: 195-204
1990 – 1999
- 1999
- [j7]Ece Yaprak, Anthony T. Chronopoulos, Kleanthis Psarris, Yi Xiao:
Dynamic buffer allocation in an ATM switch. Comput. Networks 31(18): 1927-1933 (1999) - [j6]Rajiv Gupta, Santosh Pande, Kleanthis Psarris, Vivek Sarkar:
Compilation techniques for parallel systems. Parallel Comput. 25(13-14): 1741-1783 (1999) - [c15]Kleanthis Psarris, Konstantinos Kyriakopoulos:
Data Dependence Testing in Practice. IEEE PACT 1999: 264-273 - [c14]David Niedzielski, Kleanthis Psarris:
An Analytical Comparison of the I-Test and Omega Test. LCPC 1999: 251-270 - 1998
- [c13]Ece Yaprak, Kleanthis Psarris:
Adaptive buffer threshold updating for an ATM switch. ISCC 1998: 400-405 - 1996
- [j5]Kleanthis Psarris:
The Banerjee-Wolfe and GCD Tests on Exact Data Dependence Information. J. Parallel Distributed Comput. 32(2): 119-138 (1996) - [j4]Santosh Pande, Kleanthis Psarris:
Program Repartitioning on Varying Communication Cost Parallel Architectures. J. Parallel Distributed Comput. 33(2): 205-213 (1996) - 1995
- [c12]Kleanthis Psarris, Santosh Pande:
Classical dependence analysis techniques: sufficiently accurate in practice. HICSS (2) 1995: 123-132 - [c11]Kleanthis Psarris:
Linear Time Extract Methods for Data Dependence Analysis in Practice. ICPP (2) 1995: 1-8 - 1994
- [c10]Santosh Pande, Kleanthis Psarris:
Scheduling Acyclic Task Graphs on Distributed Memory Parallel Architectures. Parallel Processing of Discrete Optimization Problems 1994: 289-304 - [c9]Kleanthis Psarris, Santosh Pande:
An Empirical Study of the I Test for Exact Data Dependence. ICPP (3) 1994: 92-96 - [c8]Santosh Pande, Kleanthis Psarris:
Compiling Functional Parallelism on a Family of Different Distributed Memory Architectures. ICPP (1) 1994: 182-186 - [c7]Santosh Pande, Kleanthis Psarris:
A Compilation Technique for Varying Communication Cost NUMA Architectures. PARLE 1994: 49-60 - 1993
- [j3]Kleanthis Psarris, Xiangyun Kong, David Klappholz:
The Direction Vector I Test. IEEE Trans. Parallel Distributed Syst. 4(11): 1280-1290 (1993) - [c6]Kleanthis Psarris, David Klappholz:
Eliminating Unnecessary Array Bounds Checks in Nests of Loops. ICCI 1993: 550-554 - [c5]Kleanthis Psarris, David Klappholz:
Data Dependence Testing for Supercompilers. PARCO 1993: 643-646 - 1992
- [c4]Kleanthis Psarris:
On exact data dependence analysis. ICS 1992: 303-312 - 1991
- [j2]Kleanthis Psarris, David Klappholz, Xiangyun Kong:
On the Accuracy of the Banerjee Test. J. Parallel Distributed Comput. 12(2): 152-157 (1991) - [j1]Xiangyun Kong, David Klappholz, Kleanthis Psarris:
The I Test: An Improved Dependence Test for Automatic Parallelization and Vectorization. IEEE Trans. Parallel Distributed Syst. 2(3): 342-349 (1991) - [c3]Kleanthis Psarris, Xiangyun Kong, David Klappholz:
Extending the I test to direction vectors. ICS 1991: 330-340 - 1990
- [c2]Xiangyun Kong, David Klappholz, Kleanthis Psarris:
The I Test: A New Test for Subscript Data Dependence. ICPP (2) 1990: 204-211 - [c1]David Klappholz, Kleanthis Psarris, Xiangyun Kong:
On the perfect accuracy of an approximate subscript analysis test. ICS 1990: 201-212
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
