Demo Data from EDBT 2026 / reviewers in the wild / expert
Guan-Ing Chen
dblp:57/6756
· DBLP profile ↗
6ranked-venue papers
6as first author
0since 2021 · last 1992
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 4 · 4 first-authorTheory of computation · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author
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
2 papers |
Interconnection networks and networks-on-chip · 68% Cloud and datacenter computing · 25% Performance modeling and evaluation · 6% | |
| Computer networks
1 paper |
Routing and switching · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Interconnection networks and networks-on-chip
hypercube network |
0.0 | 2 | 1992 | Constructing Parallel Paths Betweesn Two Subcubes · IEEE Trans. Computers 1992 A Note on "Generalized Hypercube and Hyperbus Structures for a Computer Network" · IEEE Trans. Computers 1991 |
Cloud and datacenter computing
job scheduling |
0.0 | 1 | 1992 | Constructing Parallel Paths Betweesn Two Subcubes · IEEE Trans. Computers 1992 |
Interconnection networks and networks-on-chip › hypercube network
generalized hypercube |
0.0 | 1 | 1991 | A Note on "Generalized Hypercube and Hyperbus Structures for a Computer Network" · IEEE Trans. Computers 1991 |
Routing and switching
circuit switching |
0.0 | 1 | 1992 | Constructing Parallel Paths Betweesn Two Subcubes · IEEE Trans. Computers 1992 |
Methods — techniques the papers use, named apart from their topics
complexity analysis · 0.0algorithm design · 0.0combinatorial optimization · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1992 | Constructing Parallel Paths Betweesn Two SubcubesabstractThe authors consider a hypercube system that runs more than one job at a time, with each job allocated a subcube. They discuss the problem of migrating (relocating) a job from one subcube to another, assuming a circuit-switching hypercube network. An algorithm is presented for constructing parallel circuits between two subcubes so that the tasks of a job can be migrated simultaneously. It is shown that no matter how fragmented the hypercube is, one can always construct parallel paths between two given subcubes. Furthermore, one can always minimize the maximum length of the constructed circuits. A solution that minimizes the maximum length of the circuits will also minimize the total length. The circuits are mutually edge-disjoint and do not use any edge that has been used by other jobs. The time complexity of the algorithm is O(n/sup 2/m), where n is the dimension of the hypercube system and m is the number of jobs already in the system.> Guan-Ing Chen, Ten-Hwang Lai |
IEEE Trans. Computers | 1 |
| 1991 | Scheduling Independent Jobs on Partitionable Hypercubes
Guan-Ing Chen, Ten-Hwang Lai |
J. Parallel Distributed Comput. | 1 |
| 1991 | A Note on "Generalized Hypercube and Hyperbus Structures for a Computer Network"abstractThe commenters point out that conjectures in the above-named paper (ibid., vol.C-33, no.4, p.323-333) concerning the structure of a least-cost generalized hypercube can be proved.> Guan-Ing Chen, Ten-Hwang Lai, Yao-Nan Lien |
IEEE Trans. Computers | 1 |
| 1989 | Virtual Subcubes and Job Migration in a Hypercube
Guan-Ing Chen, Ten-Hwang Lai |
ICPP (2) | 1 |
| 1988 | Scheduling Independent Jobs on Hypercubes
Guan-Ing Chen, Ten-Hwang Lai |
STACS | 1 |
| 1988 | Preemptive Scheduling of Independent Jobs on a Hypercube
Guan-Ing Chen, Ten-Hwang Lai |
Inf. Process. Lett. | 1 |