default search action
Tasuku Hiraishi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Masahiro Yasugi, Kento Emoto, Tasuku Hiraishi:
Designing Restartable Exception Handling Mechanisms for Implementing Efficient and Safe High-level Languages. J. Inf. Process. 32: 436-450 (2024) - [c14]Masahiro Yasugi
, Tasuku Hiraishi
Portable Implementations of Work Stealing. HPC Asia 2024: 12-22 - 2022
- [j13]Zhengyang Bai
Parallelization of Matrix Partitioning in Hierarchical Matrix Construction on Distributed Memory Systems. J. Inf. Process. 30: 742-754 (2022) - [c13]Zhengyang Bai
Construction of Hierarchical Matrix on Distributed Memory Systems using a Task Parallel Language. CANDARW 2022: 48-54 - [c12]Yusuke Shiki
Evaluating and Analyzing Irregular Tree Search in the Tascell and HOPE Parallel Programming Languages. PDCAT 2022: 262-272 - 2021
- [j12]Tatsuya Abe
An Extensionally Equivalence-ensured Language for Task Parallel Processing with Backtracking-based Load Balancing. J. Inf. Process. 29: 434-448 (2021) - [j11]Ryusuke Nakashima, Masahiro Yasugi, Hiroshi Yoritaka, Tasuku Hiraishi, Seiji Umatani:
Work-stealing Strategies That Consider Work Amount and Hierarchy. J. Inf. Process. 29: 478-489 (2021)
2010 – 2019
- 2019
- [j10]Masahiro Yasugi, Reichi Ikeuchi, Tasuku Hiraishi, Tsuneyasu Komiya:
Evaluating Portable Mechanisms for Legitimate Execution Stack Access with a Scheme Interpreter in an Extended SC Language. J. Inf. Process. 27: 177-189 (2019) - [j9]Akihiro Ida, Hiroshi Nakashima, Tasuku Hiraishi, Ichitaro Yamazaki, Rio Yokota, Takeshi Iwashita:
QR Factorization of Block Low-rank Matrices with Weak Admissibility Condition. J. Inf. Process. 27: 831-839 (2019) - [j8]Zhengyang Bai
Parallelization of Matrix Partitioning in Construction of Hierarchical Matrices using Task Parallel Languages. J. Inf. Process. 27: 840-851 (2019) - [j7]Hiroshi Yoritaka, Ken Matsui, Masahiro Yasugi, Tasuku Hiraishi, Seiji Umatani:
Probabilistic guards: A mechanism for increasing the granularity of work-stealing programs. Parallel Comput. 82: 19-36 (2019) - [c11]Masahiro Yasugi, Daisuke Muraoka, Tasuku Hiraishi, Seiji Umatani, Kento Emoto:
HOPE: A Parallel Execution Model Based on Hierarchical Omission. ICPP 2019: 77:1-77:11 - [c10]Ryusuke Nakashima, Hiroshi Yoritaka, Masahiro Yasugi, Tasuku Hiraishi, Seiji Umatani:
Extending a Work-Stealing Framework with Priorities and Weights. IA3@SC 2019: 9-16 - 2017
- [j6]Shingo Okuno
Parallelization of Extracting Connected Subgraphs with Common Itemsets in Distributed Memory Environments. J. Inf. Process. 25: 256-267 (2017) - 2016
- [j5]Tasuku Hiraishi, Shingo Okuno
An Implementation of Exception Handling with Collateral Task Abortion. J. Inf. Process. 24(2): 439-449 (2016) - [c9]Daisuke Muraoka, Masahiro Yasugi, Tasuku Hiraishi, Seiji Umatani:
Evaluation of an MPI-Based Implementation of the Tascell Task-Parallel Language on Massively Parallel Systems. ICPP Workshops 2016: 161-170 - [c8]Hiroshi Yoritaka, Ken Matsui, Masahiro Yasugi, Tasuku Hiraishi, Seiji Umatani:
Extending a Work-Stealing Framework with Probabilistic Guards. ICPP Workshops 2016: 171-180 - [c7]Shingo Okuno
Reducing Redundant Search in Parallel Graph Mining Using Exceptions. IPDPS Workshops 2016: 328-337 - 2014
- [j4]Shingo Okuno, Tasuku Hiraishi, Hiroshi Nakashima, Masahiro Yasugi, Jun Sese:
Parallelization of Extracting Connected Subgraphs with Common Itemsets. Inf. Media Technol. 9(3): 233-250 (2014) - [c6]Takeshi Minami, Motoharu Hibino, Tasuku Hiraishi, Takeshi Iwashita, Hiroshi Nakashima:
Automatic Parameter Tuning of Three-Dimensional Tiled FDTD Kernel. VECPAR 2014: 284-297 - 2012
- [j3]Masahiro Yasugi, Tasuku Hiraishi, Seiji Umatani, Taiichi Yuasa:
Parallel Graph Traversals using Work-Stealing Frameworks for Many-core Platforms. Inf. Media Technol. 7(1): 73-84 (2012) - [j2]Masahiro Yasugi, Tasuku Hiraishi, Seiji Umatani, Taiichi Yuasa:
Parallel Graph Traversals using Work-Stealing Frameworks for Many-core Platforms. J. Inf. Process. 20(1): 128-139 (2012) - 2010
- [c5]Masahiro Yasugi, Tasuku Hiraishi, Seiji Umatani, Taiichi Yuasa:
Dynamic Graph Traversals for Concurrent Rewriting Using Work-Stealing Frameworks for Multicore Platforms. ICPADS 2010: 406-414 - [c4]Masahiro Yasugi, Tsuneyasu Komiya, Tasuku Hiraishi, Seiji Umatani:
Managing continuations for proper tail recursion. ILC 2010: 65-72
2000 – 2009
- 2009
- [c3]Tasuku Hiraishi, Masahiro Yasugi, Seiji Umatani, Taiichi Yuasa:
Backtracking-based load balancing. PPoPP 2009: 55-64 - 2007
- [c2]Tasuku Hiraishi, Masahiro Yasugi, Taiichi Yuasa:
Experience with SC: transformation-based implementation of various extensions to C. ILC 2007: 20 - 2006
- [j1]Tasuku Hiraishi, Masahiro Yasugi, Taiichi Yuasa:
A Transformation-Based Implementation of Lightweight Nested Functions. Inf. Media Technol. 1(2): 833-850 (2006) - [c1]Masahiro Yasugi, Tasuku Hiraishi, Taiichi Yuasa:
Lightweight Lexical Closures for Legitimate Execution Stack Access. CC 2006: 170-184
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 00:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: