Bradley T. Vander Zanden
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:
- 1.ALPERT, S. R. Graceful interaction with graphical constraints. IEEE Computer Graphics and Applications 13, 2 (March 1993), 82-91. Google Scholar
Digital Library
- 2.DEMERS, A., REPS, T., AND TEITELBAUM, T. Incremental evaluation for attribute grammars with application to syntax-directed editors. In Proceedings of the Principles of Programming Languages Conference (Williamsburg, VA, Jan 1981), pp. 105-116. Google ScholarDigital Library
- 3.HENRY, T. R., AND HUDSON, S. E. Using active data in a uims. In ACM SIGGRAPH Symposium on User Interface Software and Technology (Banff, Alberta, Canada, Oct. 1988), Proceedings UIST'88, pp. 167- 178. Google ScholarDigital Library
- 4.HILL, R. D. The rendezvous constraint maintenance system. In ACM SIGGRAPH Symposium on User Interface Software and Technology (Atlanta, GA, Nov. 1993), Proceedings UIST'93, pp. 225-234. Google ScholarDigital Library
- 5.HUDSON, S. E. Incremental attribute evaluation: A flexible algorithm for lazy update. ACM TOPLAS 13, 3 (July 1991), 315-341. Google ScholarDigital Library
- 6.HUDSON, S. E. A system for efficient and flexible oneway constraint evaluation in C++. Tech. Rep. 93-15, Graphics Visualizaton and Usability Center, College of Computing, Georgia Institute of Technology, April 1993.Google Scholar
- 7.HUDSON, S.E. User interface specification using an enhanced spreadsheet model. ACM Transaction on Graphics 13, 3 (July 1994), 209-239. Google ScholarDigital Library
- 8.HUDSON, S. E. Personal communication, 1999.Google Scholar
- 9.HUDSON, S. E., AND SMITH, I. Ultra-lightweight constraints. In ACM SIGGRAPH Symposium on User Interface Software and Technology (Seattle, WA, Nov 1996), Proceedings UIST'96, pp. 147-155. Google ScholarDigital Library
- 10.MYERS, B. A., GIUSE, D. A., DANNENBERG, R. B., VANDER ZANDEN, B., KOSBIE, D. S., PERVIN, E., MICKISH, A., AND MARCHAL, P. Garnet: Comprehensive support for graphical, highly-interactive user interfaces. IEEE Computer 23, 11 (Nov. 1990), 71-85. Google ScholarDigital Library
- 11.MYERS, B. A., MCDANIEL, R., ROBERT MILLER, A. F., FAULRING, A., KYLE, B., MICKISH, A., KLIMOVITSKI, A., AND DOANE, P. The Amulet environment: New models for effective user interface software development. IEEE Transactions on Software Engineering 23, 6 (June 1997), 347-365. Google ScholarDigital Library
- 12.REPS, T., TEITELBAUM, T., AND DEMERS, A. Incremental context-dependent analysis for language-based editors. ACM TOPLAS 5, 3 (July 1983), 449-477. Google ScholarDigital Library
- 13.VANDER ZANDEN, B., MYERS, B. A., GIUSE, D., AND SZEKELY, P. Integrating pointer variables into one-way constraint models. ACM Transactions on Computer Human Interaction 1 (June 1994), 161-213. Google ScholarDigital Library
- 14.VANDER ZANDEN, B., AND VENCKUS, S. An empirical study of constraint usage in graphical applications. In ACM SIGGRAPH Symposium on User Interface Software and Technology (Seattle, WA, Nov. 1996), Proceedings UIST'96, pp. 137-146. Google ScholarDigital Library
Index Terms
- Reducing the storage requirements of constraint dataflow graphs
Recommendations
Using model dataflow graphs to reduce the storage requirements of constraints
Dataflow constraints allow programmers to easily specify relationships among application objects in a natural, declarative manner. Most constraint solvers represent these dataflow relationships as directed edges in a dataflow graph. Unfortunately, ...
Specializing planners for hierarchical multi-way dataflow constraint systems
GPCE '14A constraint system consists of variables and a set of constraints on those variables. To solve a constraint system is to find a valuation that satisfies all constraints; or the "best" subset of constraints if not all can simultaneously be satisfied. ...
Comments