Publikation:

Formalizations and Algorithms for Optimized Parallel Protocol Implementation

Lade...
Vorschaubild

Datum

1994

Autor:innen

Oechslin, Philippe

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

Proceedings of ICNP - 1994 International Conference on Network Protocols. IEEE Comput. Soc. Press, 1994, pp. 178-185. ISBN 0-8186-6685-4. Available under: doi: 10.1109/ICNP.1994.344362

Zusammenfassung

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.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Konferenz

ICNP - 1994 International Conference on Network Protocols, Boston, MA, USA
Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690LEUE, 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, 1994, pp. 178-185. ISBN 0-8186-6685-4. Available under: doi: 10.1109/ICNP.1994.344362
BibTex
@inproceedings{Leue1994Forma-5598,
  year={1994},
  doi={10.1109/ICNP.1994.344362},
  title={Formalizations and Algorithms for Optimized Parallel Protocol Implementation},
  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: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/server/rdf/resource/123456789/5598">
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <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:issued>1994</dcterms:issued>
    <dc:creator>Oechslin, Philippe</dc:creator>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
    <dcterms:title>Formalizations and Algorithms for Optimized Parallel Protocol Implementation</dcterms:title>
    <dc:contributor>Oechslin, Philippe</dc:contributor>
    <dc:contributor>Leue, Stefan</dc:contributor>
    <dc:creator>Leue, Stefan</dc:creator>
    <dc:language>eng</dc:language>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5598"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <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>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5598/1/Formalizations_and_Algorithms_for_Optimized_Parallel_Protocol_Implementation.pdf"/>
    <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>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:format>application/pdf</dc:format>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5598/1/Formalizations_and_Algorithms_for_Optimized_Parallel_Protocol_Implementation.pdf"/>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Diese Publikation teilen