Multiprocessor simulation strategies with optimal speed-up

DOI10.1016/0020-0190(94)00226-OzbMath0875.68499OpenAlexW1963630387MaRDI QIDQ1349734

Paul H. Leng, Chris J. Gittings, Paul E. Dunne

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00226-o

zbMATH Keywords

Parallel algorithmsParallel processingAnalysis of algorithmsLogic simulation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Time-optimal short-circuit evaluation of Boolean expressions
• The average height of binary trees and other simple trees
• Lazy simulation of digital logic
• On the Average Size of the Intersection of Binary Trees
• On the complexity of Boolean functions computed by lazy oracles

This page was built for publication: Multiprocessor simulation strategies with optimal speed-up