|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| F.N. Sibai, K.L. Watson, Mi Lu, "A Parallel Unification Machine," IEEE Micro, vol. 10, no. 4, pp. 21-33, July/August, 1990. | |||
| BibTex | x | ||
| @article{ 10.1109/40.57728, author = {F.N. Sibai and K.L. Watson and Mi Lu}, title = {A Parallel Unification Machine}, journal ={IEEE Micro}, volume = {10}, number = {4}, issn = {0272-1732}, year = {1990}, pages = {21-33}, doi = {http://doi.ieeecomputersociety.org/10.1109/40.57728}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - MGZN JO - IEEE Micro TI - A Parallel Unification Machine IS - 4 SN - 0272-1732 SP21 EP33 EPD - 21-33 A1 - F.N. Sibai, A1 - K.L. Watson, A1 - Mi Lu, PY - 1990 VL - 10 JA - IEEE Micro ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/40.57728
A parallel unification machine (PUM) that speeds up the unification algorithm is proposed. The PUM partitions unification into a match step and a consistency-check step, conducts these two steps concurrently, and takes advantage of the match parallelism. The machine architecture, algorithms, data formats, and processor organization are described. The machine has been simulated at the register-transfer level with the ISPS computer description language. The simulated performance is compared with that of two serial unification coprocessors. Significant speedup is observed.
Citation:
F.N. Sibai, K.L. Watson, Mi Lu, "A Parallel Unification Machine," IEEE Micro, vol. 10, no. 4, pp. 21-33, July-Aug. 1990, doi:10.1109/40.57728
Usage of this product signifies your acceptance of the Terms of Use.

