论文信息 - Multiprocessor Simulation Strategies with Optimal Speed-up

Multiprocessor Simulation Strategies with Optimal Speed-up

Abstract In this paper we consider 2-processor algorithms for simulating the behaviour of given formulae over the basis ⊕, where ⊕ denotes the two argument Boolean function, Exclusive-Or. A sequence of 2-processor simulation strategies 〈Sr〉 (r ⩾ 0) is described and it is proved that the ratio ex r [n] n approach 0.5, where exr[n] is the expected number of steps taken by Sr on n-node formulae generated at random using the binary search tree distribution.

[1] John Michael Robson,et al. The Height of Binary Search Trees , 1979, Aust. Comput. J..

[2] Paul E. Dunne,et al. The Complexity of Boolean Networks , 1988 .

[3] M. Ray Mercer,et al. Demand Driven Simulation: BACKSIM , 1987, 24th ACM/IEEE Design Automation Conference.

[4] Ikuo Nakata,et al. Time-Optimal Short-Circuit Evaluation of Boolean Expressions , 1988, Inf. Process. Lett..

[5] Ernst G. Ulrich. Exclusive simulation of activity in digital networks , 1969, CACM.

[6] Philippe Flajolet,et al. The Average Height of Binary Trees and Other Simple Trees , 1982, J. Comput. Syst. Sci..

[7] Stephen A. Szygenda,et al. Digital Logic Simulation in a Time-Based, Table-Driven Environment , 1975, Computer.

[8] Ricardo A. Baeza-Yates,et al. On the Average Size of the Intersection of Binary Trees , 1992, SIAM J. Comput..

[9] Paul E. Dunne,et al. On the Complexity of Boolean Functions Computed by Lazy Oracles , 1995, IEEE Trans. Computers.

[10] Paul H. Leng,et al. Lazy simulation of digital logic , 1991, Comput. Aided Des..