Disperse: a simple and efficient approach to parallel database searching

Raphael Clifford; A.J. Mackey

Disperse: a simple and efficient approach to parallel database searching

Raphael Clifford
, A.J. Mackey

Research output: Contribution to journal › Article (Academic Journal) › peer-review

15 Citations (Scopus)

Abstract

A general system for performing multiple independent database searches in parallel is presented. Run-time addition and removal of clients, robust failure and error trapping and near 100% efficiency with very large numbers of clients are achieved by a flexible asynchronous, client-driven approach.

Translated title of the contribution	Disperse: a simple and efficient approach to parallel database searching
Original language	English
Article number	564-565
Journal	Bioinformatics
Volume	16(6)
Publication status	Published - 2000

Bibliographical note

Other identifier: 2000449

Access to Document

http://www.cs.bris.ac.uk/Publications/pub_master.jsp?id=2000449

Handle.net

Persistent link

Cite this

@article{d3053a9fd40744789fcbdf667fd0f54d,

title = "Disperse: a simple and efficient approach to parallel database searching",

abstract = "A general system for performing multiple independent database searches in parallel is presented. Run-time addition and removal of clients, robust failure and error trapping and near 100\% efficiency with very large numbers of clients are achieved by a flexible asynchronous, client-driven approach.",

author = "Raphael Clifford and A.J. Mackey",

note = "Other identifier: 2000449",

year = "2000",

language = "English",

volume = "16(6)",

journal = "Bioinformatics",

issn = "1460-2059",

publisher = "Oxford University Press",

}

TY - JOUR

T1 - Disperse: a simple and efficient approach to parallel database searching

AU - Clifford, Raphael

AU - Mackey, A.J.

N1 - Other identifier: 2000449

PY - 2000

Y1 - 2000

N2 - A general system for performing multiple independent database searches in parallel is presented. Run-time addition and removal of clients, robust failure and error trapping and near 100% efficiency with very large numbers of clients are achieved by a flexible asynchronous, client-driven approach.

AB - A general system for performing multiple independent database searches in parallel is presented. Run-time addition and removal of clients, robust failure and error trapping and near 100% efficiency with very large numbers of clients are achieved by a flexible asynchronous, client-driven approach.

M3 - Article (Academic Journal)

SN - 1460-2059

SN - 1367-4811

VL - 16(6)

JO - Bioinformatics

JF - Bioinformatics

M1 - 564-565

ER -

Disperse: a simple and efficient approach to parallel database searching

Abstract

Bibliographical note

Access to Document

Handle.net

Fingerprint

Cite this