Faculty Profiles - EMOTO Kento

Papers - EMOTO Kento

Division display21 - 40 of about 46／ All the affair displays >>

Generate, Test, and Aggregate ---A Calculation-based Framework for Systematic Parallel Programming with MapReduce Reviewed

7211 254 - 273 2012.03

Systematic Derivation of Efficient Parallel Algorithms for Generate-test-alpha Computation Reviewed

29 ( 1 ) 159 - 175 2012.02

Generate, Test, and Aggregate---A Calculation-based Framework for Systematic Parallel Programming with MapReduce

Kento Emoto, Sebastian Fischer, Zhenjiang Hu

2011 ( 34 ) 1 - 28 2011.10

Parallelization of Regular Expression Matching and Its Evaluation on Hadoop Reviewed

Kiminori Matsuzaki, Kento Emoto, Yu Liu

4 ( 4 ) 1 - 11 2011.09

An Algebraic Approach to Efficient Parallel Algorithms for Nested Reductions

Mathematical Engineering Technical Reports, Department of Mathematical Engineering and Information Physics, University of Tokyo 2011 ( 01 ) 1 - 31 2011.01

Implementing Fusion-Equipped Parallel Skeletons by Expression Templates Reviewed

6041 72 - 89 2010.12

Lessons from implementing the biCGStab method with SkeTo library Reviewed

15 - 24 2010.09

Generators-of-Generators Library with Optimization Capabilities in Fortress Reviewed

6272 26 - 37 2010.08

GCC's Support for Parallel Programming

Kento Emoto

49 ( 12 ) 1369 - 1374 2008.12

Generator-based GG Fortress Library

Mathematical Engineering Technical Reports, Department of Mathematical Engineering and Information Physics, University of Tokyo 2008 ( 16 ) 1 - 19 2008.08

Generator-based GG Fortress Library --Collection of GGs and Theories--

Mathematical Engineering Technical Reports, Department of Mathematical Engineering and Information Physics, University of Tokyo 2008 ( 17 ) 1 - 19 2008.08

A Compositional Framework for Developing Parallel Programs on Two-Dimensional Arrays Reviewed

35 ( 6 ) 615 - 658 2007.12

Efficient parallel tree reductions on distributed memory environments Reviewed

Kakehi K., Matsuzaki K., Emoto K.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4488 LNCS ( PART 2 ) 601 - 608 2007.12

Language：English Publishing type：Research paper (international conference proceedings)

A new approach for fast parallel reductions on trees over distributed memory environments is proposed. By employing serialized trees as the data representation, our algorithm has a communication-efficient BSP implementation regardless of the shapes of inputs. The prototype implementation supports its real efficacy. © Springer-Verlag Berlin Heidelberg 2007.

Scopus

Other Link： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=38049115892&origin=inward

A web service architecture for bidirectional XML updating Reviewed

Hayashi Y., Liu D., Emoto K., Matsuda K., Hu Z., Takeichi M.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4505 LNCS 721 - 732 2007.12

Language：English Publishing type：Research paper (international conference proceedings)

A Web service architecture is described for bidirectional XML updating. The updating mechanism exploits the power of bidirectional transformation so that users can update remote XML data by editing a view on the local machine that is generated by a transformation of the XML data. This architecture consists of three tiers: data viewer clients, a bidirectional transformation engine, and content servers accessible through the Internet. Due to the use of standard Web service technologies, the data viewer clients and content servers can be easily replaced with ones chosen by the user. Users can use this architecture to implement their own applications that exploit the power of bidirectional transformation without the burden of installing and maintaining a bidirectional language package. © Springer-Verlag Berlin Heidelberg 2007.

Scopus

Other Link： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=38049057259&origin=inward

Domain-specific optimization strategy for skeleton programs Reviewed

Emoto K., Matsuzaki K., Hu Z., Takeichi M.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4641 LNCS 705 - 714 2007.12

Authorship：Lead author Language：English Publishing type：Research paper (international conference proceedings)

Skeletal parallel programming enables us to develop parallel programs easily by composing ready-made components called skeletons. However, a simply-composed skeleton program often lacks efficiency due to overheads of intermediate data structures and communications. Many studies have focused on optimizations by fusing successive skeletons to eliminate the overheads. Existing fusion transformations, however, are too general to achieve adequate efficiency for some classes of problems. Thus, a specific fusion optimization is needed for a specific class. In this paper, we propose a strategy for domain-specific optimization of skeleton programs. In this strategy, one starts with a normal form that abstracts the programs of interest, then develops fusion rules that transform a skeleton program into the normal form, and finally makes efficient parallel implementation of the normal form. We illustrate the strategy with a case study: optimization of skeleton programs involving neighbor elements, which is often seen in scientific computations. © Springer-Verlag Berlin Heidelberg 2007.

Scopus

Other Link： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=38049128929&origin=inward

Domain-Specific Optimization Strategy for Skeleton Programs Reviewed

4641 705 - 714 2007.08

Parallelization of XPath Queries with Tree Skeletons Reviewed

Yoshiaki Nomura, Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi

Computer software 24 ( 3 ) 51 - 62 2007.07

A Web Service Architecture for Bidirectional XML Updating Reviewed

4505 721 - 732 2007.06

Efficient Parallel Tree Reductions on Distributed Memory Environments Reviewed

4488 601 - 608 2007.05

Domain-Specific Optimization for Skeleton Programs Involving Neighbor Elements

Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi

2007 ( 05 ) 1 - 29 2007.01

　 PREV - NEXT 　

<EMOTO Kento>

Papers - EMOTO Kento