Parallel Random Access Machines without Boolean operations
Document Type
Article
Publication Date
6-1-1994
Abstract
The class of problems solved within given time and processor bounds on a Parallel Random Access Machine (PRAM) varies with the instruction set. Previous research has classified the contributions of various instructions, such as multiplication, shifts, and string manipulation operations, to the PRAM. This paper examines the significant contribution of Boolean operations, which play essential roles in many PRAM algorithms and in simulations by the PRAM of other models of computation.
Publication Source (Journal or Book title)
Parallel Processing Letters
First Page
117
Last Page
124
Recommended Citation
Trahan, J., & Bhanukumar, H. (1994). Parallel Random Access Machines without Boolean operations. Parallel Processing Letters, 4 (1-2), 117-124. Retrieved from https://repository.lsu.edu/eecs_pubs/1761