Persistent Link:
http://hdl.handle.net/10150/291529
Title:
Heuristic search strategies on a dataflow computer
Author:
Machemer, Kevin Scott, 1958-
Issue Date:
1990
Publisher:
The University of Arizona.
Rights:
Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
Abstract:
In recent years, sweeping changes in computer architecture have been transpiring as the technology continues to advance. As the physical limits for computational speed are approached, different design alternatives to the standard von Neumann architecture must be explored. The static dataflow architecture is one of the new possibilities being examined and involves a completely different concept in computation. By programming an irregular computational problem such as a heuristic search strategy on a static dataflow computer, its usefulness for solving difficult problems can be demonstrated. A static dataflow computer has been defined by a hardware description language to simulate the heuristic search strategies. All the dataflow program graphs are given to show the natural parallelism being extracted from the irregular computational processes. The outcome exposes an essential need for the implementation of dataflow computer systems.
Type:
text; Thesis-Reproduction (electronic)
Keywords:
Engineering, Electronics and Electrical.; Artificial Intelligence.; Computer Science.
Degree Name:
M.S.
Degree Level:
masters
Degree Program:
Graduate College; Electrical and Computer Engineering
Degree Grantor:
University of Arizona
Advisor:
Hill, Fredrick J.

Full metadata record

DC FieldValue Language
dc.language.isoen_USen_US
dc.titleHeuristic search strategies on a dataflow computeren_US
dc.creatorMachemer, Kevin Scott, 1958-en_US
dc.contributor.authorMachemer, Kevin Scott, 1958-en_US
dc.date.issued1990en_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.description.abstractIn recent years, sweeping changes in computer architecture have been transpiring as the technology continues to advance. As the physical limits for computational speed are approached, different design alternatives to the standard von Neumann architecture must be explored. The static dataflow architecture is one of the new possibilities being examined and involves a completely different concept in computation. By programming an irregular computational problem such as a heuristic search strategy on a static dataflow computer, its usefulness for solving difficult problems can be demonstrated. A static dataflow computer has been defined by a hardware description language to simulate the heuristic search strategies. All the dataflow program graphs are given to show the natural parallelism being extracted from the irregular computational processes. The outcome exposes an essential need for the implementation of dataflow computer systems.en_US
dc.typetexten_US
dc.typeThesis-Reproduction (electronic)en_US
dc.subjectEngineering, Electronics and Electrical.en_US
dc.subjectArtificial Intelligence.en_US
dc.subjectComputer Science.en_US
thesis.degree.nameM.S.en_US
thesis.degree.levelmastersen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.disciplineElectrical and Computer Engineeringen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.contributor.advisorHill, Fredrick J.en_US
dc.identifier.proquest1340710en_US
dc.identifier.bibrecord.b26281685en_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.