BIDDLE: a bidirectional data driven Lisp engine

Author

Wong, W.F. ; Yuen, C.K.

Author_Institution

Dept. of Inf. Syst. & Comput. Sci., Nat. Univ. of Singapore, Singapore

fYear

1989

fDate

23-25 Oct 1989

Firstpage

207

Lastpage

214

Abstract

The authors propose BIDDLE, a direct execution architecture for Lisp based on both data- and demand-driven principles. A priority queuing mechanism is used to control the parallelism and the workload of the processing elements. Also introduced is a novel mechanism whereby the sequential semantics of Lisp can be enforced in such a way as not to reduce the parallelism too drastically. BIDDLE is, therefore, aimed at achieving a balance between eager and lazy evaluation, sequential semantics, and parallelism. At present, BIDDLE exists only on paper and is a long way from hard ware implementation

Keywords

LISP; parallel architectures; special purpose computers; BIDDLE; bidirectional data driven Lisp engine; direct execution architecture; eager evaluation; lazy evaluation; parallelism; priority queuing mechanism; processing elements; sequential semantics; Application software; Artificial intelligence; Computer architecture; Computer languages; Computer science; Engines; Hardware; Information systems; Parallel processing; Parallel programming;

fLanguage

English

Publisher

ieee

Conference_Titel

Tools for Artificial Intelligence, 1989. Architectures, Languages and Algorithms, IEEE International Workshop on

Conference_Location

Fairfax, VA

Print_ISBN

0-8186-1984-8

Type

conf

DOI

10.1109/TAI.1989.65322

Filename

65322