Date

May 1986

Document Type

Thesis

Degree Name

M.S.

Department

Dept. of Computer Science and Engineering

Institution

Oregon Graduate Center

Abstract

The G-Machine is an abstract architecture that supports languages with graph computing models by utilizing software technologies to provide efficient graph manipulation on sequential machines. Graph computing models are different than those for standard imperative languages, and support for graph manipulation is generally lacking on machines designed for standard imperative languages. The architecture is stack-based and manipulates graphs via pointers, a pointer stack, and tagged memories. The tags and pointer stack also help provide an effective method of performing "lazy" evaluation, a computing technique that allows for execution of many complex algorithms. In this thesis, the abstract G-Machine Architecture has been redefined to provide a co-processor implementation. The heart of the G-Machine co-processor is the Program Execution Unit (PCU), a conceptually simple processor which can be implemented in a variety of ways. A design for the PCU is shown that is simple to build and program, utilizes existing technology, and provides complete support for the abstract G-Machine architecture.

Identifier

doi:10.6083/M41V5BXW

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.