Chia-Lin Yang

Chia-Lin Yang

Auto-generated profile, based on publicly available information

Chia-Lin Yang

Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan

Research Focus & Metrics

Academic Career Length

28Years (1999-Present)

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

Representative Publications

View All Publications
21 October 2008 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
PYPing-Hung Yuh
Ping-Hung Yuh
CYChia-Lin Yang
Chia-Lin Yang
Teng-Wen ChangTeng-Wen Chang
Teng-Wen Chang
Due to recent advances in microfluidics, digital microfluidic biochips are expected to revolutionize laboratory procedures. One critical problem for biochip synthesis is the droplet routing problem. Unlike traditional very large scale integration routing problems, in addition to routing path selection, the biochip routing problem needs to address the issue of scheduling droplets under practical constraints imposed by the fluidic property and timing restriction of synthesis results. In this paper, we present the first network-flow-based routing algorithm that can concurrently route a set of noninterfering nets for the droplet routing problem on biochips. We adopt a two-stage technique of global routing followed by detailed routing. In global routing, we first identify a set of noninterfering nets and then adopt the network-flow approach to generate optimal global-routing paths for nets. In detailed routing, we present the first polynomial-time algorithm for simultaneous routing and scheduling using the global-routing paths with a negotiation-based routing scheme. Our algorithm targets at both the minimization of cells used for routing for better fault tolerance and minimization of droplet transportation time for better reliability and faster bioassay execution. Experimental results show the robustness and efficiency of our algorithm.

1 November 2007 in ACM Journal on Emerging Technologies in Computing Systems
Verified
Journal Article
Open access
PYPing-Hung Yuh
Ping-Hung Yuh
CYChia-Lin Yang
Chia-Lin Yang
Teng-Wen ChangTeng-Wen Chang
Teng-Wen Chang
Droplet-based microfluidic biochips have recently gained much attention and are expected to revolutionize the biological laboratory procedures. As biochips are adopted for the complex procedures in molecular biology, its complexity is expected to increase due to the need of multiple and concurrent assays on a chip. In this article, we formulate the placement problem of digital microfluidic biochips with a tree-based topological representation, called T-tree . To the best knowledge of the authors, this is the first work that adopts a topological representation to solve the placement problem of digital microfluidic biochips. We also consider the defect tolerant issue to avoid to use defective cells due to fabrication. Experimental results demonstrate that our approach is more efficient and effective than the previous unified synthesis and placement framework.

3 June 2012
Verified
Conference Paper
Open access
PDF file
CCChi-Hao Chen
Chi-Hao Chen
PHPi-Cheng Hsiu
Pi-Cheng Hsiu
TKTei-Wei Kuo
Tei-Wei Kuo
CYChia-Lin Yang
Chia-Lin Yang
CWCheng-Yuan Michael Wang
Cheng-Yuan Michael Wang

21 March 2008 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
CLChung-Wei Lin
Chung-Wei Lin
SCSzu-Yu Chen
Szu-Yu Chen
CLChi-Feng Li
Chi-Feng Li
Teng-Wen ChangTeng-Wen Chang
Teng-Wen Chang
CYChia-Lin Yang
Chia-Lin Yang
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (called the Steiner points), and avoids running through any obstacle to construct a tree with a minimal total wirelength. The OARSMT problem becomes more important than ever for modern nanometer IC designs which need to consider numerous routing obstacles incurred from power networks, prerouted nets, IP blocks, feature patterns for manufacturability improvement, antenna jumpers for reliability enhancement, etc. Consequently, the OARSMT problem has received dramatically increasing attention recently. Nevertheless, considering obstacles significantly increases the problem complexity, and thus, most previous works suffer from either poor quality or expensive running time. Based on the obstacle-avoiding spanning graph, this paper presents an efficient algorithm with some theoretical optimality guarantees for the OARSMT construction. Unlike previous heuristics, our algorithm guarantees to find an optimal OARSMT for any two-pin net and many higher pin nets. Extensive experiments show that our algorithm results in significantly shorter wirelengths than all state-of-the-art works.

24 February 2014
Verified
Conference Paper
Open access
PDF file
RLRen-Shuo Liu
Ren-Shuo Liu
DSDe-Yu Shen
De-Yu Shen
CYChia-Lin Yang
Chia-Lin Yang
SYShun-Chih Yu
Shun-Chih Yu
CWCheng-Yuan Michael Wang
Cheng-Yuan Michael Wang

5 December 2015
Verified
Conference Paper
Open access
SLShih-Lien Lu
Shih-Lien Lu
YLYing-Chen Lin
Ying-Chen Lin
CYChia-Lin Yang
Chia-Lin Yang
The evolution of DRAM technology has been driven by capacity and bandwidth during the last decade. In contrast, DRAM access latency stays relatively constant and is trending to increase. Much efforts have been devoted to tolerate memory access latency but these techniques have reached the point of diminishing returns. Having shorter bitline and wordline length in a DRAM device will reduce the access latency. However by doing so it will impact the array efficiency. In the mainstream market, manufacturers are not willing to trade capacity for latency. Prior works had proposed hybrid-bitline DRAM design to overcome this problem. However, those methods are either intrusive to the circuit and layout of the DRAM design, or there is no direct way to migrate data between the fast and slow levels. In this paper, we proposed a novel asymmetric DRAM with capability to perform low cost data migration between subarrays. Having this design we determined a simple management mechanism and explored many management related policies. We showed that with this new design and our simple management technique we could achieve 7.25% and 11.77% performance improvement in single- and multi-programming workloads, respectively, over a system with traditional homogeneous DRAM. This gain is above 80% of the potential performance gain of a system based on a hypothetical DRAM which is made out of short bitlines entirely.