ACM Home Page
Please provide us with feedback. Feedback
Lessons learned about one-way, dataflow constraints in the Garnet and Amulet graphical toolkits
Full text PdfPdf (323 KB)
Source ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 23 ,  Issue 6  (November 2001) table of contents
Pages: 776 - 796  
Year of Publication: 2001
ISSN:0164-0925
Authors
Bradley T. Vander Zanden  University of Tennessee, Knoxville, TN
Richard Halterman  University of Tennessee, Knoxville, TN
Brad A. Myers  Carnegie Mellon University, Pittsburgh, PA
Rich McDaniel  Carnegie Mellon University, Pittsburgh, PA
Rob Miller  Carnegie Mellon University, Pittsburgh, PA
Pedro Szekely  USC/Information Sciences Institute, Marina del Rey, CA
Dario A. Giuse  Vanderbilt University Medical Center, Nashville, TN
David Kosbie  Microsoft Corporation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 48,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/506315.506318
What is a DOI?

ABSTRACT

One-way, dataflow constraints are commonly used in graphical interface toolkits, programming environments, and circuit applications. Previous papers on dataflow constraints have focused on the design and implementation of individual algorithms. In contrast, this article focuses on the lessons we have learned from a decade of implementing competing algorithms in the Garnet and Amulet graphical interface toolkits. These lessons reveal the design and implementation tradeoffs for different one-way, constraint satisfaction algorithms. The most important lessons we have learned are that (1) mark-sweep algorithms are more efficient than topological ordering algorithms; (2) lazy and eager evaluators deliver roughly comparable performance for most applications; and (3) constraint satisfaction algorithms have more than adequate speed, except that the storage required by these algorithms can be problematic.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
3
4
 
5
6
7
8
 
9
10
 
11
12
 
13
Hudson, S. E. 1993. A system for efficient and flexible one-way constraint evaluation in C++. Tech. Rep. 93-15, Graphics Visualizaton and Usability Center, College of Computing, Georgia Institute of Technology. April.
14
15
 
16
Knuth, D. 1968. Semantics of context-free languages. Math. Syst. Theor. 2, 127--145.
17
18
19
 
20
 
21
22
 
23
24
25
26
27
 
28
Sussman, G. and Steele, G. 1980. Constraints--a language for experessing almost-hierarchical descriptions. Artif. Intell. 14, 1--39.
29
30
31
32


Collaborative Colleagues:
Bradley T. Vander Zanden: colleagues
Richard Halterman: colleagues
Brad A. Myers: colleagues
Rich McDaniel: colleagues
Rob Miller: colleagues
Pedro Szekely: colleagues
Dario A. Giuse: colleagues
David Kosbie: colleagues