Network design for the implementation of text searching using a multicomputer

Cringean, Janey K.; England, Roger; Manson, Gordon A.; Willett, Peter

doi:10.1016/0306-4573(91)90084-y

Cited by 10 publications

(10 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, we are aware of few attempts for implementing other similar problems on a cluster of workstations. In [3] a exact string matching implementation have been proposed and results are reported on a transputer based architecture. In [9,10] a exact string matching algorithm was parallelized and modeled on a homogeneous platform giving positive experimental results.…”

Section: Introductionmentioning

confidence: 99%

A Performance Study of Load Balancing Strategies for Approximate String Matching on an MPI Heterogeneous System Environment

Michailidis

Margaritis

2002

Recent Advances in Parallel Virtual Machine and Message Passing Interface

View full text Add to dashboard Cite

Abstract. In this paper, we present three parallel approximate string matching methods on a parallel architecture with heterogeneous workstations to gain supercomputer power at low cost. The first method is the static master-worker with uniform distribution strategy, the second one is the dynamic master-worker with allocation of subtexts and the third one is the dynamic master-worker with allocation of text pointers. Further, we propose a hybrid parallel method that combines the advantages of static and dynamic parallel methods in order to reduce the load imbalance and communication overhead. This hybrid method is based on the following optimal distribution strategy: the text collection is distributed proportional to workstation's speed. We evaluated the performance of four methods with clusters 1, 2, 4, 6 and 8 heterogeneous workstations. The experimental results demonstrate that the dynamic allocation of text pointers and hybrid methods achieve better performance than the two original ones.

show abstract

Section: Introductionmentioning

confidence: 99%

A Performance Study of Load Balancing Strategies for Approximate String Matching on an MPI Heterogeneous System Environment

Michailidis

Margaritis

2002

Recent Advances in Parallel Virtual Machine and Message Passing Interface

View full text Add to dashboard Cite

show abstract

“…An example of the two-phase search can best be illustrated by looking at one particular system, the transputer network program described by Cringean et al [58][59][60][61][62].…”

Section: Two-phase Searchmentioning

confidence: 99%

“…Parallelism can be used in both phases of the search. Two-phase searches have been implemented on SIMD machines by Pogue et al [11][12][13][14][15] and on a MIMD transputer network by Cringean et al [58][59][60][61][62].…”

Section: Two-phase Searchmentioning

confidence: 99%

“…These models may use unnormalised [20] or normalised [24,63,68,84] term weighting. Cringean et al [58][59][60][61][62] do not specify the normalisation method. Others such as Reddaway [11] and Jeong and Omiecinski [69] do not specify a weighting scheme in their discussion of term scoring in their papers.…”

Section: Term Weighting Modelsmentioning

confidence: 99%

“…The dominant scheme has been the vector processing model with systems such as RAP.3 [75], the DowQuest [63], Transputer Networks [58][59][60][61][62]84] and POOMA [68], all using it in various forms.…”

Section: Term Weighting Modelsmentioning

confidence: 99%

See 2 more Smart Citations

Parallel computing in information retrieval – an updated review

MacFarlane

Robertson

McCann

1997

Journal of Documentation

View full text Add to dashboard Cite

This is the accepted version of the paper.This version of the publication may differ from the final published version. The progress of parallel computing in Information Retrieval (IR) is reviewed. In particular we stress the importance of the motivation in using parallel computing for Text Retrieval. We analyse parallel IR systems using a classification due to Rasmussen [1] and describe some parallel IR systems. We give a description of the retrieval models used in parallel Information PermanentProcessing.. We describe areas of research which we believe are needed.

show abstract

Performance evaluation of load balancing strategies for approximate string matching application on an MPI cluster of heterogeneous workstations

Michailidis¹,

Margaritis²

2003

Future Generation Computer Systems

View full text Add to dashboard Cite

Network design for the implementation of text searching using a multicomputer

Cited by 10 publications

References 30 publications

A Performance Study of Load Balancing Strategies for Approximate String Matching on an MPI Heterogeneous System Environment

A Performance Study of Load Balancing Strategies for Approximate String Matching on an MPI Heterogeneous System Environment

Parallel computing in information retrieval – an updated review

Performance evaluation of load balancing strategies for approximate string matching application on an MPI cluster of heterogeneous workstations

Contact Info

Product

Resources

About