Problems and References

(To download all the references in .zip, click here)

Problem 1: Circuit Design & Analysis
Contributed by: Myung-Chul Kim (IBM) and Dong-Ki Kim (POSTECH)
Overview: Improving the performance of a memory system by reordering memory references
S. Rixner, W. J. Dally, U. J. Kapasi, P. Mattson, J. D. Owens, "Memory Access Scheduling'', ISCA '00: pp 128-138
*The simulation infrastructure is Utah usimm-v1.3 (document).
 
Problem 2: Physical Design
Contributed by: Wen-Hao Liu (Cadence) and Yaoguang Wei (IBM)
Overview: Efficient rectilinear minimum spanning tree construction
H. Zhou, N. Shenoy, W. Nicholls, "Efficient Minimum Spanning Tree Construction Without Delaunay Triangulation", Inf. Process. Lett. 81(5) 2002: pp. 271-276.
 
Problem 3: Logic & High-Level Synthesis
Contributed by: Peng Deng (University of California, Riverside)
Overview: Task synthesis for latency-sensitive synchronous block diagram
P. Deng, Q. Zhu, M. D. Natale, H. Zeng, "Task Synthesis for Latency-sensitive Synchronous Block Diagram", 9th IEEE International Symposium on Industrial Embedded Systems (SIES), Pisa, Italy, June 2014.
 
Problem 4: System Design and Analysis
Contributed by: Luis Danny Bathen (US Dept. of Defense)
Overview: Task scheduling of microfluidic systems
L. Luo, S. Akella, "Optimal Scheduling of Biochemical Analyses on Digital Microfluidic Systems", IEEE T-ASE 8(1) 2011: pp. 216-227.
 
Problem 5: Functional Verification
Contributed by: Matthias Kauer (TU Munich)
Overview: Automata-Theoretic Modeling of Fixed-Priority Non-Preemptive Scheduling for Formal Timing Verification
M. Kauer, S. Steinhorst, R. Schneider, M. Lukasiewycz, S. Chakraborty, "Automata-Theoretic Modeling of Fixed-Priority Non-Preemptive Scheduling for Formal Timing Verification", ASP-DAC 2014: pp. 812-817
*You are required to use SAL. http://sal.csl.sri.com/download.shtml
 
Problem 6: Future technologies (Bio EDA, Security, etc.)
Contributed by: Luis (Danny) Bathen, Dan Holcomb, Anthony Van Herrewege, and Ingrid Verbauwhede
Overview: Mitigation of side-channel attacks through retiming
D. Holcomb, A. V. Herrewege, I. Verbauwhede, "Combinational Retiming to Mitigate Side-Channel Timing Attacks"
 
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. 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. You will not have any internet access during the competition, and you are expected not to discuss any questions with colleagues other than your team member.