Optimizing toolkit-generated graphical interfaces

Zanden, Bradley T. Vander

doi:10.1145/192426.192491

Cited by 7 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(1) Previous studies have shown that redisplay time dominates the cost of all other operations in a graphical application [Hill 1993;Vander Zanden 1994]. One study of a set of Amulet applications revealed that the time spent traversing and invalidating dependencies constituted roughly 1% of the time consumed by an application [Vander Zanden et al 2001].…”

Section: Empirical Performancementioning

confidence: 99%

Using model dataflow graphs to reduce the storage requirements of constraints

Zanden

Halterman

2001

ACM Trans. Comput.-Hum. Interact.

Self Cite

View full text Add to dashboard Cite

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, dataflow 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. Our solution is based on the observation that objects derived from the same class use the same constraints, and thus have the same dataflow graphs. We represent the common dataflow patterns in a model dataflow graph that is stored with the class. 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 dataflow constraint systems, especially when a large number of constrained objects must be managed.

show abstract

Section: Empirical Performancementioning

confidence: 99%