Parallelization of tree-to-TLV serialization

Makoto Nakayama, Kenichi Yamazaki, Satoshi Tanaka, Hironori Kasahara

    研究成果: Conference contribution

    1 被引用数 (Scopus)

    抄録

    A serializer/deserializer (SerDe) is necessary to serialize a data object into a byte array and to deserialize in reverse direction. A SerDe that is used worldwide and runs quickly is the Protocol Buffer (ProtoBuf), which serializes a tree-structured data object into the Type-Length-Value (TLV) format. Acceleration of SerDe processing is beneficial because SerDes are used in various fields. This paper proposes a new method that accelerates the tree-to-TLV serialization through 2-way parallel processing called "parallelized serialization" and "parallelization with streaming". Experimental results show that parallelized serialization with 4 worker threads achieves a 1.97 fold shorter serialization time than when using a single worker thread, and the combination of 2-way parallel processing achieves a 2.11 fold shorter output time than that for ProtoBuf when 4 worker threads, File Output Stream and trees of 10,080 container nodes are used.

    本文言語English
    ホスト出版物のタイトル2014 IEEE 33rd International Performance Computing and Communications Conference, IPCCC 2014
    出版社Institute of Electrical and Electronics Engineers Inc.
    2014-January
    ISBN(電子版)9781479975754
    DOI
    出版ステータスPublished - 2015 1 20
    イベント33rd IEEE International Performance Computing and Communications Conference, IPCCC 2014 - Austin, United States
    継続期間: 2014 12 52014 12 7

    Other

    Other33rd IEEE International Performance Computing and Communications Conference, IPCCC 2014
    国/地域United States
    CityAustin
    Period14/12/514/12/7

    ASJC Scopus subject areas

    • ソフトウェア
    • 計算理論と計算数学
    • コンピュータ ネットワークおよび通信

    フィンガープリント

    「Parallelization of tree-to-TLV serialization」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル