Parallel Searching for a First Solution

Bartoszek, Bozena and Czeck, Zbigniew and Konopka, Marek (1993) Parallel Searching for a First Solution. Technical report. University of Kent, Canterbury, UK, University of Kent, Canterbury, UK

Postscript
Download (187Kb)	Preview
PDF
Download (87Kb)	Preview

Abstract

A parallel algorithm for conducting a search for a first solution to the problem of generating minimal perfect hash functions is presented. A message-based distributed memory computer is assumed as a model for parallel computations. A data structure, called reverse trie (r-trie), was devised to carry out the search. The algorithm was implemented on a transputer network. The experiments showed that the algorithm exhibits a consistent and almost linear speed-up. The r-trie structure proved to be highly memory efficient.

Item Type:	Monograph (Technical report)
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions:	Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User:	Mark Wheadon
Date Deposited:	04 Oct 2009 18:44
Last Modified:	06 Sep 2011 03:42
Resource URI:	http://kar.kent.ac.uk/id/eprint/21095 (The current URI for this page, for reference purposes)

• Depositors only (login required):