Lessons learned about one-way, dataflow constraints in the Garnet and Amulet graphical toolkits Export

@article{citeulike:258815, 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.}, address = {New York, NY, USA}, author = {Bradley and Halterman, Richard and Myers, Brad A. and Mcdaniel, Rich and Miller, Rob and Szekely, Pedro and Giuse, Dario A. and Kosbie, David}, citeulike-article-id = {258815}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=506315.506318}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/506315.506318}, doi = {10.1145/506315.506318}, issn = {0164-0925}, journal = {ACM Trans. Program. Lang. Syst.}, keywords = {amulet, constraintsolving, dataflow, garnet, graphicaltoolkit}, month = {November}, number = {6}, pages = {776--796}, posted-at = {2005-07-18 12:33:51}, priority = {2}, publisher = {ACM Press}, title = {Lessons learned about one-way, dataflow constraints in the Garnet and Amulet graphical toolkits}, url = {http://dx.doi.org/10.1145/506315.506318}, volume = {23}, year = {2001} }

TY - JOUR ID - citeulike:258815 L3 - citeulike-article-id:258815 N2 - 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. IS - 6 JF - ACM Trans. Program. Lang. Syst. SN - 0164-0925 AD - New York, NY, USA EP - 796 TI - Lessons learned about one-way, dataflow constraints in the Garnet and Amulet graphical toolkits PB - ACM Press VL - 23 SP - 776 KW - amulet KW - constraintsolving KW - dataflow KW - garnet KW - graphicaltoolkit AU - Bradley AU - Halterman, Richard AU - Myers, Brad AU - Mcdaniel, Rich AU - Miller, Rob AU - Szekely, Pedro AU - Giuse, Dario AU - Kosbie, David PY - 2001/11// UR - http://dx.doi.org/10.1145/506315.506318 ER -