Skip to main content
Log in

A Polynomial-Time Dependence Test for Determining Integer-Valued Solutions in Multi-Dimensional Arrays Under Variable Bounds

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Multi-dimensional arrays with linear subscripts occur quite frequently in real programs. For multi-dimensional linear arrays under variable bounds as well as any given direction vectors, the generalized Lambda test is an efficient and precise data dependence method to check whether there exist real-valued solutions. In this paper, we propose a multi-dimensional generalized interval test—a polynomial-time dependence test that can be applied towards testing whether there are integer-valued solutions for multi-dimensional linear arrays under variablelimits and any given direction vectors. Experimental results with benchmark showing the effects of the multi-dimensional generalized interval test over the generalized Lambda test are also presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chih-Ping Chu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chang, WL., Chu, CP. & Wu, JH. A Polynomial-Time Dependence Test for Determining Integer-Valued Solutions in Multi-Dimensional Arrays Under Variable Bounds. J Supercomput 31, 111–135 (2005). https://doi.org/10.1007/s11227-005-0032-6

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-005-0032-6

Navigation