File tree 1 file changed +10
-3
lines changed
1 file changed +10
-3
lines changed Original file line number Diff line number Diff line change @@ -2,8 +2,12 @@ A Concurrent data structure is a particular way of storing and organizing
2
2
data for access by multiple computing threads (or processes) on a computer.
3
3
4
4
** Course** : Concurrent Data Structures, Monsoon 2020<br >
5
- ** Taught by** : Prof. Govindarajulu Regeti<br >
6
- ** Book** : The Art of Multiprocessor Programming; Maurice Herlihy, Nir Shavit
5
+ ** Taught by** : Prof. Govindarajulu Regeti
6
+
7
+ <br >
8
+
9
+ Book: [ The Art of Multiprocessor Programming by Maurice Herlihy, Nir Shavit] ( https://github.com/mlearnf/the-art-of-multiprocessor-programming ) <br >
10
+ Project: [ K-Compare Single-Swap] ( https://github.com/javaf/k-compare-single-swap )
7
11
8
12
<br >
9
13
@@ -49,7 +53,10 @@ Exercises:
49
53
50
54
<br >
51
55
52
- - [ Project: K-Compare Single-Swap] ( https://github.com/javaf/k-compare-single-swap )
56
+
57
+ ### References
58
+
59
+ - [ Timeline of Computer History :: Computer History Museum] ( https://www.computerhistory.org/timeline/memory-storage/ )
53
60
54
61
<br >
55
62
You can’t perform that action at this time.
0 commit comments