2008
DOI: 10.1007/s11227-008-0237-6
|View full text |Cite
|
Sign up to set email alerts
|

Efficient parallel processing with spin-wave nanoarchitectures

Abstract: In this paper, we study the algorithm design aspects of three newly developed spin-wave architectures. The architectures are capable of simultaneously transmitting multiple signals using different frequencies, and allow for concurrent read/write operations. Using such features, we show a number of parallel and faulttolerant routing schemes and introduce a set of generic parallel processing techniques that can be used for design of fast algorithms on these spin-wave architectures. We also present a set of appli… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
3
2

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 42 publications
0
5
0
Order By: Relevance
“…In the second method, we use spin-wave switches to TAB L E 9 .9 . Frequency Assignments in the First Method of Demultiplexer Implementation [14]. Afterwards, we show how to extend the first implementation if a simple shifter to design a p-shifter.…”
Section: Nanoscale Spin-wave Shiftermentioning
confidence: 99%
“…In the second method, we use spin-wave switches to TAB L E 9 .9 . Frequency Assignments in the First Method of Demultiplexer Implementation [14]. Afterwards, we show how to extend the first implementation if a simple shifter to design a p-shifter.…”
Section: Nanoscale Spin-wave Shiftermentioning
confidence: 99%
“…So, this architecture represents a new approach for designing nanometer-scale computational structures, thus aiming to preserve the main advantages of wave-based computers [21][22][23][24]. of the spin-wave paths.…”
Section: Image Processing Algorithmsmentioning
confidence: 99%
“…In this section, we study different image processing algorithms on the spinwave reconfigurable mesh architecture [22]. We first show that given an N 1/2 Â N 1/2 image, using a N Â N spin-wave reconfigurable mesh, in O(1) time, the figures can be labeled and their nearest neighbor and convex hull can be found.…”
Section: Image Processing Algorithmsmentioning
confidence: 99%
See 1 more Smart Citation
“…In the following section, the generic parallel techniques are presented [1,2]. For example, if ten waves are sending a ''1,'' then their analog sum through their cumulative amplitude is computed instantly as 10.…”
Section: Parallel Algorithm Design Techniquesmentioning
confidence: 99%