An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers

This article presents an exact algorithm for the precedence-constrained traveling salesman problem, which is also known as the sequential ordering problem. This NP-hard problem has applications in various domains, including operational research and compilers. In this article, the problem is presente...

Full description

Saved in:
Bibliographic Details
Published in:Computational optimization and applications Vol. 61; no. 2; pp. 343 - 372
Main Authors: Shobaki, Ghassan, Jamal, Jafar
Format: Journal Article
Language:English
Published: New York Springer US 01.06.2015
Springer Nature B.V
Subjects:
Algorithms
Analysis
Branch & bound algorithms
Computer science
Convex and Discrete Geometry
Energy
Energy consumption
Heuristic
Linear programming
Management Science
Mathematics
Mathematics and Statistics
Operations Research
Operations Research/Decision Theory
Optimization
Production planning
Schedules
Scheduling
Statistics
Studies
Traveling salesman problem
Switching energy
Sequential ordering problem
Low energy computing
Precedence-constrained traveling salesman problem
Instruction scheduling
Low power computing
Branch-and-bound enumeration
NP-complete problems
Compiler optimizations
ISSN:0926-6003, 1573-2894
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This article presents an exact algorithm for the precedence-constrained traveling salesman problem, which is also known as the sequential ordering problem. This NP-hard problem has applications in various domains, including operational research and compilers. In this article, the problem is presented and solved in the context of minimizing switching energy in compilers. Most previous work on minimizing switching energy in the compiler domain has been limited to simple heuristics that are not guaranteed to give an optimal solution. In this work, we present an exact algorithm for solving the switching energy minimization problem using a branch-and-bound approach. The proposed algorithm is simple and intuitive, yet powerful. It is the first exact algorithm for the switching energy problem that is shown to solve real instances of the problem within a few seconds per instance. Compared to previous work in the operational research domain, the proposed algorithm is believed to be the most powerful exact algorithm that does not require a linear programming formulation. The proposed algorithm is experimentally evaluated using instances taken from a production compiler. The results show that with a time limit of 10 ms per node, the proposed algorithm optimally solves 99.8 % of the instances. It optimally solves instances with up to 598 nodes within a few seconds. The resulting switching cost is 16 % less than that produced without energy awareness and 5 % less than that produced by a commonly used heuristic.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0926-6003
1573-2894
DOI:10.1007/s10589-015-9725-9