DAG Mining for Code Compaction

Zitieren

Dateien zu dieser Ressource

Dateien Größe Format Anzeige

Zu diesem Dokument gibt es keine Dateien.

WERTH, Tobias, Marc WÖRLEIN, Alexander DREWEKE, Ingrid FISCHER, Michael PHILIPPSEN, 2009. DAG Mining for Code Compaction. In: CAO, Longbing, ed. and others. Data Mining for Business Applications. New York:Springer, pp. 209-223

@incollection{Werth2009Minin-2999, title={DAG Mining for Code Compaction}, year={2009}, address={New York}, publisher={Springer}, booktitle={Data Mining for Business Applications}, pages={209--223}, editor={Cao, Longbing}, author={Werth, Tobias and Wörlein, Marc and Dreweke, Alexander and Fischer, Ingrid and Philippsen, Michael} }

<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/2999"> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:issued>2009</dcterms:issued> <dc:creator>Wörlein, Marc</dc:creator> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:abstract xml:lang="eng">In order to reduce cost and energy consumption, code-size optimization is an important issue for embedded systems. Traditional instruction saving techniques recognize code duplications only in exactly the same order within the program. As instructions can be reordered with respect to their data dependencies, Procedural Abstraction achieves better results on data flow graphs that reflect these dependencies. Since these graphs are always directed acyclic graphs (DAGs), a special mining algorithm for DAGs is presented in this chapter. Using a new canonical representation that is based on the topological order of the nodes in a DAG, the proposed algorithm is faster and uses less memory than the general graph mining algorithm gSpan. Due to its search lattice expansion strategy, an efficient pruning strategy is applied to the algorithm while using it for Procedural Abstraction. Its search for unconnected graph fragments outperforms traditional approaches for code-size reduction.</dcterms:abstract> <dc:contributor>Fischer, Ingrid</dc:contributor> <dcterms:title>DAG Mining for Code Compaction</dcterms:title> <dc:rights>deposit-license</dc:rights> <dcterms:bibliographicCitation>Publ. in: Data Mining for Business Applications / Longbing Cao ... (eds.). New York: Springer, 2009, pp. 209-223</dcterms:bibliographicCitation> <dc:creator>Werth, Tobias</dc:creator> <dc:creator>Philippsen, Michael</dc:creator> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103416863-3868037-7"/> <dc:creator>Dreweke, Alexander</dc:creator> <dc:language>eng</dc:language> <dc:contributor>Dreweke, Alexander</dc:contributor> <dc:contributor>Werth, Tobias</dc:contributor> <dc:contributor>Wörlein, Marc</dc:contributor> <dc:creator>Fischer, Ingrid</dc:creator> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T10:15:42Z</dcterms:available> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/2999"/> <dc:contributor>Philippsen, Michael</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T10:15:42Z</dc:date> </rdf:Description> </rdf:RDF>

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto