| 
|
Quote: optimal parallel execution if memory is randomly distributed among the physical processors and there are log p more virtual processors; e.g., use hashing
topics >
all references >
references t-z >
Topic:
memory cache
Topic:
models of parallel computation
Topic:
managing shared memory
Quotation Skeleton
The most promising method known for distributing memory … [p. 106] [if v >= p log p for v virtual processors and p physical processors and memory requests are to distinct locations,] Then the v memory requests will … [parallel] machine will be able to execute this superstep in optimal … The more general case of concurrent access will … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: memory cache (28 items)
Topic: models of parallel computation (33 items)
Topic: managing shared memory (74 items)