Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
