Professor Hoffman,

Enclosed is the abstract for a paper I would like to present at the 35th
SEICGCC.

I must request that you schedule this talk befor Friday, as I must fly
out Friday morning.

Thank you for the time and effort in organizing this conference.

Look forward to seeing you again.

-- 
Fred Harris, Jr.                inet  : fredh@cs.unr.edu
Computer Science Department,    office: 240A - LME
University of Nevada - Reno     phone : (775) 784-6571
-- 


A Low-Cost Parallel Queuing System for Computationally Intensive Problems
Sean C. Martin; Bei Yuan; Judith R. Fredrickson; Frederick C. Harris, Jr.*

                  Department of Computer Science
                       University of Nevada
                        Reno, Nevada 89557
                         fredh@cs.unr.edu

With the availability of inexpensive computer clusters it is now
economically feasible to attack computationally intensive problems
using parallel processing.  This paper presents an easily adaptable
parallel work queue for solving these types of problems, many of which
lie in graph theory.  This system lifts the user above the details of
processor communication (message synchronization, work load balancing)
and allows them to focus on the problem to be solved without having to
become an expert in parallel processing details.  Initial results are
presented using this system on two graph theory problems: calculating the
Minimum Crossing Number for complete graphs and the Traveling Salesman
Problem. 
Keywords: parallel, minimum crossing number, complete graph, TSP