Paper Info
Title
Automatic Generation of Modular Mappings
Abstract
Modular mappings have been recently proposed for optimizations of algorithms that cannot be efficiently mapped by affine mappings. This paper addresses the problem of generating modular mappings that satisfy conditions for validity and optimality. In general, this is a difficult problem due to the presence of non-linear constraints. Hence, a method of O(n2) complexity is provided to assign values to some entries of a transformation matrix so that non-linear constraints are transformed into linear ones, where n is the dimension of a computation domain. The proposed heuristic attempts to reduce the number of value-assigned entries and exclude as few solutions as possible. This paper also considers the issue of deriving the inverse transformation of a given modular mapping. It identifies a class of modular functions whose inverses result directly from computing the inverse of the (coefficient) matrix used to specify a modular mapping. An efficient method of O(n2) complexity is provided to formulate the problem of generating such modular mappings as an integer linear programming problem.
Year
DOI
Venue
1996
10.1109/ASAP.1996.542810
ASAP
Keywords
Field
DocType
modular mappings,affine mapping,difficult problem,automatic generation,proposed heuristic attempt,integer linear programming problem,non-linear constraint,efficient method,transformation matrix,modular function,inverse transformation,modular mapping,validity,artificial intelligence,linear programming,integer programming,vectors,integer linear programming,design optimization,computational complexity,heuristic,satisfiability
Affine transformation,Heuristic,Algebra,Computer science,Matrix (mathematics),Parallel computing,Algorithm,Integer programming,Linear programming,Modular design,Transformation matrix,Computational complexity theory
Conference
ISBN
Citations 
PageRank 
0-8186-7542-X
0
0.34
References 
Authors
7
2
Name
Order
Citations
PageRank
Hyuk-Jae Lee133755.29
Jose A. B. Fortes244652.01