Efficient Simulations among Several Models of Parallel Computers
From MaRDI portal
Publication:3334992
DOI10.1137/0215008zbMATH Open0545.68043OpenAlexW2027170075MaRDI QIDQ3334992FDOQ3334992
Authors: Friedhelm Meyer auf der Heide 
Publication date: 1985
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-5931
Recommendations
Analysis of algorithms and problem complexity (68Q25) Abstract data types; algebraic specification (68Q65) Theory of operating systems (68N25)
Cited In (15)
- Area-time tradeoffs for universal VLSI circuits
- Time-optimal simulations of networks by universal parallel computers
- Parallel simulation by multi-instruction, longest-path algorithms
- Long-time simulations with complex code using multiple nodes of Intel Xeon Phi knights landing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Real-time emulations of bounded-degree networks
- Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs
- A cylinder computation model for many-core parallel computing
- Representing shared data on distributed-memory parallel computers
- Modeling cost/performance of a parallel computer simulator
- Accurate emulators for large-scale computer experiments
- Title not available (Why is that?)
- Title not available (Why is that?)
- New graph decompositions with applications to emulations
This page was built for publication: Efficient Simulations among Several Models of Parallel Computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3334992)
