A boltzmann machine approach to code optimization

✍ Scribed by A. De Gloria; P. Faraboschi

• Publisher: Elsevier Science
• Year: 1991
• Tongue: English
• Weight: 691 KB
• Volume: 17
• Category: Article
• ISSN: 0167-8191
• DOI: 10.1016/s0167-8191(05)80042-0

✦ Synopsis

De Gloria, A. and P. Faraboschi, A Boltzmann Machine approach to code optimization, Parallel Computing 17 (1991) 969-982_

In this paper we present a statistical approach to the problem of horizontal code compaction for the class of parallel synchronous non-homogeneous architectures. The proposed technique is based on a formulation of the problem using the Boltzmann Machine model. The formalization of the compaction process in terms of a non-deterministic connectionist framework enables to overcome the NP-hardness of the problem and to avoid the introduction of specialized heuristics which necessarily limit the generality of other techniques. Compilations of some Livermore loop kernels are presented, showing how the quality of the code produced with a Boltzmann Machine is comparable with a hand-compacted one. These results prove the skills of the method in implementing an effective alternative to traditional compilation techniques_