K. Mehlhorn and U. Vishkin. Granularity of memory in parallel computation. Acta Informatica, 21:339--374, 1984. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Scanning Multiple Sequences Via Cache Memory - Mehlhorn, Sanders (2003) Self-citation (Mehlhorn) (Correct)
....the starting addresses x j of the arrays such that the values x j mod M are uniformly distributed independent random variables. The idea of placing objects at random positions in memory has been successfully used before, e.g. in a multi disk mergesort algorithm [BGV97] and in PRAM simulation [MV84, Ran91] Our strategy may be implemented as follows: When allocating memory for a sequence of length l, the algorithm k 1 2 4 8 16 32 64 128 256 512 1024 T 0.52 4.03 3.99 4.02 4.04 4.01 5.6 5.58 5.6 5.53 5.55 Table 1: Execution times for scanning k sequences of total length N = 2 in ....
K. Mehlhorn and U. Vishkin. Granularity of memory in parallel computation. Acta Informatica, 21:339--374, 1984.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC