Wu-Chun Feng

Wu-Chun Feng

Auto-generated profile, based on publicly available information

Wu-Chun Feng

Virginia Tech

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 March 2010 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
AWAndrew S Warren
Andrew S Warren
JAJeremy Archuleta
Jeremy Archuleta
WFWu-Chun Feng
Wu-Chun Feng
JSJoão Carlos Setubal
João Carlos Setubal
Protein-coding gene detection in prokaryotic genomes is considered a much simpler problem than in intron-containing eukaryotic genomes. However there have been reports that prokaryotic gene finder programs have problems with small genes (either over-predicting or under-predicting). Therefore the question arises as to whether current genome annotations have systematically missing, small genes.

11 October 2007 in Parallel Computing
Verified
Journal Article
Closed access
WFWu-Chun Feng
Wu-Chun Feng
DMDinesh Manocha
Dinesh Manocha

1 June 2010 in Journal of Molecular Graphics and Modelling
Verified
Journal Article
Closed access
RARamu Anandakrishnan
Ramu Anandakrishnan
TSTom R.W. Scogland
Tom R.W. Scogland
AFAndrew T. Fenley
Andrew T. Fenley
JGJohn C. Gordon
John C. Gordon
WFWu-Chun Feng
Wu-Chun Feng
AOAlexey V. Onufriev
Alexey V. Onufriev

1 October 2016 in Parallel Computing
Verified
Journal Article
Closed access
AAAshwin M. Aji
Ashwin M. Aji
Antonio PenaAntonio Pena
Antonio Pena
PBPavan Balaji
Pavan Balaji
WFWu-Chun Feng
Wu-Chun Feng

5 January 2018 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
KHKaixi Hou
Kaixi Hou
HWHao Wang
Hao Wang
WFWu-Chun Feng
Wu-Chun Feng
The continued growth in the width of vector registers and the evolving library of intrinsics on the modern x86 processors make manual optimizations for data-level parallelism tedious and error-prone. In this paper, we focus on parallel sorting, a building block for many higher-level applications, and propose a framework for the Automatic SIMDization of Parallel Sorting (ASPaS) on x86-based multi- and many-core processors. That is, ASPaS takes any sorting network and a given instruction set architecture (ISA) as inputs and automatically generates vector code for that sorting network. After formalizing the sort function as a sequence of comparators and the transpose and merge functions as sequences of vector-matrix multiplications, ASPaS can map these functions to operations from a selected "pattern pool" that is based on the characteristics of parallel sorting, and then generate the vector code with the real ISA intrinsics. The performance evaluation on the Intel Ivy Bridge and Haswell CPUs, and Knights Corner MIC illustrates that automatically generated sorting codes from ASPaS can outperform the widely used sorting tools, achieving up to $5.2 \times$ speedup over the single-threaded implementations from STL and Boost and up to $6.7 \times$ speedup over the multi-threaded parallel sort from Intel TBB.

23 May 2012 in Computer Science - Research and Development
Verified
Journal Article
Closed access
PDF file
KLKenneth Lee
Kenneth Lee
HLHeshan Lin
Heshan Lin
WFWu-Chun Feng
Wu-Chun Feng