Problems and References

Problem 1: Circuit Design & Analysis

Contributed by: Danny Bathen (US Dept. of Defense)
Overview: Static timing analysis of combinational circuits
 
Timing analysis for combinational circuits
Chapter 5, from "Timing" by Sachin Sapatnekar, Kluwer Academic Publishers, 2004

Problem 2: Physical Design

Contributed by:Wen-Hao Liu (NCTU) and Yaoguang Wei (IBM)
Overview: Fast maze-free unilateral monotonic routing
 
A fast maze-free routing congestion estimator with hybrid unilateral monotonic routing
Wen-Hao Liu, Yih-Lang Li, Cheng-Kok Koh, ICCAD 2012: 713-719

Problem 3: Logic & High-Level Synthesis

Contributed by: Igor Markov (University of Michigan)
Overview:  Reconstructing a function of a given form using an oracle
 
No specific reference paper for this problem.

Problem 4: System Design and Analysis

Contributed by: Jingtong Hu (Oklahoma State University)
Overview: Data allocation optimizations for hybrid SRAM and NVM-based scratchpad memories
 
Data Allocation Optimization for Hybrid Scratch Pad Memory With SRAM and Nonvolatile Memory
Jingtong Hu, Chun Jason Xue, Qingfeng Zhuge, Wei-Che Tseng, Edwin Hsing-Mean Sha, IEEE Trans. VLSI Syst. 21(6): 1094-1102 (2013)

Towards energy efficient hybrid on-chip Scratch Pad Memory with non-volatile memory
Jingtong Hu, Chun Jason Xue, Qingfeng Zhuge, Wei-Che Tseng, Edwin Hsing-Mean Sha, DATE 2011: 746-751

Note that this problem will be implemented in the Python programming language. Python documentation will be provided on the contest machines.

Problem 5: Functional Verification

Contributed by: Myung-Chul Kim (IBM)
Overview: Canonical labeling and symmetry detection for verification
 
Graph Symmetry Detection and Canonical Labeling: Differences and Synergies
Hadi Katebi, Karem A. Sakallah, Igor L. Markov, CoRR abs/1208.6271 (2012)

Problem 6: Bio EDA

Contributed by: Johan Peltenburg & Zaid Al-Ars (TU Delft)
Overview: Improving the speed of the Burrows–Wheeler transform
 
Fast and accurate short read alignment with Burrows–Wheeler transform
Heng Li and Richard Durbin, Bioinformatics. 2009 July 15; 25(14): 1754–1760

Note that this problem will be implemented in the Python programming language. Python documentation will be provided on the contest machines.

Computer Platform

During the contest one desktop computer will be available per team, running a standard installation of Ubuntu Linux. All necessary software and the problem statements will be pre-installed. In your home directory you will find a beginning directory structure to organize your work and initial problem frameworks such as parsers.
You will be allowed to bring in any written or printed materials, but no electronic storage media or computing devices. (If you have a preferred VIM or Emacs configuration, you will need to print them out beforehand and type them in.) Whatever you bring in shall stay in the room until you decide to leave the room at the end of the day.