Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
431111 | Journal of Discrete Algorithms | 2009 | 11 Pages |
Abstract
The Boolean circuit has been an important model of parallel computation, but not many parallel algorithms have been designed on this model because it is ‘awkward to program.’ To overcome this drawback, we propose a description language for designing parallel algorithms on the Boolean circuit. This description language is to parallel algorithms what the pseudo-code is to sequential algorithms. Through example codes, we show that the description language is a convenient tool to design parallel algorithms due to its general iterative and recursive structures and the ease of modular design.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Kunsoo Park, Heejin Park, Woo-Chul Jeun, Soonhoi Ha,