Adam Morrison
Skip Abstract Section
Abstract
Advanced synchronization methods can boost the performance of multicore software.
- Al Bahra, S. Nonblocking algorithms and scalable multicore programming. Commun. ACM 56, 7 (July 2013), 50--61. Google Scholar
Digital Library
- Boyd-Wickizer, S., Frans Kaashoek, M., Morris, R. and Zeldovich, N. Non-scalable locks are dangerous. In Proceedings of the Ottawa Linux Symposium, 2012, 121--132.Google Scholar
- Boyd-Wickizer, S., Frans Kaashoek, M., Morris, R. and Zeldovich, N. OpLog: A library for scaling update-heavy data structures. Technical Report MIT-CSAIL-TR2014--019, 2014.Google Scholar
- Fatourou, P. and Kallimanis, N.D. Revisiting the combining synchronization technique. In Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2012, 257--266. Google ScholarDigital Library
- Haas, A., Lippautz, M., Henzinger, T.A., Payer, H., Sokolova, A., Kirsch, C.M. and Sezgin, A. Distributed queues in shared memory: multicore performance and scalability through quantitative relaxation. In Proceedings of the ACM International Conference on Computing Frontiers, 2013, 17:1--17:9. Google ScholarDigital Library
- Hendler, D., Incze, I., Shavit, N., Tzafrir, M. Flat combining and the synchronization-parallelism trade-off. In Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures, 2010, 355--364. Google ScholarDigital Library
- Klaftenegger, D., Sagonas, K. and Winblad, K. Delegation locking libraries for improved performance of multithreaded programs. In Proceedings of the 20th International European Conference on Parallel and Distributed Computing, 2014, 572--583.Google ScholarCross Ref
- Kulkarni, M., Pingali, K., Walter, B., Ramanarayanan, G., Bala, K., Chew, L.P. Optimistic parallelism requires abstractions. In Proceedings of the 2007 ACM SIGPLAN Conference on Programming Language Design and Implementation, 211--222. Google ScholarDigital Library
- Lozi, J.-P., David, F., Thomas, G., Lawall, J. and Muller, G. Remote core locking: migrating critical section execution to improve the performance of multithreaded applications. In Proceedings of the 2012 USENIX Annual Technical Conference, 65--76. Google ScholarDigital Library
- Mellor-Crummey, J.M. and Scott, M.L. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. Computer Systems 9, 1 (1991), 21--65. Google ScholarDigital Library
- Michael, M.M. and Scott, M.L. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, 1996, 267--275. Google ScholarDigital Library
- Morrison, A. and Afek, Y. Fast concurrent queues for x86 processors. In Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2013, 103--112. Google ScholarDigital Library
- Oyama, Y., Taura, K. and Yonezawa, A. Executing parallel programs with synchronization bottlenecks efficiently. In Proceedings of International Workshop on Parallel and Distributed Computing for Symbolic and Irregular Applications, 1999, 182--204.Google Scholar
- Shavit, N. Data structures in the multicore age. Comm. ACM 54, 3 (Mar. 2011), 76--84. Google ScholarDigital Library
- Treiber, R.K. Systems programming: coping with parallelism. Technical Report RJ5118 (2006). IBM Almaden Research Center.Google Scholar
Index Terms
- Scaling synchronization in multicore programs
Recommendations
Scaling Synchronization in Multicore Programs: Advanced synchronization methods can boost the performance of multicore software.
WebDesigning software for modern multicore processors poses a dilemma. Traditional software designs, in which threads manipulate shared data, have limited scalability because synchronization of updates to shared data serializes threads and limits ...
Dark silicon and the end of multicore scaling
ISCA '11: Proceedings of the 38th annual international symposium on Computer architectureSince 2005, processor designers have increased core counts to exploit Moore's Law scaling, rather than focusing on single-core performance. The failure of Dennard scaling, to which the shift to multicore parts is partially a response, may soon limit ...
Dark silicon and the end of multicore scaling
ISCA '11Since 2005, processor designers have increased core counts to exploit Moore's Law scaling, rather than focusing on single-core performance. The failure of Dennard scaling, to which the shift to multicore parts is partially a response, may soon limit ...
Comments