New Non-deterministic Approaches for Register Allocation

In this paper two algorithms for register allocation are presented. The first algorithm is a simulated annealing algorithm. The core of the algorithm is the Metropolis procedure. The algorithm presented in the paper has a linear time asymptotic complexity. The second algorithm is a genetic algorithm. The algorithm has a linear time complexity.