ACM Home Page
Please provide us with feedback. Feedback
An incremental algorithm for satisfying hierarchies of multiway dataflow constraints
Full text PdfPdf (3.23 MB)
Source ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 18 ,  Issue 1  (January 1996) table of contents
Pages: 30 - 72  
Year of Publication: 1996
ISSN:0164-0925
Author
Brad Vander Zanden  Univ. of Tennessee, Knoxville
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 47,   Citation Count: 21
Additional Information:

abstract   references   cited by   index terms   review   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/225540.225543
What is a DOI?

ABSTRACT

One-way dataflow constraints have gained popularity in many types of interactive systems because of their simplicity, efficiency, and manageability. Although it is widely acknowledged that multiway dataflow constraint could make it easier to specify certain relationships in these applications, concerns about their predictability and efficiency have impeded their acceptance. Constraint hierarchies have been developed to address the predictability problem, and incremental algorithms have been developed to address the efficiency problem. However, existing incremental alogrithms for satisfying constraint hierarchies encounter two difficulties : (1) they are incapable of guaranteeing an acylic solution if a constraint hierarchy has one or more cyclic solutions and (2) they require worst-case exponential time to satisfy systems of multioutput constriants. This article surmounts these difficulties by presenting an incremental algorithm called QuickPlan that satisfies in worst-case O(N2) time any hierarchy of multiway, multiout-put dataflow constraint that has at least one acyclic solution, where N is the number of constraints. With benchmarks and real problems that can be solved efficiently using exisitng algorithms, its performance is competitive or superior. With benchmarks and real problems that cannot be solved using exisitng algorithms or that cannot be solved efficiently, QuickPlan finds solutions and does so efficiently, typically in O(N) time or less. QuickPlan is based on the strategy of propagation of degrees of freedom. The only restriction it imposes is that every constraint method must use all of the variables in the constraint as either an input or an output variable. This requirement is met in every constraint-based, interactive application that we have developed or seen.


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
BORNING, A., MAHER, M., MARTINDALE, A., AND WILSON, M. 1989. Constraint hierarchies and logic programming. In Proceedings of the 6th International Logic Programming Conference (Lisbon, Portugal). 149-164.
8
 
9
 
10
DINCBAS, M., HENTENRYCK, P. V., SIMONIS, H., AGGOUN, A., GRAF, T., AND BERTHEIR, F. 1988. The constraint logic programming language Chip. In Proceedings of the International Conference on Fifth Generation Computer Systems 1988. ICOT, Tokyo, 249-264.
 
11
12
13
 
14
GANGNET, M. AND ROSENBERG, B. 1992. Constraint programming and graph algorithms. In the 2nd International Symposium on Artificial Intelligence and Mathematics.
 
15
GLEICHER, M. AND WITKIN, A. 1991. Differential manipulation. In Proceedings of Graphics Interface. 61-67.
16
 
17
 
18
GOSLING, J. 1983. Algebraic constraints. Tech. Rep. CMU-(X-83-132, Computer Science Dept., Carnegie Mellon Univ., Pittsburgh, Pa.
 
19
20
21
22
 
23
24
25
26
 
27
HUYNH, T., b%SEZ, C., AND LASSEZ, J.-L. 1992. Practical issues on the projection of polyhedral sets. Ann. Math. Artif. Zntell. 6, 295-316.
28
 
29
LASSEZ, C. AND bSSEZ, J.-L. 1991. Quantifier elimination for conjunctions of linear constraints via a convex hull algorithm. Tech. Rep. Res. Rep. RC 16779, IBM.
 
30
 
31
32
 
33
34
 
35
 
36
37
 
38
SANNELLA, M. AND BORNING, A. 1992. Multi-Garnet: Integrating multi-way constraints with Garnet. Tech. Rep. 92-07-01, Dept. of Computer Science and Engineering, University of Wash., Seattle, Wash. Sept.
 
39
 
40
 
41
STEELE, G. L., JR. 1980. The definition and implementation of a computer programming language based on constraints. Ph.D. thesis, Dept. of Computer Science, MIT, Boston, Mass.
 
42
SUTHERLAND, I. E. 1963. Sketchpad.: A man-machine graphical communication system. In the AFIPS Spring Joint Computer Conference. Vol. 23. AFIPS, Montvale, N.J., 329-346.
43
 
44
 
45
 
46
47
48
 
49
WITKIN, A. AND WELCH, W. 1990. Fast animation and control of nonrigid structures. Comput. Graph. 24, 243-252.

CITED BY  21


REVIEW

"Michael G. Murphy : Reviewer"

Simplicity, efficiency, and manageability are reasons why one-way dataflow constraints are gaining popularity in various interactive systems. Multiway dataflow constraints make it easy to specify certain relationships, but predictability and e  more...