Skip to main content

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 (KAR id:21095)

Postscript
Language: English
Click to download this file (191kB) Preview
[thumbnail of paralel_zena.ps]
Preview
This file may not be suitable for users of assistive technology.
Request an accessible format
PDF
Language: English
Click to download this file (89kB) Preview
[thumbnail of parallel_zena.pdf]
Preview
This file may not be suitable for users of assistive technology.
Request an accessible format

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: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 04 Oct 2009 18:44 UTC
Last Modified: 16 Nov 2021 09:59 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/21095 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.