Efficient Simulations among Several Models of Parallel Computers
From MaRDI portal
(Redirected from Publication:3334992)
Recommendations
Cited in
(15)- Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs
- Real-time emulations of bounded-degree networks
- Parallel simulation by multi-instruction, longest-path algorithms
- Long-time simulations with complex code using multiple nodes of Intel Xeon Phi knights landing
- scientific article; zbMATH DE number 996551 (Why is no real title available?)
- A cylinder computation model for many-core parallel computing
- scientific article; zbMATH DE number 578414 (Why is no real title available?)
- scientific article; zbMATH DE number 1110778 (Why is no real title available?)
- Accurate emulators for large-scale computer experiments
- Modeling cost/performance of a parallel computer simulator
- Representing shared data on distributed-memory parallel computers
- scientific article; zbMATH DE number 1388892 (Why is no real title available?)
- Time-optimal simulations of networks by universal parallel computers
- New graph decompositions with applications to emulations
- Area-time tradeoffs for universal VLSI circuits
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)