Parallel compiler generation
✍ Scribed by Tamás Gaál
- Publisher
- Elsevier Science
- Year
- 1993
- Weight
- 329 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0165-6074
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
As moderate-scale multiprocessors become widely used, we foresee an increased demand for effective compiler parallelization and efficient management of parallelism. While parallelizing compilers are achieving success at identifying parallelism, they are less adept at predetermining the degree of par
## Abstract Multiply sectioned Bayesian networks (MSBNs) support multiagent probabilistic inference in distributed large problem domains. Inference with MSBNs can be performed using their compiled representations. The compilation involves moralization and triangulation of a set of local graphical s
Over the past two decades tremendous progress has been made in both the design of parallel architectures and the compilers needed for exploiting parallelism on such architectures. In this paper we summarize the advances in compilation techniques for uncovering and eectively exploiting parallelism at
This paper presents compilation techniques used to compress holes, which are caused by the nonunit alignment stride in a two-level data-processor mapping. Holes are the memory locations mapped by useless template cells. To fully utilize the memory space, memory holes should be removed. In a two-leve