Control of loop parallelism in multithreaded code

Due to the large amount of potential parallelism, resource management is a critical issue in multithreaded architectures. The challenge in code generation is to control the parallelism without reducing the machines ability to exploit it. Controlled parallelism reduces idle time, communication, and delay caused by synchronization. At the same time it increases the potential for exploitation of program *data structure* locality. In this paper we present and evaluate two methods, slicing and chunking, to control program parallelism. We present the compilation strategy and evaluate its e ectiveness in terms of performance characteristics such as run time and matching store