May 15, 2023

All oral presentations will be 25 minutes in duration, which includes a 20-minute presentation followed by a 5-minute question and discussion period.

Improving SYCL Portability for Pseudorandom Number Generation: a Case Study with Gene-Expression Connectivity, Mapping Zheming Jin and Jeffrey Vetter

Making Lock Manager Concurrent for Deterministic Database, Masaru Uchida and Hideyuki Kawashima

Solving Distance-constrained Labeling via TSP, Tesshu Hanaka, Hirotaka Ono and Kosuke Sugiyama

Toward a Modular Workflow for Network Performance Characterization, Niklas Bartelheimer, Zhaobin Zhu and Sarah Neuwirth

Implementing An Outsourced Dual-Proxy Signing and Decryption Scheme in Mobile Cloud Computing, Somchart Fugkeaw

A High-dimensional Algorithm-Based Fault Tolerance Scheme, Fu Xiang, Hao Tang, Huimin Liao, Xin Huang, Wubiao Xu, Shimeng Meng, Weiping Zhang, Luanzheng Guo and Kento Sato

Error-bounded Scalable Parallel Tensor Train Decomposition, Shiyao Xie, Akinori Miura and Kenji Ono

Speaker: Professor Jie Wu, Temple University

Title: On the Cost-Optimal Parallel Solution of the Majority Problem

A Domain-Specific Language for Reconfigurable, Distributed Software Architecture, Henry Zhu, Junyong Zhao and Nik Sultana

In-Depth Evaluation of a Lower-Level Direct-Verbs API on InfiniBand-based Clusters: Early Experiences, Benjamin Michalowicz, Kaushik Kandadi Suresh, Bharath Ramesh, Aamir Shafi, Hari Subramoni, Mustafa Abduljabbar and Dhabaleswar Panda

Diverse Adaptive Bulk Search: a Framework for Solving QUBO Problems on Multiple GPUs Koji Nakano, Daisuke Takafuji, Yasuaki Ito, Takashi Yazane, Junko Yano, Shiro Ozaki, Ryota Katsuki and Rie Mori