TITLE

Efficient parallel processing with spin-wave nanoarchitectures

AUTHOR(S)
Eshaghian-Wilner, Mary; Navab, Shiva
PUB. DATE
August 2009
SOURCE
Journal of Supercomputing;Aug2009, Vol. 49 Issue 2, p248
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
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 fault-tolerant 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 application examples to illustrate the operation of the proposed generic parallel techniques.
ACCESSION #
43751105

 

Related Articles

  • AN IMPLEMENTATION OF A PARALLEL ITERATIVE ALGORITHM FOR THE SOLUTION OF LARGE BANDED SYSTEM ON A CLUSTER OF WORKSTATIONS. Al-Towaiq, M.; Masoud, F. A. M.; Mnaouer, A. B.; Day, K. // International Journal of Modelling & Simulation;2008, Vol. 28 Issue 4, p378 

    In this paper, we present a parallel iterative solution for large banded systems of linear equations based on incomplete LU-factorization (ILU). A master--workers parallel computing scheme is used. The proposed algorithm incurs reduced storage and communication overhead as compared to previous...

  • AN INVESTIGATIVE STUDY TO DETERMINE THE BEST PARALLEL PROGRAMMING CONSTRUCTS FOR DIFFERENT CASES. Israr, Zohra; Shereen, Muneeba; Farooq, Umar; Rabbi, Ihsan; Khan, Aurangzeb // Science International;Sep/Oct2016, Vol. 28 Issue 5, p4363 

    The well-known programming languages, now adays, provide parallel constructs to utilise the current parallel architectures for faster execution of the programs. In this article, we utilise the three most widely used, parallel repetitive constructs of, C# language, to explore the functionality of...

  • Optimizing I/O server placement for parallel I/O on switch-based irregular networks. Lin, Yih-Fang; Wang, Chien-Min; Wu, Jan-Jan // Journal of Supercomputing;Jun2006, Vol. 36 Issue 3, p201 

    In this paper, we study I/O server placement for optimizing parallel I/O performance on switch-based clusters, which typically adopt irregular network topologies to allow construction of scalable systems with incremental expansion capability. Finding optimal solution to this problem is...

  • Performance Comparison of Parallel Programming Environments for Implementing AIAC Algorithms. Bahi, Jacques; Contassot-Vivier, Sylvain; Couturier, RaphaĆ«l // Journal of Supercomputing;Mar2006, Vol. 35 Issue 3, p227 

    AIAC algorithms (Asynchronous Iterations Asynchronous Communications) are a particular class of parallel iterative algorithms. Their asynchronous nature makes them more efficient than their synchronous counterparts in numerous cases as has already been shown in previous works. The first goal of...

  • Non-Strict Execution in Parallel and Distributed Computing. Cristobal-Salas, Alfredo; Tchernykh, Andrei; Gaudiot, Jean-Luc; Lin, Wen-Yen // International Journal of Parallel Programming;Apr2003, Vol. 31 Issue 2, p77 

    This paper surveys and demonstrates the power of non-strict evaluation in applications executed on distributed architectures. We present the design, implementation, and experimental evaluation of single assignment, incomplete data structures in a distributed memory architecture and Abstract...

  • A Compositional Framework for Developing Parallel Programs on Two-Dimensional Arrays. Emoto, Kento; Hu, Zhenjiang; Kakehi, Kazuhiko; Takeichi, Masato // International Journal of Parallel Programming;Dec2007, Vol. 35 Issue 6, p615 

    Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, but development of efficient parallel programs on two-dimensional arrays is known to be hard. In this paper, we...

  • Parallel processing of multicomponent seismic data. Falfushinsky, V. V. // Cybernetics & Systems Analysis;Mar2011, Vol. 47 Issue 2, p330 

    n algorithm for processing multicomponent seismic data is proposed. It is implemented in and its performance is measured on the Inparcom cluster. Several improvements are applied to speed up the program and to reduce the filesystem load, in particular, local folders are used to store temporary...

  • Leveraging computation sharing and parallel processing in location-dependent query processing. Cazalas, Jonathan; Guha, Ratan // Journal of Supercomputing;Jul2012, Vol. 61 Issue 1, p215 

    A variety of research exists for the processing of continuous queries in large, mobile environments. Each method tries, in its own way, to address the computational bottleneck of constantly processing so many queries. In this paper, we introduce an efficient and scalable system for monitoring...

  • Performance Prediction and Evaluation of Parallels Processing on a NUMA Multiprocessor. Xiaodong Zhang; Xiaohan Qin // IEEE Transactions on Software Engineering;Oct91, Vol. 17 Issue 10, p1059 

    Non-Uniform Memory Access (NUMA) architectures make it possible to build large-scale, shared-memory multiprocessor systems, in comparison with nonscalable Uniform Memory Access (UMA) architectures. Most NUMA multiprocessor operations such as scheduling and synchronizing processes, accessing data...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics