Browse Prior Art Database

A FUNCTIONAL LANGUAGE MACHINE BASED ON QUEUES

IP.com Disclosure Number: IPCOM000128343D
Original Publication Date: 1984-Dec-31
Included in the Prior Art Database: 2005-Sep-15
Document File: 35 page(s) / 88K

Publishing Venue

Software Patent Institute

Related People

Guang Liang Xiong: AUTHOR [+3]

Abstract

A Functional Language Machine Based on Queues by Guang Liang Xiong Master of Science in Computer Science University of California, Los Angeles, 1984 Professor Milos D. Ercegovac, Chair A machine organization based on queues is proposed to execute the Berkeley FP programs in the format of Q-code. The proposed machine consists of an instruction queue, a data queue, an execu-tion unit and memory modules. The overall organization and each part of the machine are described. Several alternatives for the main components are suggested and compared. The potentials of concurrent executions arc explored. A simulation package of the machine and its prr-formance are reported. The characteristics of the Q-machine include the simplicity of the organization, the beneficial implicit~address management, of the queues, the doubled bandwidth of memory access and the simplicity of the compilation. V1

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 5% of the total text.

Page 1 of 35

THIS DOCUMENT IS AN APPROXIMATE REPRESENTATION OF THE ORIGINAL.

A FUNCTIONAL LANGUAGE MACHINE BASED ON QUEUES

Guang Liang Xiong November 1984 Report No. CSD-840047

<>

UNIVERSITY OF CALIFORNIA

Los Angeles A Functional Language Machine Based on Queues

,..~.

A thesis submitted in partial satiaf:,ction of the requirement for the degree Master of science in Computer Science by Guang I,iang aiong n

1981I

Acknowledgement

The author is very grateful to Dr: Milos Ercegovac for his suggestion about the subject, his guidance and assistance in the research of the subject and the preparation of this thesis. The author is also grateful to Dr. Thomas Lang for his comments and assis-tance in the preparation of this thesis.

This research is supported in part by a grant from NASA Lewis Research Center NAG 3-132. v

ABSTRACT OF OFTilE THESIS

A Functional Language Machine Based on Queues by Guang Liang Xiong Master of Science in Computer Science University of California, Los Angeles, 1984 Professor Milos D. Ercegovac, Chair

A machine organization based on queues is proposed to execute the Berkeley FP programs in the format of Q-code.

The proposed machine consists of an instruction queue, a data queue, an execu-tion unit and memory modules.

The overall organization and each part of the machine are described. Several alternatives for the main components are suggested and compared. The potentials of concurrent executions arc explored. A simulation package of the machine and its prr-formance are reported.

The characteristics of the Q-machine include the simplicity of the organization, the beneficial implicit~address management, of the queues, the doubled bandwidth of memory access and the simplicity of the compilation. V1

UCLA Page 1 Dec 31, 1984

Page 2 of 35

A FUNCTIONAL LANGUAGE MACHINE BASED ON QUEUES

CHAPTER I Introduction

In 1978, Backus, in his well-known Turing Award lecture (1J, discussed a new style of programming language - functional programming language. The functional programming language breaks the circle of conventional programming languages and leads to a .new direction of programming style and computer architecture. There are numerous research projects, trying to develop a. suitable computer architecture to exe-cute programs in functional programming languages[101. As another attempt in this 'direction, a functional programming language machine based nn queues, is discussed in this thesis.

1.1 Functional Programming Languages

The conventional programming languages, such as COBOL, I~ort.ran, Pascal, etc., are characterised by Backus in (1J as "von Neuman" languages, because. they are are mainly based on the von Neuman computer model. These languages "use variables to imitate the computer's storage cells, control statements elaborate its jump and test instructions; and assignments imitate its fetching, storing, and arithmetic." [1)

- Along with the rapid advancement of hardware and the decrease in its cost., the concurrent executions, whic...