{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1360567181318190848.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.1007/s10766-015-0355-8"}},{"identifier":{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/s10766-015-0355-8.pdf"}},{"identifier":{"@type":"URI","@value":"http://link.springer.com/article/10.1007/s10766-015-0355-8/fulltext.html"}},{"identifier":{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/s10766-015-0355-8"}}],"resourceType":"学術雑誌論文(journal article)","dc:title":[{"@value":"Parallel Tree Accumulations on MapReduce"}],"description":[{"notation":[{"@value":"MapReduce is a remarkable parallel programming model as well as a parallel processing infrastructure for large-scale data processing. Since it is now widely available on cloud environments, developing methodology or patterns for MapReduce programming is important. In particular, XML is the de facto standard for representing data, and processing semi-structured data is involved in many applications. The target computational patterns in this paper are tree accumulations. Tree accumulations are shape-preserving computations over a tree in which values are updated through flows over the tree. We develop BSP algorithms for two tree accumulations as extensions of the BSP algorithm for tree reduction by Kakehi et al. (Tech. Rep. METR 2006-64, Department of Mathematical Informatics, Graduate School of Information Science and Technology, The University of Tokyo, 2006). We also implemented the two-superstep algorithms with a single MapReduce execution. Experimental results on a 16-node PC cluster show good speedups of a factor of 10.9---12.7."}]}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1380567181318190849","@type":"Researcher","foaf:name":[{"@value":"Kiminori Matsuzaki"}]},{"@id":"https://cir.nii.ac.jp/crid/1380567181318190848","@type":"Researcher","foaf:name":[{"@value":"Reina Miyazaki"}]}],"publication":{"publicationIdentifier":[{"@type":"PISSN","@value":"08857458"},{"@type":"EISSN","@value":"15737640"}],"prism:publicationName":[{"@value":"International Journal of Parallel Programming"}],"dc:publisher":[{"@value":"Springer Science and Business Media LLC"}],"prism:publicationDate":"2015-03-20","prism:volume":"44","prism:number":"3","prism:startingPage":"466","prism:endingPage":"485"},"reviewed":"false","dcterms:accessRights":"http://purl.org/coar/access_right/c_abf2","dc:rights":["http://www.springer.com/tdm"],"url":[{"@id":"http://link.springer.com/content/pdf/10.1007/s10766-015-0355-8.pdf"},{"@id":"http://link.springer.com/article/10.1007/s10766-015-0355-8/fulltext.html"},{"@id":"http://link.springer.com/content/pdf/10.1007/s10766-015-0355-8"}],"createdAt":"2015-03-19","modifiedAt":"2019-08-22","project":[{"@id":"https://cir.nii.ac.jp/crid/1040282257260033920","@type":"Project","projectIdentifier":[{"@type":"KAKEN","@value":"26280020"},{"@type":"JGN","@value":"JP26280020"},{"@type":"URI","@value":"https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-26280020/"}],"notation":[{"@language":"ja","@value":"大規模グラフ並列処理のための代数的構造に基づく理論基盤とプログラム開発基盤の構築"},{"@language":"en","@value":"Developing an algebraic model and program development platform for large-scale graph processing"}]}],"relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1360004232458705408","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Parallel Tree Reduction on MapReduce"}]},{"@id":"https://cir.nii.ac.jp/crid/1360011145000893056","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Parallel skeletons for manipulating general trees"}]},{"@id":"https://cir.nii.ac.jp/crid/1360574095470628352","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"The XML web"}]},{"@id":"https://cir.nii.ac.jp/crid/1360574095531907072","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Calculating accumulations"}]},{"@id":"https://cir.nii.ac.jp/crid/1360574096149121152","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Parallel algorithms for tree accumulations"}]},{"@id":"https://cir.nii.ac.jp/crid/1360855568453638272","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Parallel tree contraction and its application"}]},{"@id":"https://cir.nii.ac.jp/crid/1360855569126253696","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Generic downwards accumulations"}]},{"@id":"https://cir.nii.ac.jp/crid/1360855570963075072","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"A bridging model for parallel computation"}]},{"@id":"https://cir.nii.ac.jp/crid/1361137044116948352","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Google’s MapReduce programming model — Revisited"}]},{"@id":"https://cir.nii.ac.jp/crid/1361418519763597952","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Efficient Parallel Tree Reductions on Distributed Memory Environments"}]},{"@id":"https://cir.nii.ac.jp/crid/1361699994005968768","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Efficient Implementation of Tree Accumulations on Distributed-Memory Parallel Computers"}]},{"@id":"https://cir.nii.ac.jp/crid/1361981469301466496","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Foundations of Parallel Programming"}]},{"@id":"https://cir.nii.ac.jp/crid/1361981471328064128","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Efficient parallel algorithms for tree accumulations"}]},{"@id":"https://cir.nii.ac.jp/crid/1362262945943649536","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Optimal Tree Contraction in the EREW Model"}]},{"@id":"https://cir.nii.ac.jp/crid/1363388845371550976","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Computing downwards accumulations on trees quickly"}]},{"@id":"https://cir.nii.ac.jp/crid/1363388845604878976","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Generic Accumulations"}]},{"@id":"https://cir.nii.ac.jp/crid/1363388846234593664","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"A simple parallel tree contraction algorithm"}]},{"@id":"https://cir.nii.ac.jp/crid/1363951794112765440","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"HadoopXML"}]},{"@id":"https://cir.nii.ac.jp/crid/1363951795465106560","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Scans as primitive parallel operations"}]},{"@id":"https://cir.nii.ac.jp/crid/1363951795780648576","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Parallel Implementation of Tree Skeletons"}]},{"@id":"https://cir.nii.ac.jp/crid/1364233268395812096","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP"}]}],"dataSourceIdentifier":[{"@type":"CROSSREF","@value":"10.1007/s10766-015-0355-8"},{"@type":"KAKEN","@value":"PRODUCT-20635244"},{"@type":"OPENAIRE","@value":"doi_dedup___::f2c27fa6c25ca62aee2b34c44f6a8be8"}]}