Programming with relaxed synchronization

SPLASH 2012: RACES 2012 - Proceedings of the 2012 ACM Workshop on Relaxing Synchronization for Multicore and Manycore Scalability

Volumn , Issue , 2012, Pages 41-50

  Renganarayana, Lakshminarayanan ^a   Srinivasan, Vijayalakshmi ^a   Nair, Ravi ^a   Prener, Daniel ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Approximate computing; Parallelism; Relax and check; Relaxed synchronization

Indexed keywords

APPROXIMATE COMPUTING; APPROXIMATE RESULTS; K-MEANS; PARALLEL APPLICATION; PARALLEL PROGRAM; PARALLELISM; RELAX AND CHECK;

SCALABILITY;

SYNCHRONIZATION;

EID: 84872111365     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2414729.2414737     Document Type: Conference Paper

References (22)

1. J. Alemany and E. W. Felten. Performance issues in nonblocking synchronization on shared-memory multiprocessors. In Proceedings of the eleventh annual ACM symposium on Principles of distributed computing, PODC '92, pages 125-134, New York, NY, USA, 1992. (Pubitemid 23608137)
2. F. Allen, M. Burke, R. Cytron, J. Ferrante, and W. Hsieh. A framework for determining useful parallelism. In Proceedings of the 2nd international conference on Supercomputing, ICS '88, pages 207-215, New York, NY, USA, 1988.
3. W. Baek and T. M. Chilimbi. Green: a framework for supporting energy-conscious programming using controlled approximation. In Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation, PLDI '10, pages 198-209, New York, NY, USA, 2010.
4. G. M. Baudet. Asynchronous iterative methods for multiprocessors. J. ACM, 25:226-244, April 1978.
5. C. Cao Minh, J. Chung, C. Kozyrakis, and K. Olukotun. STAMP: Stanford transactional applications for multiprocessing. In IISWC '08: Proceedings of The IEEE International Symposium on Workload Characterization, 2008.
6. M. Carbin, D. Kim, S. Misailovic, and M. C. Rinard. Proving acceptability properties of relaxed nondeterministic approximate programs. In Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation, PLDI '12, pages 169-180, New York, NY, USA, 2012. ACM.
7. F. Checconi, F. Petrini, J.Willcock, A. Lumsdaine, Y. Sabharwal, and A. Choudhury. Breaking the Speed and Scalability Barriers for Graph Exploration on Distributed-Memory Machines. In Proceedings of The 2012 International Conference for High-Performance Computing, Networking, Storage, and Analysis, SC12, 2012.
8. J. Demmel, J. Dongarra, V. Eijkhout, E. Fuentes, A. Petitet, R. Vuduc, R. Whaley, and K. Yelick. Self-Adapting Linear Algebra Algorithms and Software. Proceedings of the IEEE, 93(2):293, 2005.
9. The Graph 500 benchmark. http://www.graph500.org/.
10. M. Gupta. On privatization of variables for data-parallel execution. In In Proceedings of the 11th International Parallel Processing Symposium, pages 533-541, 1997.
11. M. Herlihy and J. E. B. Moss. Transactional memory: architectural support for lock-free data structures. In Proceedings of the 20th annual international symposium on computer architecture, ISCA '93, pages 289-300, New York, NY, USA, 1993. (Pubitemid 23675551)
12. H. Jin, M. Frumkin, and J. Yan. The OpenMP implementation of NAS parallel benchmarks and its performance. Technology, (October):6, 1999.
13. P. M. W. Knijnenburg, T. Kisuki, and M. F. P. O'Boyle. Iterative compilation. In Embedded processor design challenges: systems, architectures, modeling, and simulation-SAMOS, pages 171-187. Springer-Verlag New York, Inc., New York, NY, USA, 2002.
14. L. Lamport. Concurrent reading and writing. Commun. ACM, 20:806-811, November 1977.
15. Z. Li. Array privatization for parallel execution of loops. In Proceedings of the 6th international conference on Supercomputing, ICS '92, pages 313-322, New York, NY, USA, 1992.
16. S. Misailovic, D. Kim, and M. Rinard. Parallelizing sequential programs with statistical accuracy tests. Technical Report MIT-CSAIL-TR-2010-038, MIT, 2010.
17. R. Narayanan, B. Ozisikyilmaz, J. Zambreno, G. Memik, and A. Choudhary. Minebench: A benchmark suite for data mining workloads. In Workload Characterization, 2006 IEEE International Symposium on, pages 182 -188, oct. 2006.
18. M. Rinard, H. Hoffmann, S. Misailovic, and S. Sidiroglou. Patterns and statistical analysis for understanding reduced resource computing. In Proceedings of the ACM international conference on Object oriented programming systems languages and applications, OOPSLA '10, pages 806-821, New York, NY, USA, 2010.
19. N. Shavit and D. Touitou. Software transactional memory. In Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing, PODC '95, pages 204-213, New York, NY, USA, 1995.
20. D. Ungar, D. Kimelman, and S. Adams. Inconsistency robustness for scalability in interactive concurrent update inmemory molap cubes. Inconsistency Robustness Symposium, August 2011.
21. R. C. Whaley and J. J. Dongarra. Automatically tuned linear algebra software. In Proceedings of the 1998 ACM/IEEE conference on Supercomputing (CDROM), pages 1-27. IEEE Computer Society, 1998.
22. Z. A. Zhu, S. Misailovic, J. A. Kelner, and M. Rinard. Randomized accuracy-aware program transformations for efficient approximate computations. In Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, POPL '12, pages 441-454, New York, NY, USA, 2012. ACM.