Date: Tue, 10 Dec 1996 21:21:47 GMT Server: NCSA/1.4.2 Content-type: text/html Last-modified: Mon, 04 Sep 1995 17:39:55 GMT Content-length: 2685 Finding clusters quickly in parallel



next up previous
Next: Introduction

Finding clusters quickly in parallel

Brendan Mumey

Department of Computer Science
University of Washington, Seattle, WA 98195, USA
brendan@cs.washington.edu

January 27, 1995

Abstract:

This report describes the implementation of a new parallel algorithm for finding clusters point sets of Euclidean space. A new solution to a special case of the bichromatic closest pairs problem is used by the algorithm. The implementation was done in an environment for distributed tree computations on the Kendall Square Research KSR-2 multiprocessor.





Brendan Mumey
Mon Sep 4 09:59:57 PDT 1995