EECS 507 Papers

Lectures Piazza Papers Description Times Schedule References Gradescope

General Information

Paper Assignments with Student Presentations

  1. 12 Sep: R. Banakar, S. Steinke, B.-S. Lee, M. Balakrishnan, and P. Marwedel, “Scratchpad Memory: A Design Alternative for Cache On-chip Memory in Embedded Systems,” in Proc. Int. Conf. Hardware-Software Co-Design and System Synthesis, May 2002.
  2. 17 Sep: C. L. Liu and James W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment,” in J. ACM, vol. 20, no. 1, Jan. 1973, pp. 46–61.
  3. 19 Sep: TBD.
  4. 24 Sep: L. Zhang, B. Tiwana, Z. Qian, Z. Wang, R. P. Dick, Z. M. Mao, and L. Yang, “Accurate online power estimation and automatic battery behavior based power model generation for smartphones,” in Proc. Int. Conf. Hardware/Software Codesign and System Synthesis, Oct. 2010, pp. 105–114. Notes: On-line component-specific power estimation for smartphones, including a battery state based model construction technique. One of five most cited articles in the history of the Embedded System Week federation of conferences as of 2013.
  5. 26 Sep: J. Polastre, R. Szewczyk, A. Mainwaring, D. Culler, and J. Anderson, “Analysis of wireless sensor net works for habitat monitoring,” in Wireless Sensor Networks, 2004, Springer.

Paper Assignments Without Student Presentations

  1. 10 Sep: L. Yang, R. P. Dick, H. Lekatsas, and S. Chakradhar, “High-performance operating system controlled on-line memory compression,” ACM Trans. Embedded Computing Systems, vol. 9, no. 4, pp. 30:1-30:28, Mar. 2010. I present this one.
  2. 3 Sep: A. Jantsch and I. Sander, “Models of computation and languages for embedded system design,” IEE Proc., pp. 114–129, 2005. Unscored but completion is required.
  3. 5 Sep: R. P. Dick, “Multiobjective synthesis of low-power real-time distributed embedded systems,” Ph.D. dissertation, Dept. of Electrical Engineering, Princeton University, July 2002. Read Chapter 4. No need to write a summary for this one.

References For Those Interested in Greater Depth

  1. Introduction of Michael R. Garey and David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Company, NY, 1979.

Page maintained by Robert Dick.