Learn More
A compiler for VLIW and superscalar processors must expose sufficient instruction-level parallelism (ILP) to effectively utilize the parallel hardware. However, ILP within basic blocks is extremely limited for control-intensive programs. We have developed a set of techniques for exploiting ILP across basic block boundaries. These techniques are based on a(More)
A flexible compiler framework for distributed-memory multi-computers automatically par-allelizes sequential programs. A unified approach efficiently supports regular and irregular computations using data and functional parallelism. M assively parallel distributed-memory multicomputers can achieve the high performance levels required to solve the Grand(More)
In this work we investigate the eeectiveness of genetic algorithms (GAs) in the test generation process. We use simple GAs to generate populations of candidate test vectors and to select the best vector to apply in each time frame. A sequential circuit fault simula-tor is used to evaluate the tness of each candidate vector , allowing the test generator to(More)
{ The PARADIGM compiler project provides an automated means to parallelize programs, written in a serial programming model, for eecient execution on distributed-memory multicomputers. In addition to performing traditional compiler optimizations , PARADIGM is unique in that it addresses many other issues within a uniied platform: automatic data distribution,(More)
One model of multithreading gaining popularity on multiprocessor systems is the message-driven model of computation. The message-driven mod e l i s a reactive model in which an arriving message starts a block of computation to processthat message. The advantage of programming in such a model is that the dependencies are explicit, messages are asynchronous,(More)