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. H. Tang

dblp:12/4403 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2001
—ORCID · none

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

Systems, architecture and hardware · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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
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
2001 Using A-Buffer in Radiosity
abstract
Anti-aliasing in form factor computation and precise determination of shadow boundaries are important issues for radiosity method. A-buffer is a technique introduced by L. Carpenter (1984) for anti-aliasing in hidden surface removal. In this paper, we propose a method based on the A-buffer to replace the Z-buffer in the computation of form factors using the Hemicube for anti-aliasing. The method directly computes shadow boundaries in contrast to the adaptive re-meshing approach. Though the processing of shadow boundaries is not fast, only one discontinuity meshing (no iteration) is required. We implement the method in an infrastructure building design system.
J. H. Tang, C. H. Lim, H. C. Teh, Z. Y. Huang
Computer Graphics International2
1988 An evaluation of Cray X-MP performance on vectorizable Livermore FORTRAN kernels
abstract
This paper studies the impact of the architecture features of the Cray-1 and the Cray X-MP and related compiler optimizations on machine performance. We develop a methodology for evaluating the effectiveness of the Cray Fortran compilers in coping with the architecture features and limitations of the Cray-1 and the Cray X-MP. As examples, the effects of vector register reservation and vector index misalignment on the performance of Livermore Fortran Kernels (LFKs) are presented. The causes of the performance differences of two Cray Fortran compilers, CFT1.14 and CFT77.13, on the vectorized LFKs are described and some areas for further improvement are suggested.
J. H. Tang, Edward S. Davidson
ICS1
1988 Polycyclic Vector scheduling vs. Chaining on 1-Port Vector supercomputers
J. H. Tang, Edward S. Davidson, J. Tong
SC1