Junqiao Qiu

Junqiao Qiu

Auto-generated profile, based on publicly available information

Junqiao Qiu

City University of Hong Kong, Hong Kong, China

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 June 2017
Verified
Conference Paper
Open access
JQJunqiao Qiu
Junqiao Qiu
ZZZhijia Zhao
Zhijia Zhao
BWBo Wu
Bo Wu
AVAbhinav Vishnu
Abhinav Vishnu
SSShuaiwen Leon Song
Shuaiwen Leon Song
Finite state machines (FSMs) are the backbone of many applications, but are difficult to parallelize due to their inherent dependencies. Speculative FSM parallelization has shown promise on multicore machines with up to eight cores. However, as hardware parallelism grows (e.g., Xeon Phi has up to 288 logical cores), a fundamental question raises: How does the speculative FSM parallelization scale as the number of cores increases? Without answering this question, existing methods for speculative FSM parallelization simply choose to use all available cores, which might not only waste computing resources, but also result in suboptimal performance. In this work, we conduct a systematic scalability analysis for speculative FSM parallelization. Unlike many other parallelizations which can be modeled by the classic Amdahl's law or its simple extensions, speculative FSM parallelization scales unconventionally due to the non-deterministic nature of speculation and the cost variations of misspeculation. To address these challenges, this work introduces a spectrum of scalability models that are customized to the properties of specific FSMs and the underlying architecture. The models, for the first time, precisely capture the scalability of speculative parallelization for different FSM computations, and clearly show the existence of a "sweet spot" in terms of the number of cores employed by the speculative FSM parallelization to achieve the optimal performance. To make the scalability models practical, we develop S3, a scalability-sensitive speculation framework for FSM parallelization. For any given FSM, S3 can automatically characterize its properties and analyze its scalability, hence guide speculative parallelization towards the optimal performance and more efficient use of computing resources. Evaluations on different FSMs and architectures confirm the accuracy of the proposed models and show that S3 achieves significant speedup (up to 5X) and energy savings (up to 77%).

27 April 2024
Verified
Conference Paper
Open access
JHJiacheng Huang
Jiacheng Huang
YZYunmo Zhang
Yunmo Zhang
JQJunqiao Qiu
Junqiao Qiu
YLYu Liang
Yu Liang
RARachata Ausavarungnirun
Rachata Ausavarungnirun
CXChun Jason Xue
Chun Jason Xue
Faster app launching is crucial for the user experience on mobile devices. Apps launched from a background cached state, called hot-launching, have much better performance than apps launched from scratch. To increase the number of hot-launches, leading mobile vendors now cache more apps in the background by enabling swap. Recent work also proposed reducing the Java heap to increase the number of cached apps. However, this paper found that existing methods deteriorate app hot-launch performance while increasing the number of cached apps. To simultaneously improve the number of cached apps and hot-launch performance, this paper proposes Fleet, a foreground/background-aware GC-swap co-design framework. To enhance app-caching capacity, Fleet limits the tracing range of GC to background objects only, avoiding touching long-lifetime foreground objects. To improve hot-launch performance, Fleet identifies objects that will be accessed during the next hot-launch and uses runtime information to guide the swap scheme in the OS. In addition, Fleet aggregates small objects with similar access patterns into the same pages to improve swap efficiency. We implemented Fleet in AOSP and evaluated its performance with different types of apps. Experimental results show that Fleet achieves a 1.59× faster hot-launch time and caches 1.21× more apps than Android.


23 September 2022 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
JQJunqiao Qiu
Junqiao Qiu
AEAli Ebnenasir
Ali Ebnenasir
Motif Searching is an important problem that can reveal crucial information from biological data. Since the general motif searching is NP-hard and the volume of biological data is growing exponentially in recent years, there is a pressing need for developing time and space-efficient algorithms to find motifs. In this paper, we explore scalable parallelization for Edit Distance-Based Motif Search (EMS). We introduce two parallel designs, recursEMS which integrates the existing EMS solver into a parallel recursion tree running in multiple processes, and parEMS that presents a novel thread-based method which avoids the storage of redundant motif candidates. To make the parallel designs practical, we implement SPEMS , a S calability-sensitive P arallel solver for EMS. For any given biological dataset and search instance, SPEMS can provide an EMS parallelization towards the optimal performance, or a sub-optimal performance but being more space efficient. Evaluations on two real-world DNA dataset TRANSFAC and ChIP-seq show that SPEMS can obtain 10× geometric mean speedup over the state-of-the-art at the expense of no less than 74.7% memory overheads, or provide 2.2× geometric mean speedup with the possibility of consuming less memory, when running on a 48-core machine.

16 March 2026 in Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies
Verified
Journal Article
Open access
CHChenhao Hong
Chenhao Hong
XZXi Zheng
Xi Zheng
MLMinhui Liang
Minhui Liang
JQJunqiao Qiu
Junqiao Qiu
YLYuhan Luo
Yuhan Luo
The ubiquitous mobile devices have made balancing battery efficiency and user experience (UX) a critical issue. While prior work has extensively researched battery-saving strategies by managing computational resources, the design of user interface (UI) that communicates battery-saving status with users remains underexplored. In this work, we investigate how different visual representations of battery-saving indicators influence user behavior during intensive mobile interactions. We designed three versions of UI indicators for battery saving, with varying levels of statistical details. Through a between-subjects user study with 36 participants completing a series of intensive tasks on a mobile phone with limited battery, we examined behavioral and perceptual patterns across study conditions. Our findings showed that real-time saving statistics improved battery-saving efficiency and mitigated negative user experience under moderate performance degradation. However, when performance drops sharply, the same indicators may bring frustration and lead users to quickly turn off the saver. Our post-study interviews further revealed the strategic choices made by participants to optimize task completion while saving batteries. With the lessons learned, we discuss the implications of designing visual indicators for battery-saving mode in different interaction scenarios, and propose future directions for building sustainable battery-saving interfaces.

8 June 2025
Verified
Conference Paper
Open access
YZYunmo Zhang
Yunmo Zhang
JHJiacheng Huang
Jiacheng Huang
XYXizhe Yin
Xizhe Yin
JQJunqiao Qiu
Junqiao Qiu
HXHong Xu
Hong Xu
CXChun Jason Xue
Chun Jason Xue