default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMotoyuki Kawaba
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j3]Qingyang Wang, Shungeng Zhang
, Yasuhiko Kanemasa, Calton Pu, Balaji Palanisamy, Lilian Harada, Motoyuki Kawaba:
Optimizing N-Tier Application Scalability in the Cloud: A Study of Soft Resource Allocation. ACM Trans. Model. Perform. Evaluation Comput. Syst. 4(2): 10:1-10:27 (2019)- 2016
- [c9]Yoshifumi Ujibashi, Motoyuki Kawaba, Lilian Harada:
Proposal of a Database Type and Aggregation Function for Accelerating Medical Genomics Study on RDBMS. EDBT 2016: 672-673 - 2015
- [c8]Yoshifumi Ujibashi, Minoru Nakamura, Tsuguchika Tabaru, Takushi Hashida, Motoyuki Kawaba, Lilian Harada:
Design of a Shared Memory mechanism for efficient paralell processing in PostgreSQL. IISA 2015: 1-6 - 2013
- [c7]Qingyang Wang, Yasuhiko Kanemasa, Jack Li, Deepal Jayasinghe, Toshihiro Shimizu, Masazumi Matsubara, Motoyuki Kawaba, Calton Pu:
An Experimental Study of Rapidly Alternating Bottlenecks in n-Tier Applications. IEEE CLOUD 2013: 171-178 - [c6]Qingyang Wang, Yasuhiko Kanemasa, Jack Li, Deepal Jayasinghe, Toshihiro Shimizu, Masazumi Matsubara, Motoyuki Kawaba, Calton Pu:
Detecting Transient Bottlenecks in n-Tier Applications through Fine-Grained Analysis. ICDCS 2013: 31-40 - 2012
- [c5]Simon Malkowski, Yasuhiko Kanemasa, Hanwei Chen, Masao Yamamoto, Qingyang Wang, Deepal Jayasinghe, Calton Pu, Motoyuki Kawaba:
Challenges and Opportunities in Consolidation at High Resource Utilization: Non-monotonic Response Time Variations in n-Tier Applications. IEEE CLOUD 2012: 162-169 - [c4]Jack Li, Qingyang Wang, Deepal Jayasinghe, Simon Malkowski, PengCheng Xiong, Calton Pu, Yasuhiko Kanemasa, Motoyuki Kawaba:
Profit-Based Experimental Analysis of IaaS Cloud Performance: Impact of Software Resource Allocation. IEEE SCC 2012: 344-351 - [c3]Qingyang Wang, Yasuhiko Kanemasa, Motoyuki Kawaba, Calton Pu:
When average is not average: large response time fluctuations in n-tier systems. ICAC 2012: 33-42 - [c2]Qingyang Wang, Yasuhiko Kanemasa, Jack Li, Deepal Jayasinghe, Motoyuki Kawaba, Calton Pu:
Response Time Reliability in Cloud Environments: An Empirical Study of n-Tier Applications at High Resource Utilization. SRDS 2012: 378-383 - 2011
- [c1]Qingyang Wang, Simon Malkowski, Deepal Jayasinghe, PengCheng Xiong, Calton Pu, Yasuhiko Kanemasa, Motoyuki Kawaba, Lilian Harada:
The Impact of Soft Resource Allocation on n-Tier Application Scalability. IPDPS 2011: 1034-1045
2000 – 2009
- 2006
- [j2]Hisashige Ando, Akira Asato, Motoyuki Kawaba, Hideki Okawara, William W. Walker:
A Case Study: Energy Efficient High Throughput Chip Multi-Processor Using Reduced-complexity Cores for Transaction Processing Workload. Inf. Media Technol. 1(1): 80-91 (2006) - 2001
- [j1]Yasunori Kimura, Kouya Shimura, Haruko Nishimoto, Motoyuki Kawaba, Takeshi Eguchi:
Building a design support tool for superscalar processors and its case studies. Syst. Comput. Jpn. 32(12): 67-79 (2001)
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 2025-01-21 00:25 CET 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:
