Cited 0 time in
Boolean circuit programming: A new paradigm to design parallel algorithms
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Park, Kunsoo | - |
| dc.contributor.author | Park, Heejin | - |
| dc.contributor.author | Jeun, Woo-Chul | - |
| dc.contributor.author | Ha, Soonhoia | - |
| dc.date.accessioned | 2022-12-20T21:50:51Z | - |
| dc.date.available | 2022-12-20T21:50:51Z | - |
| dc.date.issued | 2009-06 | - |
| dc.identifier.issn | 1570-8667 | - |
| dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/176640 | - |
| dc.description.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. | - |
| dc.format.extent | 11 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | Elsevier BV | - |
| dc.title | Boolean circuit programming: A new paradigm to design parallel algorithms | - |
| dc.type | Article | - |
| dc.publisher.location | 네델란드 | - |
| dc.identifier.doi | 10.1016/j.jda.2008.08.004 | - |
| dc.identifier.scopusid | 2-s2.0-64149086683 | - |
| dc.identifier.bibliographicCitation | Journal of Discrete Algorithms, v.7, no.2, pp 267 - 277 | - |
| dc.citation.title | Journal of Discrete Algorithms | - |
| dc.citation.volume | 7 | - |
| dc.citation.number | 2 | - |
| dc.citation.startPage | 267 | - |
| dc.citation.endPage | 277 | - |
| dc.type.docType | Article | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.subject.keywordPlus | Boolean circuit | - |
| dc.subject.keywordPlus | Description language | - |
| dc.subject.keywordPlus | Modular designs | - |
| dc.subject.keywordPlus | Parallel computations | - |
| dc.subject.keywordPlus | Parallel models | - |
| dc.subject.keywordPlus | Pseudo codes | - |
| dc.subject.keywordPlus | Recursive structures | - |
| dc.subject.keywordPlus | Sequential algorithms | - |
| dc.subject.keywordPlus | Linguistics | - |
| dc.subject.keywordPlus | Mathematical models | - |
| dc.subject.keywordPlus | Parallel processing systems | - |
| dc.subject.keywordPlus | Parallel algorithms | - |
| dc.subject.keywordAuthor | Boolean circuit | - |
| dc.subject.keywordAuthor | Description language | - |
| dc.subject.keywordAuthor | Parallel algorithms | - |
| dc.subject.keywordAuthor | Parallel models | - |
| dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S1570866709000185?via%3Dihub | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1366
COPYRIGHT © 2024 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
