View in EDS PDF Full Text

An improved nonlinear data dependence test.

Saved in:
Bibliographic Details
Title: An improved nonlinear data dependence test.
Authors: Zhao, Jie1 zhaojie8037@gmail.com, Zhao, Rongcai1, Chen, Xi1, Zhao, Bo1
Source: Journal of Supercomputing. Jan2015, Vol. 71 Issue 1, p340-368. 29p.
Subjects: Nonlinear analysis, Parallelizing compilers, Scientific computing, Quadratic programming
Abstract: To further parallelize large-scale nonlinear scientific computing applications, some data dependence techniques for nonlinear subscripts, especially for quadratic subscripts, were proposed in the past. The quadratic programming (QP) test and polynomial variable interval (PVI) test are two representative techniques. The QP test, which serves as an exact but time-consuming technique, always gives conservative results when the coefficient matrix of the quadratic terms is not positive semi-definite, while the PVI test will lose efficiency when there exist mixed polynomials in the dependence equation. Focusing on the dependences caused by quadratic subscripts in nonlinear and irregular programs, we propose an improved nonlinear data dependence test in this paper. We first normalize a quadratic equation which is written in a general form, and determine whether the canonical equation is integer solvable in the region of interest based on the interval equation theory. Experimental results show that, compared with the QP test, our method maintains a much lower time complexity. Furthermore, it can detect more general dependences than other dependence testing methods like the PVI test in terms of quadratic subscripts. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Supercomputing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 100302959
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: An improved nonlinear data dependence test.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Zhao%2C+Jie%22">Zhao, Jie</searchLink><relatesTo>1</relatesTo><i> zhaojie8037@gmail.com</i><br /><searchLink fieldCode="AR" term="%22Zhao%2C+Rongcai%22">Zhao, Rongcai</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Chen%2C+Xi%22">Chen, Xi</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Zhao%2C+Bo%22">Zhao, Bo</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Supercomputing%22">Journal of Supercomputing</searchLink>. Jan2015, Vol. 71 Issue 1, p340-368. 29p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Nonlinear+analysis%22">Nonlinear analysis</searchLink><br /><searchLink fieldCode="DE" term="%22Parallelizing+compilers%22">Parallelizing compilers</searchLink><br /><searchLink fieldCode="DE" term="%22Scientific+computing%22">Scientific computing</searchLink><br /><searchLink fieldCode="DE" term="%22Quadratic+programming%22">Quadratic programming</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: To further parallelize large-scale nonlinear scientific computing applications, some data dependence techniques for nonlinear subscripts, especially for quadratic subscripts, were proposed in the past. The quadratic programming (QP) test and polynomial variable interval (PVI) test are two representative techniques. The QP test, which serves as an exact but time-consuming technique, always gives conservative results when the coefficient matrix of the quadratic terms is not positive semi-definite, while the PVI test will lose efficiency when there exist mixed polynomials in the dependence equation. Focusing on the dependences caused by quadratic subscripts in nonlinear and irregular programs, we propose an improved nonlinear data dependence test in this paper. We first normalize a quadratic equation which is written in a general form, and determine whether the canonical equation is integer solvable in the region of interest based on the interval equation theory. Experimental results show that, compared with the QP test, our method maintains a much lower time complexity. Furthermore, it can detect more general dependences than other dependence testing methods like the PVI test in terms of quadratic subscripts. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Journal of Supercomputing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=100302959
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s11227-014-1298-3
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 29
        StartPage: 340
    Subjects:
      – SubjectFull: Nonlinear analysis
        Type: general
      – SubjectFull: Parallelizing compilers
        Type: general
      – SubjectFull: Scientific computing
        Type: general
      – SubjectFull: Quadratic programming
        Type: general
    Titles:
      – TitleFull: An improved nonlinear data dependence test.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Zhao, Jie
      – PersonEntity:
          Name:
            NameFull: Zhao, Rongcai
      – PersonEntity:
          Name:
            NameFull: Chen, Xi
      – PersonEntity:
          Name:
            NameFull: Zhao, Bo
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Text: Jan2015
              Type: published
              Y: 2015
          Identifiers:
            – Type: issn-print
              Value: 09208542
          Numbering:
            – Type: volume
              Value: 71
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: Journal of Supercomputing
              Type: main
ResultId 1