- 1 BEHRENZ, P. G. Algorithm 133, Random. Comm. ACM 5 (Nov. 1962), 553. Google ScholarDigital Library
- 2 COVEYOU, R. R. Serial correlation in the generation of Pseudorandom numbers. J. ACM 7(1960), 72-74. Google ScholarDigital Library
- 3 GREENBERGER, M. An a priori determination of serial correlation in computer generated random numbers. Math. Comput. 15 (1961), 383-389. correlation in Math. Comput 16(1962), 126.Google ScholarCross Ref
- 4 KENDALL, M. G., AND BABINGTON SMITH, B. Randomness and random sampling numbers. J. Royal Statist. Soc. 101 (1938), 147-166.Google ScholarCross Ref
Index Terms
- Algorithm 265: find precedence functions [L2]
Recommendations
Reusability-aware cache memory sharing for chip multiprocessors with private L2 caches
In this paper, we propose a novel on-chip L2 cache organization for chip multiprocessors (CMPs) with private L2 caches. The proposed approach, called reusability-aware cache sharing (RACS), combines the advantages of both a private L2 cache and a shared ...
Online Scheduling of Precedence Constrained Tasks
A fundamental problem in scheduling theory is that of scheduling a set of n tasks, with precedence constraints, on $m \ge 1$ identical and parallel processors so as to minimize the makespan (schedule length). In the past, research has focused on the ...
Comments