Graph-Based Procedural Abstraction

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:1f233ac8e4c939749d49a7033a18b34b

DREWEKE, Alexander, Marc WÖRLEIN, Ingrid FISCHER, Dominic SCHELL, Thorsten MEINL, Michael PHILIPPSEN, 2007. Graph-Based Procedural Abstraction. International Symposium on Code Generation and Optimization (CGO'07). San Jose, CA, USA, 11. Mär 2007 - 14. Mär 2007. In: International Symposium on Code Generation and Optimization (CGO'07). International Symposium on Code Generation and Optimization (CGO'07). San Jose, CA, USA, 11. Mär 2007 - 14. Mär 2007. IEEE, pp. 259-270. ISBN 0-7695-2764-7. Available under: doi: 10.1109/CGO.2007.14

@inproceedings{Dreweke2007-03Graph-5640, title={Graph-Based Procedural Abstraction}, year={2007}, doi={10.1109/CGO.2007.14}, isbn={0-7695-2764-7}, publisher={IEEE}, booktitle={International Symposium on Code Generation and Optimization (CGO'07)}, pages={259--270}, author={Dreweke, Alexander and Wörlein, Marc and Fischer, Ingrid and Schell, Dominic and Meinl, Thorsten 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/5640"> <dc:creator>Schell, Dominic</dc:creator> <dc:contributor>Meinl, Thorsten</dc:contributor> <dc:language>eng</dc:language> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:creator>Dreweke, Alexander</dc:creator> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:57:25Z</dcterms:available> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:contributor>Dreweke, Alexander</dc:contributor> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5640"/> <dc:creator>Wörlein, Marc</dc:creator> <dc:contributor>Schell, Dominic</dc:contributor> <dc:rights>deposit-license</dc:rights> <dcterms:title>Graph-Based Procedural Abstraction</dcterms:title> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <dc:creator>Philippsen, Michael</dc:creator> <dcterms:bibliographicCitation>First publ. in: International Symposium on Code Generation and Optimization, 11 - 14 March 2007, San Jose, California. Los Alamitos, Calif. : IEEE Computer Society, 2007, pp. 259-270</dcterms:bibliographicCitation> <dcterms:abstract xml:lang="eng">Procedural abstraction (PA) extracts duplicate code segments into a newly created method and hence reduces code size. For embedded micro computers the amount of memory is still limited so code reduction is an important issue. This paper presents a novel approach to PA, that is especially targeted towards embedded systems. Earlier approaches of PA are blind with respect to code reordering, i.e., two code segments with the same semantic effect but with different instruction orders were not detected as candidates for PA. Instead of instruction sequences, in our approach the data flow graphs of basic blocks are considered. Compared to known PA techniques more than twice the number of instructions can be saved on a set of binaries, by detecting frequently appearing graph fragments with a graph mining tool based on the well known gSpan algorithm. The detection and extraction of graph fragments is not as straight forward as extracting sequential code fragments. NP-complete graph operations and special rules to decide which parts can be abstracted are needed. However, this effort pays off as smaller sizes significantly reduce costs on mass-produced embedded systems.</dcterms:abstract> <dc:contributor>Wörlein, Marc</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:57:25Z</dc:date> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5640/1/Graph_Based_Procedural_Abstraction.pdf"/> <dcterms:issued>2007-03</dcterms:issued> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5640/1/Graph_Based_Procedural_Abstraction.pdf"/> <dc:format>application/pdf</dc:format> <dc:creator>Meinl, Thorsten</dc:creator> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:contributor>Fischer, Ingrid</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Fischer, Ingrid</dc:creator> <dc:contributor>Philippsen, Michael</dc:contributor> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Graph_Based_Procedural_Abstraction.pdf 85

Das Dokument erscheint in:

deposit-license Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: deposit-license

KOPS Suche


Stöbern

Mein Benutzerkonto