Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Type architectures, shared memory, and the corollary of modest potential
Annual review of computer science vol. 1, 1986
The complexity of Boolean functions
The complexity of Boolean functions
Efficient parallel algorithms
Parallel program design: a foundation
Parallel program design: a foundation
A bridging model for parallel computation
Communications of the ACM
Introduction to algorithms
Computer arithmetic algorithms
Computer arithmetic algorithms
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
An introduction to parallel algorithms
An introduction to parallel algorithms
LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
Constant-Time Randomized Parallel String Matching
SIAM Journal on Computing
Introduction to Circuit Complexity: A Uniform Approach
Introduction to Circuit Complexity: A Uniform Approach
Models of Computation: Exploring the Power of Computing
Models of Computation: Exploring the Power of Computing
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Parallel Computer Architecture: A Hardware/Software Approach
Parallel Computer Architecture: A Hardware/Software Approach
The Designer's Guide to VHDL
Advanced Digital Design with the VERILOG HDL
Advanced Digital Design with the VERILOG HDL
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A VLSI Array Processing Oriented Fast Fourier Transform Algorithm and Hardware Implementation
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
| Hi-index | 0.00 |
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.