Faculty Profiles - EMOTO Kento

Papers - EMOTO Kento

Division display >> ／ All the affair displays1 - 46 of about 46

Designing Restartable Exception Handling Mechanisms for Implementing Efficient and Safe High-level Languages Reviewed

Yasugi Masahiro, Emoto Kento, Hiraishi Tasuku

Journal of Information Processing ( Information Processing Society of Japan ) 32 ( 0 ) 436 - 450 2024.01

Language：English Publishing type：Research paper (scientific journal)

Mechanisms for legitimate execution stack access (LESA for short) provide legitimate access to values of callers' variables sleeping deeply in a C-like execution stack. LESA mechanisms enable efficient implementations of high-level services that require dynamic rearrangement of running software, such as garbage collection, first-class continuations, and dynamic load balancing, for implementing efficient and safe high-level languages. As a nested-function-style LESA mechanism, we can create a closure from a nested function definition and indirectly call the nested function via a pointer to the closure, achieving access to values of the variables captured in the closure-creation-time environment. In this study, we propose restartable exception handling mechanisms as new LESA mechanisms, which provide callable exception handlers without non-local exiting; handlers are found on the basis of dynamic scope without requiring pointers. In addition, the LESA mechanisms can be used at multiple levels; e.g., garbage collection can be started during the creation of a first-class continuation. In this paper, we design core languages that feature leveled restartable exception handling mechanisms and discuss their properties and implementations.

DOI： 10.2197/ipsjjip.32.436

Kyutacar

Scopus

CiNii Research

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

Fregel: a functional domain-specific language for vertex-centric large-scale graph processing Reviewed

IWASAKI H., EMOTO K., MORIHATA A., MATSUZAKI K., HU Z.

Journal of Functional Programming 32 ( 2 ) 2022.01

Distributed parallel generation of large-scale random graphs based on Watts–Strogatz model Reviewed

KAMINO Kaoru, EMOTO Kento

Computer Software ( Japan Society for Software Science and Technology ) 37 ( 2 ) 2_34 - 2_45 2020.01

Language：Japanese Publishing type：Research paper (scientific journal)

In recent years, there has been a growing demand for the development of programs that perform analysis on large-scale graphs such as SNS and Web graphs. In evaluating the performance of such programs, we need a number of input graphs with the desired number of nodes and specific features such as the small-world property. However, the generation of large-scale random graphs by sequential programs is very time-consuming, and may cause memory shortage. In order to solve this problem, distributed parallelization of large-scale graph generation is desired. In this research, we propose distributed parallelization of the random-graph generation based on Watts-Strogatz model, which is one of well-known graph models that provide characteristics similar to large scale graphs in the real world. We implemented our proposing distributed parallel algorithm by using Hadoop MapReduce. In the distributed parallelization, some restrictions are introduced into the original generation method to improve its efficiency. We have shown that the restrictions do not break the the characteristics that the original model has.

DOI： 10.11309/jssst.37.2_34

CiNii Article

CiNii Research

Other Link： https://ci.nii.ac.jp/naid/130007863812

Recursion Schemes in Coq Reviewed International journal

Murata K., Emoto K.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 11893 LNCS 202 - 221 2019.12

HOPE: A parallel execution model based on hierarchical omission Reviewed International journal

Yasugi M., Muraoka D., Hiraishi T., Umatani S., Emoto K.

ACM International Conference Proceeding Series 77:1 - 77:11 2019.08

A DSL for graph parallel programming with vertex subsets Reviewed International journal

Kento Emoto, Fumihisa Sadahira

Journal of Supercomputing 76 ( 7 ) 4998 - 5015 (First Online 23 March 2019) 2019.03

定理証明支援系Coqにおける不等式変形記法 Reviewed

村田康佑, 江本健斗

情報処理学会論文誌プログラミング（PRO） 11 ( 4 ) 1 - 12 2018.12

Optimizing declarative parallel distributed graph processing by using constraint solvers Reviewed

Morihata A., Emoto K., Matsuzaki K., Hu Z., Iwasaki H.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10818 LNCS 166 - 181 2018.01

Efficient parallel tree reductions on distributed memory environments Reviewed

Kakehi K., Matsuzakl K., Emoto K.

Scalable Computing 18 ( 1 ) 1 - 15 2017.01

Think like a vertex, behave like a function! a functional DSL for vertex-centric big graph processing Reviewed International journal

Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Akimasa Morihata, Hideya Iwasaki

ACM SIGPLAN Notices 51 ( 9 ) 200 - 213 2016.09

BSP (Bulk Synchronous Parallel) Model, Revisited

Kiminori Matsuzaki, Kento Emoto

56 ( 5 ) 482 - 488 2015.04

An Automatic Fusion Mechanism for Variable-Length List Skeletons in SkeTo Reviewed

International Journal of Parallel Programming 42 ( 4 ) 546 - 563 2014.08

Shortest Regular Category-Path Queries

Technical Report GRACE-TR-2014-03 12 pages 2014.08

A Verified Generate-Test-Aggregate Coq Library for Parallel Programs Extraction Reviewed

258 - 274 2014.07

A Generate-Test-Aggregate parallel programming library for systematic parallel programming Reviewed

40 ( 2 ) 116 - 135 2014.02

Accumulative Computation on MapReduce Reviewed

7 ( 1 ) 18 - 27 2014.01

A generate-test-aggregate parallel programming library: systematic parallel programming for MapReduce Reviewed

71 - 81 2013.02

An Automatic Fusion Mechanism for Variable-Length List Skeletons in SkeTo

Mathematical Engineering Technical Reports, Department of Mathematical Engineering and Information Physics, University of Tokyo 2013 ( 04 ) 1 - 18 2013.01

Parallel Tree Reduction on MapReduce Reviewed

9 1827 - 1836 2012.06

Filter-embedding semiring fusion for programming with MapReduce Reviewed

24 ( 4-6 ) 623 - 645 2012.06

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

An Practicable Framework for Tree Reductions under Distributed Memory Environments

Mathematical Engineering Technical Reports, Department of Mathematical Engineering and Information Physics, University of Tokyo 2006 ( 64 ) 1 - 21 2006.12

Surrounding Theorem: Developing Parallel Programs for Matrix-Convolutions Reviewed

4128 605 - 614 2006.08

A library of constructive skeletons for sequential style of parallel programming Invited Reviewed

2006.05

Surrounding theorem: Developing parallel programs for matrix-convolutions 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) 4128 LNCS 605 - 614 2006.01

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

Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, but development of efficient parallel programs on two-dimensional arrays is known to be hard. To solve this problem, we have proposed a skeletal framework on two-dimensional arrays based on the theory of constructive algorithmics. It supports users, even with little knowledge about parallel machines, to develop systematically both correct and efficient parallel programs on two-dimensional arrays. In this paper, we apply our framework to the matrix-convolutions often used in image filters and difference methods. We show the efficacy of the framework by giving a general parallel program for the matrix-convolutions described with the skeletons, and a theorem that optimizes the general program into an application-specific one. © Springer-Verlag Berlin Heidelberg 2006.

Scopus

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

有理式で表される不確かさを持つ制御系の解析・設計法 Reviewed

江本健斗, 大石泰章

計測自動制御学会論文集 41 ( 4 ) 314 - 321 2005.04

A Compositional Framework for Developing Parallel Programs on Two Dimensional Arrays

Mathematical Engineering Technical Reports, Department of Mathematical Engineering and Information Physics, University of Tokyo 2005 ( 09 ) 1 - 43 2005.01

　PREV-NEXT　

<EMOTO Kento>

Papers - EMOTO Kento