Parallelization of recursive preorder traversal based on building and winding call stacks

Makoto Nakayama, Kenichi Yamazaki, Satoshi Tanaka

研究成果: Conference contribution

抜粋

This paper proposes a method to parallelize the recursive preorder traversal algorithm on an ordered general tree. The method is based on building and winding call stacks, which are achieved by statically prepared initializing and terminating functions. In the method, an ordered general tree is split in a manner in which the nodes of a consecutive preorder range are assigned to a worker thread. At that time, all worker threads are aligned in order of the worker IDs, and an earlier worker thread is assigned an earlier preorder range. Each node is processed exactly once by only one worker thread. This paper also provides a set of proofs to show that each worker thread can start/stop its recursive preorder traversal from/at an intended place in a tree. The method is sufficiently general to be applicable to existing applications that adopt the recursive preorder traversal such as Protocol Buffers, which is a type of serializer/deserializer tool. The evaluation results show that the serialization result writing time of the parallelized Protocol Buffers is 1.78 fold shorter than that for normal Protocol Buffers when serializing 40,320 double values using 5 worker threads.

元の言語English
ホスト出版物のタイトルProceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2016
出版者IEEE Computer Society
ページ570-579
ページ数10
2016-August
ISBN(電子版)9781509021406
DOI
出版物ステータスPublished - 2016 8 2
イベント30th IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2016 - Chicago, United States
継続期間: 2016 5 232016 5 27

Other

Other30th IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2016
United States
Chicago
期間16/5/2316/5/27

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

これを引用

Nakayama, M., Yamazaki, K., & Tanaka, S. (2016). Parallelization of recursive preorder traversal based on building and winding call stacks. : Proceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2016 (巻 2016-August, pp. 570-579). [7529916] IEEE Computer Society. https://doi.org/10.1109/IPDPSW.2016.18