Reducing the storage requirements of constraint dataflow graphs

Authors:
Bradley T. Vander Zanden;Richard L. Halterman
Affiliations:
Computer Science Department, University of Tennessee, Knoxville, TN;Computer Science Department, University of Tennessee, Knoxville, TN
Venue:
Proceedings of the 12th annual ACM symposium on User interface software and technology
Year:
1999

Citing 12
Cited 1

Using active data in a UIMS

UIST '88 Proceedings of the 1st annual ACM SIGGRAPH symposium on User Interface Software
Garnet: Comprehensive Support for Graphical, Highly Interactive User Interfaces

Computer
Incremental attribute evaluation: a flexible algorithm for lazy update

ACM Transactions on Programming Languages and Systems (TOPLAS)
The Rendezvous constraint maintenance system

UIST '93 Proceedings of the 6th annual ACM symposium on User interface software and technology
Integrating pointer variables into one-way constraint models

ACM Transactions on Computer-Human Interaction (TOCHI)
User interface specification using an enhanced spreadsheet model

ACM Transactions on Graphics (TOG)
An empirical study of constraint usage in graphical applications

Proceedings of the 9th annual ACM symposium on User interface software and technology
Ultra-lightweight constraints

Proceedings of the 9th annual ACM symposium on User interface software and technology
The Amulet Environment: New Models for Effective User Interface Software Development

IEEE Transactions on Software Engineering
Incremental Context-Dependent Analysis for Language-Based Editors

ACM Transactions on Programming Languages and Systems (TOPLAS)
Incremental evaluation for attribute grammars with application to syntax-directed editors

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Graceful Interaction with Graphical Constraints

IEEE Computer Graphics and Applications

Using model dataflow graphs to reduce the storage requirements of constraints

ACM Transactions on Computer-Human Interaction (TOCHI)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most one-way constraint solvers use directed dataflow graphs to represent the dependencies among variables in a constraint. Unfortunately, dataflow graphs require a great deal of storage. These storage costs can help push a large application into virtual memory, thus significantly degrading interactive performance. Reducing the storage costs of dataflow graphs is therefore an important goal in constraint research. This paper describes a study that makes two contributions to solving this problem: