Author

Hencken

Date of Award

12-1984

Degree Name

Master of Science

Department

Computer Science

First Advisor

Dr. Dionysios Kountanis

Second Advisor

Dr. Dalia Motzkin

Access Setting

Masters Thesis-Open Access

Abstract

An ever increasing number of processors are becoming available to the multiprocessor user. For faster response and efficient utilization of parallel processing systems it is necessary to develop parallel algorithms to solve a single problem.

This paper evaluates the complexity of resolution algorithms run in a parallel processing environment. An overview of parallel processing is presented along with a discussion of general resolution and resolution-refutation systems. An analysis of the complexity required by different control strategies to perform resolution programing is presented using both uniprocessor and multiprocessor systems.

Share

COinS