Skip to main content
Communication Theory Lab
CTL
Communication Theory Lab
Home
News
Events
People
All People
Principal Investigator
Research Scientists
Postdoctoral Fellows
Students
Visiting Scholars
Former Members
Former Members from Texas A&M University
Former Members from University of Minnesota
Collaborators
Alumni
Research
Publications
Teaching
Funding
Media
Contact Us
stencil codes; Laplace; Jacobi iteration; memristor; in-memory computing;
Efficient Acceleration of Stencil Applications through In-Memory Computing
1 min read ·
Mon, Jun 29 2020
News
stencil codes; Laplace; Jacobi iteration; memristor; in-memory computing;
Circuits
Hasan Yantır, et al., "Efficient Acceleration of Stencil Applications through In-Memory Computing". Micromachines 11, 2020, 622. The traditional computer architectures severely suffer from the bottleneck between the processing elements and memory that is the biggest barrier in front of their scalability. Nevertheless, the amount of data that applications need to process is increasing rapidly, especially after the era of big data and artificial intelligence. This fact forces new constraints in computer architecture design towards more data-centric principles. Therefore, new paradigms such as in