Skip to search formSkip to main contentSkip to account menu

SIMD

Known as: Single Instruction Multiple Data, Single instruction, multiple data, SIMD lane 
Single instruction, multiple data (SIMD), is a class of parallel computers in Flynn's taxonomy. It describes computers with multiple processing… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
APE100ARM Cortex-A7ARM Cortex-A9AVR32

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Performance Evaluation of NAS Parallel Benchmarks on Intel Xeon Phi
NAS parallel benchmarks (NPB) are a set of applications commonly used to evaluate parallel systems. We use the NPB-OpenMP version… 
Highly Cited
2010
Highly Cited
2010
Optimizing and tuning the fast multipole method for state-of-the-art multicore architectures
This work presents the first extensive study of single-node performance optimization, tuning, and analysis of the fast multipole… 
2006
2006
An asynchronous cellular logic network for trigger-wave image processing on fine-grain massively parallel arrays
  • P. Dudek
  • IEEE Transactions on Circuits and Systems - II…
  • 2006
  • Corpus ID: 43333080
Massively parallel processor-per-pixel single-instruction multiple data arrays are being successfully used for early vision… 
2005
2005
Software Defined Radio - A High Performance Embedded Challenge
Wireless communication is one of the most computationally demanding workloads. It is performed by mobile terminals (“cell phones… 
Review
2002
Review
2002
Overview of research efforts on media ISA extensions and their usage in video coding
This paper summarizes the results of over 25 research groups or individual researchers that have presented video coding… 
Highly Cited
1995
Highly Cited
1995
A massively parallel approach to real-time vision-based road markings detection
  • Alberto Broggi
  • Proceedings of the Intelligent Vehicles '95…
  • 1995
  • Corpus ID: 379505
This paper presents the vision-based road detection system currently operative onto the MOB-LAB land vehicle. Based on a full… 
1990
1990
Finite element analysis on the connection machine
1987
1987
The APE computer: An array processor optimized for lattice gauge theory simulations
Highly Cited
1987
Highly Cited
1987
Supporting Divide-and-Conquer Algorithms for Image Processing
  • Q. Stout
  • J. Parallel Distributed Comput.
  • 1987
  • Corpus ID: 3073446
1987
1987
An Optimal Randomized Routing Algorithm for the Mesh and A Class of Efficient Mesh-like Routing Networks
We present an optimal oblivious randomized algorithm for permutation routing on the MIMD version of Mesh. Our routing algorithm… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)