45. Bibliography#

AASEH17

Abbaspour Asadollah, S., Sundmark, D., Eldh, S., and Hans Hansson. Concurrency bugs in open source software: a case study. Journal of Internet Services and Applications, 8(4):1–15, apr 2017. URL: https://doi.org/10.1186/s13174-017-0055-2, doi:10.1186/s13174-017-0055-2.

ABDL07

Nitin Agrawal, William J. Bolosky, John R. Douceur, and Jacob R. Lorch. A five-year study of file-system metadata. ACM Trans. Storage, 3(3):9–es, oct 2007. URL: https://doi.org/10.1145/1288783.1288788, doi:10.1145/1288783.1288788.

ADAD18

Remzi H Arpaci-Dusseau and Andrea C Arpaci-Dusseau. Operating systems: Three easy pieces. Arpaci-Dusseau Books LLC Boston, 2018. URL: https://pages.cs.wisc.edu/~remzi/OSTEP/.

CES71

E. G. Coffman, M. Elphick, and A. Shoshani. System deadlocks. ACM Comput. Surv., 3(2):67–78, jun 1971. URL: https://doi.org/10.1145/356586.356588, doi:10.1145/356586.356588.

CHP71

P. J. Courtois, F. Heymans, and D. L. Parnas. Concurrent control with “readers” and “writers”. Commun. ACM, 14(10):667–668, oct 1971. URL: https://doi.org/10.1145/362759.362813, doi:10.1145/362759.362813.

Dij65

missing institution in 10.5555/1102034

HMBW07

Thomas E. Hart, Paul E. McKenney, Angela Demke Brown, and Jonathan Walpole. Performance of memory reclamation for lockless synchronization. J. Parallel Distrib. Comput., 67(12):1270–1285, dec 2007. URL: https://doi.org/10.1016/j.jpdc.2007.04.010, doi:10.1016/j.jpdc.2007.04.010.

Her90

M. Herlihy. A methodology for implementing highly concurrent data structures. In Proceedings of the Second ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, PPOPP '90, 197–206. New York, NY, USA, 1990. Association for Computing Machinery. URL: https://doi.org/10.1145/99163.99185, doi:10.1145/99163.99185.

Her93

Maurice Herlihy. A methodology for implementing highly concurrent data objects. ACM Trans. Program. Lang. Syst., 15(5):745–770, nov 1993. URL: https://doi.org/10.1145/161468.161469, doi:10.1145/161468.161469.

Hol72

Richard C. Holt. Some deadlock properties of computer systems. ACM Comput. Surv., 4(3):179–196, sep 1972. URL: https://doi.org/10.1145/356603.356607, doi:10.1145/356603.356607.

Lam74

Leslie Lamport. A new solution of dijkstra's concurrent programming problem. Commun. ACM, 17(8):453–455, aug 1974. URL: https://doi.org/10.1145/361082.361093, doi:10.1145/361082.361093.

LPSZ08

Shan Lu, Soyeon Park, Eunsoo Seo, and Yuanyuan Zhou. Learning from mistakes: a comprehensive study on real world concurrency bug characteristics. In Proceedings of the 13th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS XIII, 329–339. New York, NY, USA, 2008. Association for Computing Machinery. URL: https://doi.org/10.1145/1346281.1346323, doi:10.1145/1346281.1346323.

MCS91

John M. Mellor-Crummey and Michael L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. Comput. Syst., 9(1):21–65, feb 1991. URL: https://doi.org/10.1145/103727.103729, doi:10.1145/103727.103729.

Pet81

Gary L. Peterson. Myths about the mutual exclusion problem. Information Processing Letters, 12:115–116, 1981.

Sch97

missing title in Schneider1997

TB14

Andrew S. Tanenbaum and Herbert Bos. Modern Operating Systems. Prentice Hall Press, USA, 4th edition, 2014. ISBN 013359162X.