Map
Index
Random
Help
th

Quote: the Connection Machine can search for substrings in time proportional to the length of the substring

topics > all references > references g-h > QuoteRef: hillWD_1985 , p. 112



Topic:
external search and sort
Topic:
concurrent operations
Topic:
massively parallel processors
Topic:
data parallel processing

Quotation Skeleton

Searching strings is also fast [on the Connection Machine]. All occurrences … string. Each cell in the string simultaneously checks … activates the cell following it in the string. … string. This process continues until all items in … match the search string.   Google-1   Google-2

Copyright clearance needed for quotation.


Related Topics up

Topic: external search and sort (23 items)
Topic: concurrent operations (22 items)
Topic: massively parallel processors (29 items)
Topic: data parallel processing (12 items)

Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.