Reducing the storage requirements of dataflow constraints using model dependencies

Author

Richard L. Halterman

Date of Award

5-1999

Degree Type

Dissertation

Degree Name

Doctor of Philosophy

Major

Computer Science

Major Professor

Bradley T. Vander Zanden

Committee Members

Michael Langston, Wayne Claycombe, James Plank

Abstract

Dataflow constraints allow programmers to specify relationships among application objects in a natural,declarative manner. Most constraint solvers represent these dataflow relationships as directed edges in a dependency graph. Unfortunately, dependency graphs require a great deal of storage. Consequently,an application with a large number of constraints can get pushed into virtual memory and performance degrades in interactive applications. The solution presented here is based on the observation that objects derived from the same prototype use the same constraints and thus have the same dependency graphs. The Common dependency patterns are represented in a model dependency graph that is stored in a prototype.Instance objects may derive explicit dependencies from this graph when the dependencies are needed.Model dependencies provide a useful new mechanism for improving the storage efficiency of data flow constraint systems, especially when a large number of constrained objects must be managed.

Recommended Citation

Halterman, Richard L., "Reducing the storage requirements of dataflow constraints using model dependencies. " PhD diss., University of Tennessee, 1999.
https://trace.tennessee.edu/utk_graddiss/8835