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

J. Tong

dblp:20/5850 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · unresolved

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

Systems, architecture and hardware · 4Artificial intelligence and machine learning · 1 · 1 since 2021

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
High-performance computing · 77% Processor architecture and microarchitecture · 23%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
vectorization
0.011988
Polycyclic Vector scheduling vs. Chaining on 1-Port Vector supercomputers · SC 1988
High-performance computing
performance optimization at scale
0.011988
Polycyclic Vector scheduling vs. Chaining on 1-Port Vector supercomputers · SC 1988
Processor architecture and microarchitecture
vector processor
0.011988
Polycyclic Vector scheduling vs. Chaining on 1-Port Vector supercomputers · SC 1988

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

polycyclic scheduling · 0.0chaining · 0.0
YearPublicationVenuePosition
2025 3D face parsing based on 2D CPFNet: conformal parameterized face parsing network
J. Tong
Mach. Vis. Appl.5
1999 Communication-Efficient Sorting Algorithms on Reconfigurable Array of Processors With Slotted Optical Buses
Mounir Hamdi, Chunming Qiao, Yi Pan 0001, J. Tong
J. Parallel Distributed Comput.4
1997 An Efficient Multi-Way Algorithm for Balanced Partitioning of VLSI Circuits
abstract
This paper presents an efficient algorithm for multi-way balanced partitioning of VLSI circuits. The proposed algorithm is still based on the widely used net-cut model, but its novelty is the potential gain function into the net-cut cost function to relax the single-cell-move constraint (as commonly encountered in the Kernighan-Lin algorithm) for balanced partitioning. This feature permits to move a group of cells (referred to as a Multi-Cell-Move strategy) for partitioning a circuit, while reducing its sensitivity to size constraint. The new multi-way partitioning algorithm is fully analyzed; expressions for the potential gain function (with respect to the multi-move operation) and the cost (for the min-cut objective function) are presented. The time complexity of the proposed partitioning algorithm is O(P/spl times/k/sup 2/ log/sub 2/ (k)), where k is the number of blocks and P is the number of pins. Simulation results are presented and a remarkable improvement is achieved compared with existing algorithms, such as the k-Dual Part algorithm.
J. Tong, Nohpill Park, Fabrizio Lombardi
ICCD2
1996 Fast sorting algorithms on reconfigurable array of processors with optical buses
abstract
The Reconfigurable Array with Spanning Optical Buses (RASOB) has recently received a lot of attention from the research community. By taking advantage of the unique properties of optical transmission, the RASOB provides flexible reconfiguration and strong connectivities with low hardware and control complexities. In this paper, we use this architecture for the design of efficient sorting algorithms on the 1-D RASOB and the 2-D RASOB. Our parallel sorting algorithm on the 1-D RASOB, which sorts N data items using N processors in O(k) time where k is the size of the data items to be in bits, is based on a novel divide-and-conquer scheme. On the other hand, our parallel sorting algorithm on the 2-D RASOB is based on the sorting algorithm on the 1-D RASOB in conjunction with the well known Rotatesort algorithm. This algorithm sorts N data items on a 2-D RASOB of size N in O(k) time. These sorting algorithms outperform state-of-the-art sorting algorithms on reconfigurable arrays of processors with electronic buses.
Mounir Hamdi, J. Tong, C. W. Kin
ICPADS2
1988 Polycyclic Vector scheduling vs. Chaining on 1-Port Vector supercomputers
J. H. Tang, Edward S. Davidson, J. Tong
SC3