Study for Parallel XML Processing Language that Guarantees Parallel Speedups

• Project/Area Number: 24700019
• Research Category: Grant-in-Aid for Young Scientists (B)
• Allocation Type: Multi-year Fund
• Research Field: Software
• Research Institution: The University of Tokyo (2013-2014); Tohoku University (2012)
• Principal Investigator: MORIHATA Akimasa 東京大学, 総合文化研究科, 講師 (10582257)
• Project Period (FY): 2012-04-01 – 2015-03-31
• Project Status: Completed (Fiscal Year 2014)
• Budget Amount: ¥3,120,000 (Direct Cost: ¥2,400,000、Indirect Cost: ¥720,000); Fiscal Year 2014: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000); Fiscal Year 2013: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000); Fiscal Year 2012: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
• Keywords: 並列処理 / XML / 関数プログラミング / 並列計算 / プログラミング言語 / 木構造計算 / ＸＭＬ / 分散並列評価 / XML処理

Outline of Final Research Achievements

We studied for developing a parallel XML processing language. We solved some difficulties in parallel processing of tree structures including XMLs. Moreover, we found a theory for divide-and-conquer parallelization of functional programs and showed a preliminary result that our approach is also useful for parallel data-flow analyses in compilers. These results will be useful not only for parallel XML processing but also for further studying parallel programming in general.

Research Products

• [Journal Article] Parallel Tree Contraction with Fewer Types of Primitive Contraction Operations and Its Application to Trees of Unbounded Degree. (2014)
  • Author(s): Akimasa Morihata, Kiminori Matsuzaki
  • Journal Title: IPSJ Transaction on Programming Volume: 7(5) Pages: 1-9
  • NAID: 130004706253
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] Syntax-Directed Divide-and-Conquer Data-Flow Analysis (2014)
  • Author(s): Shigeyuki Sato, Akimasa Morihata
  • Journal Title: Programming Languages and Systems - 12th Asian Symposium, APLAS 2014, Proceedings (Lecture Notes in Computer Science) Volume: 8858 Pages: 392-407
  • DOI: 10.1007/978-3-319-12736-1_21
  • ISBN: 9783319127354, 9783319127361
  • Peer Reviewed / Acknowledgement Compliant
• [Presentation] A Datatype- and Editing-Operation-Generic Incremental Computation (2015)
  • Author(s): 森畑明昌
  • Organizer: 情報処理学会第103回プログラミング研究会
  • Place of Presentation: 産業総合研究所
  • Year and Date: 2015-03-09
• [Presentation] A Short Cut to Parallelization Theorems (特別講演). (2014)
  • Author(s): Akimasa Morihata
  • Organizer: 日本ソフトウェア科学会第28回大会
  • Place of Presentation: 名古屋大学
  • Year and Date: 2014-09-08
  • Invited
• [Presentation] 漸増計算法の第三リスト準同型定理による系統的導出 (2014)
  • Author(s): 森畑明昌
  • Organizer: 第16回プログラミングおよびプログラミング言語ワークショップ
  • Place of Presentation: 阿蘇の司ビラパークホテル, 熊本県阿蘇市, 日本
• [Presentation] A Short Cut to Parallelization Theorems (2013)
  • Author(s): Akimasa Morihata
  • Organizer: ICFP'13: The 18th ACM SIGPLAN International Conference on Functional Programming
  • Place of Presentation: Hilton Boston Logan Airport Hotel, Boston, Massachusetts, USA
• [Presentation] XPath問合せのWork Efficientな分散並列評価 (2013)
  • Author(s): 森畑明昌
  • Organizer: 日本ソフトウェア科学会第30回大会
  • Place of Presentation: 東京大学, 東京都文京区, 日本
• [Presentation] 構文主導型データフロー解析の並列実装 (2013)
  • Author(s): 佐藤重幸, 森畑明昌
  • Organizer: 日本ソフトウェア科学会第30回大会
  • Place of Presentation: 東京大学, 東京都文京区, 日本
• [Presentation] 分割統治計算可能性の多相型を用いた保証 (2013)
  • Author(s): 森畑明昌
  • Organizer: 第15回プログラミングおよびプログラミング言語ワークショップ
  • Place of Presentation: 福島県会津若松 東山温泉「御宿東鳳」
• [Presentation] 並列木縮約を用いたマクロ木変換器の並列評価 (2012)
  • Author(s): 森畑明昌
  • Organizer: 日本ソフトウェア科学会第29回大会
  • Place of Presentation: 法政大学
• [Presentation] Macro Tree Transformations of Linear Size Increase Achieve Cost-Optimal Parallelism (Extended Abstract) (2012)
  • Author(s): Akimasa Morihata
  • Organizer: the 1st International Workshop on Trends in Tree Automata and Tree Transducers, TTATT 2012
  • Place of Presentation: Nagoya University
• [Presentation] Calculating Parallel Algorithms for Size-constrained Segment Problems (2012)
  • Author(s): Akimasa Morihata
  • Organizer: IFIP working group 2.1 69th meeting
  • Place of Presentation: Ottawa, Canada