Weak parallel machines: a new class of physically feasible parallel machine models
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3839293 (Why is no real title available?)
- scientific article; zbMATH DE number 3817043 (Why is no real title available?)
- scientific article; zbMATH DE number 3898246 (Why is no real title available?)
- scientific article; zbMATH DE number 3936518 (Why is no real title available?)
- scientific article; zbMATH DE number 3986649 (Why is no real title available?)
- scientific article; zbMATH DE number 1142308 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- Physical parallel devices are not much faster than sequential ones
- Towards a complexity theory of synchronous parallel computation
- Unbounded hardware is equivalent to deterministic Turing machines
Cited in
(5)- Parallel turing machines with one-head control units and cellular automata
- scientific article; zbMATH DE number 139618 (Why is no real title available?)
- scientific article; zbMATH DE number 2080916 (Why is no real title available?)
- Pipelined Decomposable BSP Computers
- Parallel machine models: how they are and where are they going
This page was built for publication: Weak parallel machines: a new class of physically feasible parallel machine models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096822)