Hung-Hsuan Chen

advertisement
Hung-Hsuan Chen
hhchen@psu.edu
Ph.D. Student, Dept. of CSE, Pennsylvania State University, University Park
Education
Ph.D. Computer Science and Engineering, Pennsylvania State University, USA
09/2008 – present
M.S. Computer Science, National Tsing-Hua University, Taiwan 09/2004 – 06/2006
B.S. Computer Science, National Tsing-Hua University, Taiwan 09/2000 – 06/2004
Academic Works

Hung-Hsuan Chen, Cheng-Chun Tu, and Kuan-Ta Chen, “A User-Centric
Framework for Comparing Applications’ Network Robustness,” ACM SIGCOMM
2008 (poster)

Hung-Hsuan Chen, "Finding frequent items in data stream environments," 2006
(M.S. Thesis)

Chen-Lung Chan, Shih-Yu Huang, Hung-Hsuan Chen, Wei-Hao Tung, and
Jia-Shung Wang, "An application-level multicast framework for large scale VOD
services," ICPADS 2005

Cheng-Han Tsai, Hung-Hsuan Chen, and Ting-Shih Chou, “A Dynamic Approach to
Balance the Loads of Web Servers,” NTHU technical report, 2003
Research Projects

DTV/MHP integrated program, electronic program guide
(EPG) sub-program
2004/10–2006/09
Create a 3-dimentional browsing interface which enables more information to be
contained in the limited TV screen. The 3-dimentional browsing interface integrates not
only the traditional "channel number oriented" TV watching habit but also the "personal
favorite oriented" approach.
 Microsoft Windows CE .NET curriculum subject
2003/07–2003/12
Focus on the unique virtual memory management feature of Windows CE. Trace the
kernel code to figure out how Windows CE allocate virtual memory and design some lab
experiments to demonstrate the idea. We also modified some Windows CE mechanisms.
Our mechanism enabled processes to dynamically request and return memories without
original limitation (32MB). The number of simultaneous processes can also be larger than
the original constraint (32).
 HTTP load balancer
2003/02–2003/05
Balancer actively detects or predicts the loads in each web servers instead of passively
balancing the load by using Round Robin domain names allocation by DNS
server. Using the knowledge of loads in each server, it can allocate the coming requests
more fairly to each server. The balancer is easy to use and requires user to only plug in
the cable lines on it.
Teaching and Working Experiences


Research Assistant, Institute of Information Science, Academia
Sinica
2007/11 – 2008/08
Teaching Assistant of Operating System Course
2005/09 – 2006/01
- Independently in charged of designing and grading lab projects for over 100 students
- Designed three projects by referring NachOS official site
1) Implementation of "swap" and “virtual memory” in NachOS
2) Implementation of new system calls
3) Altering the default NachOS CPU scheduling approach (Round Robin) to
non-preemptive SJF and non-preemptive priority scheduling

Intern, Website Maintainer, CWeb Technology Inc.
2003/09 – 2004/06
Download