Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jason Lam

dblp:220/7499 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 91% High-performance computing · 9%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems › distributed scheduling
distributed task scheduling
0.812024
Exploiting Stragglers in Distributed Computing Systems With Task Grouping · IEEE Trans. Serv. Comput. 2024
Distributed systems › distributed data processing
straggler mitigation
0.812024
Exploiting Stragglers in Distributed Computing Systems With Task Grouping · IEEE Trans. Serv. Comput. 2024
Distributed systems
task clustering
0.812024
Exploiting Stragglers in Distributed Computing Systems With Task Grouping · IEEE Trans. Serv. Comput. 2024
High-performance computing
cluster computing
0.212024
Exploiting Stragglers in Distributed Computing Systems With Task Grouping · IEEE Trans. Serv. Comput. 2024

Methods — techniques the papers use, named apart from their topics

task grouping · 0.8simulation · 0.8
YearPublicationVenuePosition
2024 Exploiting Stragglers in Distributed Computing Systems With Task Grouping
abstract
We consider the problem of stragglers in distributed computing systems. Stragglers, which are compute nodes that unpredictably slow down, often increase the completion times of tasks. One common approach to mitigating stragglers is work replication, where only the first completion among replicated tasks is accepted, discarding the others. However, discarding work leads to resource wastage. In this article, we propose a method for exploiting the work completed by stragglers rather than discarding it. The idea is to increase the granularity of the assigned work, and to increase the frequency of worker updates. We show that the proposed method reduces the completion time of tasks via experiments performed on a simulated cluster as well as on Amazon EC2 with Apache Hadoop.
Tharindu Adikari, Haider Al-Lawati, Jason Lam, Zhenhua Hu, Stark C. Draper
IEEE Trans. Serv. Comput.3
2018 Designing Future Employment Applications for Underserved Job Seekers: A Speed Dating Study
abstract
Modern Information and Communication Technologies (ICTs) support job searches, resume creation, career development, and professional self-presentation. However, these technological tools are often tailored to high-income, highly educated users and white-collar professionals. It is unclear what interventions address the needs of job seekers who have limited resources or education, or who may be underserved in other ways. We gathered insights from the literature and generated ten tangible design concepts to address the needs of underserved job seekers. We then conducted a needs validation and speed dating study to understand which concepts were most viable among our population. We found that the three most preferred concepts immediately addressed job seekers' social and personal needs, where addressing social needs meant mediating job seekers' connections to others and supporting our job seekers' limited access to strong ties.
Tawanna Dillahunt, Jason Lam, Alex Jiahong Lu, Earnest Wheeler
Conference on Designing Interactive Systems2