You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Extent analysis of data fields

Fulltext:


Authors:

Björn Lisper, J.-F. Collard

Research group:


Publication Type:

Conference/Workshop Paper

Venue:

International Symposium on Static Analysis

Publisher:

Springer- Verlag


Abstract

Data parallelism means operating on distributed tables, data fields, in parallel. An abstract model of data parallelism, developed in [10], treats data fields as functions explicitly restricted to a finite set. Data parallel functional languages based on this view would reach a very high level of abstraction. Here we consider two static analyses that, when successful, give information about the extent of a data field with recursively defined elements, in the form of a predicate that is true wherever the data field is defined. This information can be used to preallocate the elements and map them effciently to distributed memory, and to aid the static scheduling of operations. The predicates can be seen as extensions, providing more detail, of classical data dependency notions like strictness. The analyses are cast in the framework of abstract interpretation: a forward analysis which propagates restrictions on inputs to restrictions on outputs, and a backward analysis which propagates restrictions the other way. For both analyses, fixpoint iteration can sometimes be used to solve the equations that arise. In particular, when the predicates are linear inequalities, integer linear programming methods can be used to detect termination of fixpoint iteration.

Bibtex

@inproceedings{Lisper2474,
author = {Bj{\"o}rn Lisper and J.-F. Collard},
title = {Extent analysis of data fields},
editor = {B. Le Charlier,},
pages = {208--222},
month = {September},
year = {1994},
booktitle = {International Symposium on Static Analysis},
publisher = {Springer- Verlag},
url = {http://www.es.mdu.se/publications/2474-}
}