Incorrect systems: It's not the problem, it's the solution

Proceedings - Design Automation Conference

Volumn , Issue , 2012, Pages 913-917

  Kirsch, Christoph M ^a   Payer, Hannes ^a  

^a UNIVERSITY OF SALZBURG   (Austria)

Author keywords

performance; power consumption; probabilistic computing; relaxed correctness; robustness; scalability

Indexed keywords

BEST-EFFORT; CONCURRENT DATA STRUCTURES; DIGITAL SYSTEM; HARDWARE AND SOFTWARE; MULTICORE ARCHITECTURES; NON FUNCTIONAL PROPERTIES; PERFORMANCE; PERFORMANCE IMPROVEMENTS; PROBABILISTIC COMPUTING; PROGRAM TRANSFORMATIONS; RELAXED CORRECTNESS; RESOURCE CONSUMPTION;

COMPUTER AIDED DESIGN; COMPUTER ARCHITECTURE; CONCURRENCY CONTROL; COST ENGINEERING; DATA STRUCTURES; ELECTRIC POWER UTILIZATION; HARDWARE; MULTIPROCESSING SYSTEMS; PROGRAM PROCESSORS; RANDOM PROCESSES; ROBUSTNESS (CONTROL SYSTEMS); SCALABILITY;

MULTICORE PROGRAMMING;

EID: 84863541710     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2228360.2228523     Document Type: Conference Paper

References (22)

1. Designing chips without guarantees. IEEE Design and Test of Computers, 27:60-67, 2010.
2. Y. Afek, G. Korland, and E. Yanovsky. Quasi-linearizability: Relaxed consistency for improved concurrency. In Proc. Conference on Principles of Distributed Systems (OPODIS), pages 395-410. Springer, 2010.
3. S. Chakradhar and A. Raghunathan. Best-effort computing: re-thinking parallel software and hardware. In Proc. Design Automation Conference (DAC), pages 865-870. ACM, 2010.
4. L. Chakrapani, P. Korkmaz, B. Akgul, and K. Palem. Probabilistic system-on-a-chip architectures. Transactions on Design Automation of Electronic Systems (TODAES), 12(3):29:1-29:28, May 2008.
5. L. Chakrapani, K. Muntimadugu, A. Lingamneni, J. George, and K. Palem. Highly energy and performance efficient embedded computing through approximately correct arithmetic: a mathematical foundation and preliminary experimental validation. In Proc. Conference on Compilers, Architectures and Synthesis for Embedded Systems (CASES), pages 187-196. ACM, 2008.
6. T. A. Henzinger. The theory of hybrid automata. In Proc. Symposium on Logic in Computer Science (LICS), pages 278-292. IEEE, 1996.
7. D. H. I. Incze, N. Shavit, and M. Tzafrir. Flat combining and the synchronization-parallelism tradeoff. In Proc. Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 355-364. ACM, 2010.
8. C. Kirsch, H. Payer, H. Röck, and A. Sokolova. Brief announcement: Scalability versus semantics of concurrent FIFO queues. In Proc. Symposium on Principles of Distributed Computing (PODC), pages 331-332. ACM, 2011.
9. C. Kirsch, H. Payer, H. Röck, and A. Sokolova. Performance, scalability, and semantics of concurrent FIFO queues. Technical Report 2011-03, Department of Computer Sciences, University of Salzburg, September 2011.
10. L. Leem, C. Hyungmin, J. Bau, Q. Jacobson, and S. Mitra. Ersa: Error resilient system architecture for probabilistic applications. In Proc.Design, Automation Test in Europe Conference Exhibition (DATE), pages 1560-1565, 2010.
11. A. Lingamneni, K. Muntimadugu, C. Enz, R. Karp, K. Palem, and C. Piguet. Algorithmic methodologies for ultra-efüňA̧cient inexact architectures for sustaining technology scaling. In Proc. Computing Frontiers (CF). ACM, 2012.
12. A. Lingamneni and K. Palem. What to do about the end of Moore's law, probably! In Proc. Design Automation Conference (DAC). ACM, 2012.
13. M. Michael and M. Scott. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In Proc. Symposium on Principles of Distributed Computing (PODC), pages 267-275. ACM, 1996.
14. M. Michael, M. Vechev, and V. Saraswat. Idempotent work stealing. In Proc. Symposium on Principles and Practice of Parallel Programming (PPoPP), pages 45-54. ACM, 2009.
15. S. Narayanan, J. Sartori, R. Kumar, and D. Jones. Scalable stochastic processors. In Proc. Conference on Design, Automation and Test in Europe (DATE), pages 335-338. European Design and Automation Association, 2010.
16. K. Palem, L. Chakrapani, Z. Kedem, A. Lingamneni, and K. Muntimadugu. Sustaining moore's law in embedded computing through probabilistic and approximate design: Retrospects and prospects. In Proc. Conference on Compilers, Architecture, and Synthesis for Embedded Systems (CASES), pages 1-10. ACM, 2009.
17. M. Rinard. A lossy, synchronization-free, race-full, but still acceptably accurate parallel space-subdivision tree construction algorithm. Technical Report 2012-03-005, MIT-CSAIL, February 2012.
18. M. Rinard. Obtaining and reasoning about good enough software. In Proc. Design Automation Conference (DAC). ACM, 2012.
19. J. Sartori, J. Sloan, and R. Kumar. Stochastic computing: embracing errors in architectureand design of processors and applications. In Proc. Conference on Compilers, Architectures and Synthesis for Embedded Systems (CASES), pages 135-144. ACM, 2011.
20. S. Sidiroglou-Douskos, S. Misailovic, H. Hoffmann, and M. Rinard. Managing performance vs. accuracy trade-offs with loop perforation. In Proc. Symposium and Conference on Foundations of Software Engineering (ESEC/FSE), pages 124-134. ACM, 2011.
21. J. Sloan, J. Sartori, and R. Kumar. On software design for stochastic processors. In Proc. Design Automation Conference (DAC). ACM, 2012.
22. Z. Zhu, S. Misailovic, J. Kelner, and M. Rinard. Randomized accuracy-aware program transformations for efficient approximate computations. In Proc. Symposium on Principles of Programming Languages (POPL), pages 441-454. ACM, 2012.