A survey of heuristics for profile and wavefront reductions

Abstract

This paper surveys heuristic methods for profile and wavefront reductions. These graph layout problems represent a challenge for optimization methods and heuristics especially. This paper presents the graph layout problems with their formal definition. The study provides an ample perspective of techniques for designing heuristic methods for these graph layout problems but concentrates on the approaches and methodologies that yield high-quality solutions. Thus, this survey references the most relevant studies in the associated literature and discusses the current state-of-the-art heuristics for these graph layout problems.