archives

A Distributed Search Program for the 3x + 1 Problem


Home 

About 

Browse 

Search 

Register 

Subscriptions 

Deposit Papers 

Help
    

Leavens, Gary T. (1989) A Distributed Search Program for the 3x + 1 Problem. Technical Report TR89-22, Department of Computer Science, Iowa State University.

Full text available as:Postscript
Adobe PDF

Abstract

A Distributed Search Program
for the 3x+1 Problem
by
Gary T. Leavens
Department of Computer Science, 229 Atanasoff Hall
Iowa State University, Ames, Iowa 50011-1040 USA
leavens@cs.iastate.edu
Abstract
This report describes the design of a distributed program
that searched for peaks in certain measures related to the 3x+1 problem.
The searches for peaks in the number of steps taken, the maximum value reached,
and the number of steps before the values of the iterates
fall below the starting value exhibit a great deal of parallelism,
but there is also some small amount of synchronization necessary.
The design of a reliable and long-lived distributed system
that searched for such peaks is discussed
from the partitioning of the search to more detailed design issues
such as ways to limit the search.
The search was implemented in the distributed programming language Argus,
and a few observations about Argus programming are included.
An appendix includes tables of various results from the three years
that the search program was running on six or more computers.

Subjects:All uncategorized technical reports
ID code:00000001
Deposited by:Staff Account on 01 November 1989



Contact site administrator at: ssg@cs.iastate.edu