skip to main content
Visitante
Meu Espaço
Minha Conta
Sair
Identificação
This feature requires javascript
Tags
Revistas Eletrônicas (eJournals)
Livros Eletrônicos (eBooks)
Bases de Dados
Bibliotecas USP
Ajuda
Ajuda
Idioma:
Inglês
Espanhol
Português
This feature required javascript
This feature requires javascript
Primo Search
Busca Geral
Busca Geral
Acervo Físico
Acervo Físico
Produção Intelectual da USP
Produção USP
Search For:
Clear Search Box
Search in:
Busca Geral
Or hit Enter to replace search target
Or select another collection:
Search in:
Busca Geral
Busca Avançada
Busca por Índices
This feature requires javascript
This feature requires javascript
A PRACTICAL ALGORITHM FOR EXACT ARRAY DEPENDENCE ANALYSIS
PUGH, W
Communications of the ACM, 1992-08, Vol.35 (8), p.102-114
NEW YORK: Assoc Computing Machinery
Texto completo disponível
Citações
Citado por
Exibir Online
Detalhes
Resenhas & Tags
Mais Opções
Nº de Citações
This feature requires javascript
Enviar para
Adicionar ao Meu Espaço
Remover do Meu Espaço
E-mail (máximo 30 registros por vez)
Imprimir
Link permanente
Referência
EasyBib
EndNote
RefWorks
del.icio.us
Exportar RIS
Exportar BibTeX
This feature requires javascript
Título:
A PRACTICAL ALGORITHM FOR EXACT ARRAY DEPENDENCE ANALYSIS
Autor:
PUGH, W
Assuntos:
Algorithms
;
Analysis
;
Applications programming
;
Compilers
;
Compiling (Electronic computers)
;
Computer industry
;
Computer programming
;
Computer Science
;
Computer Science, Hardware & Architecture
;
Computer Science, Software Engineering
;
Computer Science, Theory & Methods
;
Coroutines
;
Dependence
;
FORTRAN
;
Inequality
;
Integer programming
;
Linear programming
;
Mathematics
;
Parallel processing
;
Science & Technology
;
Software
;
Supercomputers
;
Technology
;
Testing
;
Variables
É parte de:
Communications of the ACM, 1992-08, Vol.35 (8), p.102-114
Notas:
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
Descrição:
Data dependence analysis for arrays is a fundamental step in an advanced optimizing compiler. This entails deciding if 2 references to an array can refer to the same element and, if so, under what conditions. This information is used to determine allowable program transformations and optimizations. Data dependency problems are equivalent to deciding whether there exists an integer solution to a set of linear equalities and inequalities, a form of integer programming. The Omega test, which performs this function, combines new methods for eliminating equality constraints with an extension of Fourier-Motzkin variable elimination to integer programming. At a more detailed level, the Omega test also incorporates several implementation details that produce substantial speed improvements in practice. The Omega test can be modified to project integer programming problems onto a subset of the variables. Performing projection of integer programming problems can be used to determine information about dependence direction and distance vectors, as well for several other uses.
Editor:
NEW YORK: Assoc Computing Machinery
Idioma:
Inglês
This feature requires javascript
This feature requires javascript
Voltar para lista de resultados
This feature requires javascript
This feature requires javascript
Buscando em bases de dados remotas. Favor aguardar.
Buscando por
em
scope:(USP_VIDEOS),scope:("PRIMO"),scope:(USP_FISICO),scope:(USP_EREVISTAS),scope:(USP),scope:(USP_EBOOKS),scope:(USP_PRODUCAO),primo_central_multiple_fe
Mostrar o que foi encontrado até o momento
This feature requires javascript
This feature requires javascript