scientific article; zbMATH DE number 176730
From MaRDI portal
Publication:4036559
Recommendations
- The complexity of reconfiguring network models
- Simulating the CRCW PRAM on reconfigurable networks
- Two dimensional processor array with a reconfigurable bus system is at least as powerful as CRCW model
- A Logical Topology and Discrete Capacity Assignment Algorithm for Reconfigurable Networks
- A model of reconfiguration in communicating sequential processes
Cited in
(19)- An O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh
- Optimal simulation of multidimensional reconfigurable meshes by two- dimensional reconfigurable meshes
- A new computation of shape moments via quadtree decomposition
- Parallel c-means algorithm for image segmentation on a reconfigurable mesh computer
- The cylindrical banyan multicomputer: A reconfigurable systolic architecture
- Reconfigurable meshes and image processing
- Integer summing algorithms on reconfigurable meshes
- Deriving algorithms on reconfigurable networks based on function decomposition
- A neural sorting network with O(1) time complexity
- The Reduceron reconfigured and re-evaluated
- Optimal algorithms for dissemination of information in generalized communication modes
- scientific article; zbMATH DE number 3854444 (Why is no real title available?)
- A model of reconfiguration in communicating sequential processes
- Multiple search problem on reconfigurable meshes
- scientific article; zbMATH DE number 431981 (Why is no real title available?)
- Simulating shared memory in real time: On the computation power of reconfigurable architectures
- Relating the power of the multiple associative computing (MASC) model to that of reconfigurable bus-based models
- Efficient minimum spanning tree algorithms on the reconfigurable mesh
- Simulations between two reconfigurable mesh models
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036559)
