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.
EDBT 2026 Demo / reviewers in the wild / expert

Tony Kai Yun Chan

dblp:40/2394 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2005
—ORCID · none

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

Systems, architecture and hardware · 2Artificial intelligence and machine learning · 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
Parallel and multicore computing · 91% Performance modeling and evaluation · 9%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing
task partitioning		 0.011996
Task Partitionings for Parallel Triangular Solver on an MIMD Computer · HPDC 1996
Parallel and multicore computing
task scheduling		 0.011996
Task Partitionings for Parallel Triangular Solver on an MIMD Computer · HPDC 1996
Performance modeling and evaluation
parallel performance evaluation		 0.011996
Task Partitionings for Parallel Triangular Solver on an MIMD Computer · HPDC 1996

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

performance modeling · 0.0
YearPublicationVenuePosition
2005 An Adaptive Model for Phonetic String Search
Ruibin Gong, Tony Kai Yun Chan
 KES (3)2
2004 A prototype of distributed molecular visualization on computational grids
Huabing Zhu, Tony Kai Yun Chan, Lizhe Wang 0001, Wentong Cai 0001, Simon See
 Future Gener. Comput. Syst.2
1996 Task Partitionings for Parallel Triangular Solver on an MIMD Computer
abstract
Considers a parallel triangular solver on a distributed-memory MIMD computer. Three task partitioning methods are discussed, with both task assignment and task scheduling. Their estimated times are provided by using a performance model and a parallel performance evaluation methodology. The optimal task granularities are deduced by the analysis of their performance. Experiences on a transputer-based multicomputer are given.
Junming Qin, Tony Kai Yun Chan
 HPDC2