Please wait a minute...
ZJUS-A
Journal of Zhejiang University-SCIENCE A (Applied Physics & Engineering)  2006, Vol. 7 Issue (10): 7-    DOI: 10.1631/jzus.2006.A1669
    
Parallel programming characteristics of a DSP-based parallel system
GAO Shu, GUO Qing-ping
School of Computer Science, Wuhan University of Technology, Wuhan 430063, China
Download:     PDF (0 KB)     
Export: BibTeX | EndNote (RIS)      

Abstract  This paper firstly introduces the structure and working principle of DSP-based parallel system, parallel accelerating board and SHARC DSP chip. Then it pays attention to investigating the system’s programming characteristics, especially the mode of communication, discussing how to design parallel algorithms and presenting a domain-decomposition-based complete multi-grid parallel algorithm with virtual boundary forecast (VBF) to solve a lot of large-scale and complicated heat problems. In the end, Mandelbrot Set and a non-linear heat transfer equation of ceramic/metal composite material are taken as examples to illustrate the implementation of the proposed algorithm. The results showed that the solutions are highly efficient and have linear speedup.

Key words： Parallel algorithm      Multi-grid      Domain decomposition      Virtual boundary forecast (VBF)      DSP-based parallel system     
Received: 23 January 2006     
CLC:  TP39  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
GAO Shu
GUO Qing-ping
Cite this article:

GAO Shu, GUO Qing-ping. Parallel programming characteristics of a DSP-based parallel system. Journal of Zhejiang University-SCIENCE A (Applied Physics & Engineering), 2006, 7(10): 7-.

URL:

http://www.zjujournals.com/xueshu/zjus-a/10.1631/jzus.2006.A1669     OR     http://www.zjujournals.com/xueshu/zjus-a/Y2006/V7/I10/7

[1] MISHRA P.K.. Optimal parallel Algorithm for Shortest Paths Problem on Interval Graphs[J]. Journal of Zhejiang University-SCIENCE A (Applied Physics & Engineering), 2004, 5(9): 1135-1143.
[2] MISHRA P.K.. An efficient parallel algorithm for shortest paths in planar layered digraphs[J]. Journal of Zhejiang University-SCIENCE A (Applied Physics & Engineering), 2004, 5(5): 518-527.