J96-3010 easily implemented in almost any parallel computer model in common use . Book Reviews
H89-2049 logically partitioned into disjoint parallel computers . In this case each partition
H89-2049 elements , typically called massively parallel computers . Our aim , however , is to design
E89-1010 connectionist models on a real massively parallel computer and wish to demonstrate real-time
C96-1008 to behave like a single large parallel computer . PVM supplies each message with
E89-1010 expensive unless we have massively parallel computers . C-Markers are a resonable compromise
P86-1020 routing system of a particular parallel computer will select which data structures
H89-2049 becoming a standard of measure for parallel computers . Now that affordable massively
H89-2078 availability of high-performance , parallel computers thus far has limited the algorithms
M93-1025 project is to build a massively parallel computer capable of fast and accurate
P86-1020 on large amounts of text by a parallel computer such as the Connection Machine
H89-2049 different PE 's . ) Clearly , an SIMD parallel computer will not be effective in cases
C92-2097 distributed cooperative processing by a parallel computer and incorporating various kinds
P86-1020 text in computer readable form . Parallel computers and algorithms provide one way
H89-2049 delivered by low cost tree-structured parallel computers . Inexpensive front-end speech
H89-2049 immediately applicable to any MIMD parallel computer that is partitionable . This
H89-2049 , recognition and production , parallel computer systems are now commonplace delivenng
M92-1040 -RSB- . Under NSF funding , a parallel computer was built in the Parallel Knowledg
P88-1014 beginning to think in terms of parallel computers , in which tens of thousands
P88-1014 beginning to think in terms of parallel computers , in which tens of thousands
hide detail