Name
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.jda.2008.08.004 | J. Discrete Algorithms |
Keywords | Field | DocType |
parallel algorithm,boolean circuit programming,description language,recursive structure,parallel computation,parallel algorithms,important model,boolean circuit,convenient tool,example code,new paradigm,parallel models,general iterative,modular design,boolean circuits,parallel computer | Analysis of parallel algorithms,Boolean circuit,Circuit complexity,Parallel algorithm,Computer science,Theoretical computer science,Parallel programming model,Bulk synchronous parallel,Circuit minimization for Boolean functions,Cost efficiency | Journal |
Volume | Issue | ISSN |
7 | 2 | Journal of Discrete Algorithms |
Citations | PageRank | References |
1 | 0.38 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kunsoo Park | 1 | 1396 | 171.00 |
| Heejin Park | 2 | 235 | 21.63 |
| Woo-Chul Jeun | 3 | 65 | 4.78 |
| Soonhoi Ha | 4 | 1684 | 174.65 |