KOPS - The Institutional Repository of the University of Konstanz

Formalizations and Algorithms for Optimized Parallel Protocol Implementation

Formalizations and Algorithms for Optimized Parallel Protocol Implementation

Cite This

Files in this item

Checksum: MD5:8efa4fdca6ba4bc9be874045c886406b

LEUE, Stefan, Philippe OECHSLIN, 1994. Formalizations and Algorithms for Optimized Parallel Protocol Implementation. ICNP - 1994 International Conference on Network Protocols. Boston, MA, USA. In: Proceedings of ICNP - 1994 International Conference on Network Protocols. IEEE Comput. Soc. Press, pp. 178-185. ISBN 0-8186-6685-4. Available under: doi: 10.1109/ICNP.1994.344362

@inproceedings{Leue1994Forma-5598, title={Formalizations and Algorithms for Optimized Parallel Protocol Implementation}, year={1994}, doi={10.1109/ICNP.1994.344362}, isbn={0-8186-6685-4}, publisher={IEEE Comput. Soc. Press}, booktitle={Proceedings of ICNP - 1994 International Conference on Network Protocols}, pages={178--185}, author={Leue, Stefan and Oechslin, Philippe} }

<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/5598"> <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/> <dc:format>application/pdf</dc:format> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:issued>1994</dcterms:issued> <dc:contributor>Oechslin, Philippe</dc:contributor> <dc:contributor>Leue, Stefan</dc:contributor> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights> <dcterms:title>Formalizations and Algorithms for Optimized Parallel Protocol Implementation</dcterms:title> <dc:creator>Oechslin, Philippe</dc:creator> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5598"/> <dcterms:bibliographicCitation>First publ. in: Proceedings of the International Conference on Network Protocols, November 7 - 10, 1995, Tokyo, Japan / ed. by Ming T. (Mike) Liu ... Los Alamitos : IEEE Computer Soc. Press, 1995</dcterms:bibliographicCitation> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5598/1/Formalizations_and_Algorithms_for_Optimized_Parallel_Protocol_Implementation.pdf"/> <dc:language>eng</dc:language> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:56:41Z</dcterms:available> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:56:41Z</dc:date> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:abstract xml:lang="eng">We propose a formalized method that allolws to automatically derive an optimized implementation from the formal specification of a protocol. Our method starts with the SDL specification of a protocol stack. We first derive a data and control flow dependence graph from each SDL process. Then, in order to perform cross-layer optimizations we combine the dependence graphs of different SDL processes. Next, we determine the common path through the multi-layer dependence graph. We then parallelize this graph wherever possible which yields a relaxed dependence graph. Based on this relaxed dependence graph we interpret different optimization conccpts that have been suggested in the literature, in particular lazy messages and combination of data manipulation operations. Together with these interpretations the relaxed dependence graph can be be used as a foundation for a compile-time schedule on a sequential or parallel machine architecture. The formalization we provide allows our method to be embedded in a more comprehensive protocol engineering methodology.</dcterms:abstract> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5598/1/Formalizations_and_Algorithms_for_Optimized_Parallel_Protocol_Implementation.pdf"/> <dc:creator>Leue, Stefan</dc:creator> </rdf:Description> </rdf:RDF>

Downloads since Oct 1, 2014 (Information about access statistics)

Formalizations_and_Algorithms_for_Optimized_Parallel_Protocol_Implementation.pdf 249

This item appears in the following Collection(s)

Attribution-NonCommercial-NoDerivs 2.0 Generic Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 2.0 Generic

Search KOPS


Browse

My Account