Optimal Golomb Rulers: An Exhaustive Parallel Search Implementation

Golomb Rulers are numerical sequences that nd application in a variety of engineering elds. The computation of these series, however, is prohibitively costly in terms of computer resources. Thus the discovery of new rulers over the past two decades has been limited by the available computing resources. This thesis describes a parallel implementation of an Optimal Golomb Ruler search algorithm. This algorithm provides a high utilization of available computer resources, and is portable to a variety of computer platforms. Reliability and fault tolerance issues are addressed by algorithm design. With the new algorithm, two previously unpublished rulers were independently discovered and veri ed. Chapter