{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/20857"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/20857","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Fine-grain dataflow model and algorithms for visualization systems","abstract":"Dataflow computing model is a simple yet powerful mechanism for constructing distributed visualization applications that transform numerical data into images. However, current dataflow visualization systems have serious memory efficiency problems when processing large data sets. In this thesis, we have identified a class of visualization algorithms that require sublinear memory space and are suitable for implementation in these systems. These algorithms are so called fine-grain algorithms, as opposed to the coarse-grain approach adopted by most of the previous systems. The fine-grain algorithms and systems are studied within the framework of fine-grain dataflow computing in general, and the Syntax-directed Dataflow Transformation Method (SDTM) in particular, in this thesis. The SDTM model combines the dataflow programming paradigm with the syntax-directed translation techniques. The new model extends the classical dataflow model in which tokens and nodal functions are atomic. It allows structural definition of the tokens and explicitly states the sequence of nodal actions in relation to the token structures. Unlike previous systems that tend to introduce multiple copies of large data sets during execution, our system is more memory efficient. This efficiency is achieved by keeping a dynamically adjusted minimal window on the input data stream, through the use of attribute grammar to specify attribute dependency and data transformation. Based on the fine-grain algorithms and the SDTM model, we have built a fine-grain visualization system that exhibits faster speed, less memory usage, and higher CPU utilization than a typical coarse-grain system.","abstract_html":"Dataflow computing model is a simple yet powerful mechanism for constructing distributed visualization applications that transform numerical data into images. However, current dataflow visualization systems have serious memory efficiency problems when processing large data sets. In this thesis, we have identified a class of visualization algorithms that require sublinear memory space and are suitable for implementation in these systems. These algorithms are so called fine-grain algorithms, as opposed to the coarse-grain approach adopted by most of the previous systems. The fine-grain algorithms and systems are studied within the framework of fine-grain dataflow computing in general, and the Syntax-directed Dataflow Transformation Method (SDTM) in particular, in this thesis. The SDTM model combines the dataflow programming paradigm with the syntax-directed translation techniques. The new model extends the classical dataflow model in which tokens and nodal functions are atomic. It allows structural definition of the tokens and explicitly states the sequence of nodal actions in relation to the token structures. Unlike previous systems that tend to introduce multiple copies of large data sets during execution, our system is more memory efficient. This efficiency is achieved by keeping a dynamically adjusted minimal window on the input data stream, through the use of attribute grammar to specify attribute dependency and data transformation. Based on the fine-grain algorithms and the SDTM model, we have built a fine-grain visualization system that exhibits faster speed, less memory usage, and higher CPU utilization than a typical coarse-grain system.","abstract_has_math":false,"creators":["Song, Deyang"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Golin, Eric J."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-07T12:51:20Z","date_published":"2011-05-07T12:51:20Z","updated_at":"2026-07-22T22:25:16Z","subjects":["Computer Science"],"languages":["eng"],"rights":["Copyright 1994 Song, Deyang"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9416439","(UMI)AAI9416439"],"render_values":[{"text":"AAI9416439","href":null,"code":true},{"text":"(UMI)AAI9416439","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/20857","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Golin, Eric J."]},{"key":"dc:creator","label":"Author","values":["Song, Deyang"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-07T12:51:20Z","10000-01-01","1994"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 1994 Song, Deyang"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9416439","(UMI)AAI9416439","http://hdl.handle.net/2142/20857"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Dataflow computing model is a simple yet powerful mechanism for constructing distributed visualization applications that transform numerical data into images. However, current dataflow visualization systems have serious memory efficiency problems when processing large data sets. In this thesis, we have identified a class of visualization algorithms that require sublinear memory space and are suitable for implementation in these systems. These algorithms are so called fine-grain algorithms, as opposed to the coarse-grain approach adopted by most of the previous systems. The fine-grain algorithms and systems are studied within the framework of fine-grain dataflow computing in general, and the Syntax-directed Dataflow Transformation Method (SDTM) in particular, in this thesis. The SDTM model combines the dataflow programming paradigm with the syntax-directed translation techniques. The new model extends the classical dataflow model in which tokens and nodal functions are atomic. It allows structural definition of the tokens and explicitly states the sequence of nodal actions in relation to the token structures. Unlike previous systems that tend to introduce multiple copies of large data sets during execution, our system is more memory efficient. This efficiency is achieved by keeping a dynamically adjusted minimal window on the input data stream, through the use of attribute grammar to specify attribute dependency and data transformation. Based on the fine-grain algorithms and the SDTM model, we have built a fine-grain visualization system that exhibits faster speed, less memory usage, and higher CPU utilization than a typical coarse-grain system.","Made available in DSpace on 2011-05-07T12:51:20Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9416439.pdf: 5864681 bytes, checksum: 224fcc106da9c5784c3b317d187c7356 (MD5) Previous issue date: 1994","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:46:46Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:21:01-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"]},{"key":"dc:title","label":"Title","values":["Fine-grain dataflow model and algorithms for visualization systems"]}]}],"canonical_facts":{"dc:contributor":["Golin, Eric J."],"dc:creator":["Song, Deyang"],"dc:date":["2011-05-07T12:51:20Z","10000-01-01","1994"],"dc:description":["Dataflow computing model is a simple yet powerful mechanism for constructing distributed visualization applications that transform numerical data into images. However, current dataflow visualization systems have serious memory efficiency problems when processing large data sets. In this thesis, we have identified a class of visualization algorithms that require sublinear memory space and are suitable for implementation in these systems. These algorithms are so called fine-grain algorithms, as opposed to the coarse-grain approach adopted by most of the previous systems. The fine-grain algorithms and systems are studied within the framework of fine-grain dataflow computing in general, and the Syntax-directed Dataflow Transformation Method (SDTM) in particular, in this thesis. The SDTM model combines the dataflow programming paradigm with the syntax-directed translation techniques. The new model extends the classical dataflow model in which tokens and nodal functions are atomic. It allows structural definition of the tokens and explicitly states the sequence of nodal actions in relation to the token structures. Unlike previous systems that tend to introduce multiple copies of large data sets during execution, our system is more memory efficient. This efficiency is achieved by keeping a dynamically adjusted minimal window on the input data stream, through the use of attribute grammar to specify attribute dependency and data transformation. Based on the fine-grain algorithms and the SDTM model, we have built a fine-grain visualization system that exhibits faster speed, less memory usage, and higher CPU utilization than a typical coarse-grain system.","Made available in DSpace on 2011-05-07T12:51:20Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9416439.pdf: 5864681 bytes, checksum: 224fcc106da9c5784c3b317d187c7356 (MD5) Previous issue date: 1994","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:46:46Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:21:01-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"],"dc:identifier":["AAI9416439","(UMI)AAI9416439","http://hdl.handle.net/2142/20857"],"dc:language":["eng"],"dc:rights":["Copyright 1994 Song, Deyang"],"dc:subject":["Computer Science"],"dc:title":["Fine-grain dataflow model and algorithms for visualization systems"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:16Z"}