diff --git a/Assignments/01. Notion of a Monitor.pdf b/Assignments/01. Notion of a Monitor.pdf new file mode 100644 index 0000000..9c683ab Binary files /dev/null and b/Assignments/01. Notion of a Monitor.pdf differ diff --git a/Assignments/01. The Bakery Algorithm.pdf b/Assignments/01. The Bakery Algorithm.pdf new file mode 100644 index 0000000..d6db675 Binary files /dev/null and b/Assignments/01. The Bakery Algorithm.pdf differ diff --git a/Assignments/01. The Dekker Algorithm.pdf b/Assignments/01. The Dekker Algorithm.pdf new file mode 100644 index 0000000..0b70de8 Binary files /dev/null and b/Assignments/01. The Dekker Algorithm.pdf differ diff --git a/Assignments/01. The Dining Philosophers Problem.pdf b/Assignments/01. The Dining Philosophers Problem.pdf new file mode 100644 index 0000000..cbea5f4 Binary files /dev/null and b/Assignments/01. The Dining Philosophers Problem.pdf differ diff --git a/Assignments/01. The Sleeping Barber Problem.pdf b/Assignments/01. The Sleeping Barber Problem.pdf new file mode 100644 index 0000000..75ad260 Binary files /dev/null and b/Assignments/01. The Sleeping Barber Problem.pdf differ diff --git a/Assignments/02. ABA Problem.pdf b/Assignments/02. ABA Problem.pdf new file mode 100644 index 0000000..5d0dedb Binary files /dev/null and b/Assignments/02. ABA Problem.pdf differ diff --git a/Assignments/02. MCS Queue Lock.pdf b/Assignments/02. MCS Queue Lock.pdf new file mode 100644 index 0000000..57006ee Binary files /dev/null and b/Assignments/02. MCS Queue Lock.pdf differ diff --git a/Assignments/03. Bitonic Counting Network.pdf b/Assignments/03. Bitonic Counting Network.pdf new file mode 100644 index 0000000..dbef0cd Binary files /dev/null and b/Assignments/03. Bitonic Counting Network.pdf differ diff --git a/Assignments/04. Elimination Backoff Stack.pdf b/Assignments/04. Elimination Backoff Stack.pdf new file mode 100644 index 0000000..f1089d9 Binary files /dev/null and b/Assignments/04. Elimination Backoff Stack.pdf differ diff --git a/LICENSE b/LICENSE index a3b852e..b0fb8ee 100644 --- a/LICENSE +++ b/LICENSE @@ -1,6 +1,6 @@ MIT License -Copyright (c) 2020 iiithf +Copyright (c) 2020 Subhajit Sahu Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal diff --git a/Presentations/01. DDR, GDDR, HBM Memory.pdf b/Presentations/01. DDR, GDDR, HBM Memory.pdf new file mode 100644 index 0000000..eb4b4f5 Binary files /dev/null and b/Presentations/01. DDR, GDDR, HBM Memory.pdf differ diff --git a/Presentations/02. Leslie Lamport - Turing Lecture.pdf b/Presentations/02. Leslie Lamport - Turing Lecture.pdf new file mode 100644 index 0000000..9129321 Binary files /dev/null and b/Presentations/02. Leslie Lamport - Turing Lecture.pdf differ diff --git a/Project/01. Proposal.pdf b/Project/01. Proposal.pdf new file mode 100644 index 0000000..f27abb5 Binary files /dev/null and b/Project/01. Proposal.pdf differ diff --git a/Project/02. Paper.pdf b/Project/02. Paper.pdf new file mode 100644 index 0000000..ab8b361 Binary files /dev/null and b/Project/02. Paper.pdf differ diff --git a/Project/03. Implementation.pdf b/Project/03. Implementation.pdf new file mode 100644 index 0000000..2f4bb79 Binary files /dev/null and b/Project/03. Implementation.pdf differ diff --git a/Project/04. Presentation 1.pdf b/Project/04. Presentation 1.pdf new file mode 100644 index 0000000..c5e3606 Binary files /dev/null and b/Project/04. Presentation 1.pdf differ diff --git a/Project/05. Presentation 2.pdf b/Project/05. Presentation 2.pdf new file mode 100644 index 0000000..0f8ecd7 Binary files /dev/null and b/Project/05. Presentation 2.pdf differ diff --git a/README.md b/README.md index d01c795..9a5e13b 100644 --- a/README.md +++ b/README.md @@ -1,2 +1,5 @@ -# concurrent-data-structures -A Concurrent data structure is a particular way of storing and organizing data for access by multiple computing threads (or processes) on a computer. +A Concurrent data structure is a particular way of storing and organizing +data for access by multiple computing threads (or processes) on a computer. + +**Course**: Concurrent Data Structures, Monsoon 2020
+**Taught by**: Prof. Govindarajulu Regeti diff --git a/Tutorials/01. Fine-grained Locking.pdf b/Tutorials/01. Fine-grained Locking.pdf new file mode 100644 index 0000000..56ae8c1 Binary files /dev/null and b/Tutorials/01. Fine-grained Locking.pdf differ diff --git a/Tutorials/02. Lock-based Stack.pdf b/Tutorials/02. Lock-based Stack.pdf new file mode 100644 index 0000000..0db26c3 Binary files /dev/null and b/Tutorials/02. Lock-based Stack.pdf differ diff --git a/Tutorials/03. N-ary Combining Tree.pdf b/Tutorials/03. N-ary Combining Tree.pdf new file mode 100644 index 0000000..8ef5f95 Binary files /dev/null and b/Tutorials/03. N-ary Combining Tree.pdf differ diff --git a/Tutorials/04. Lock-based Array Queue.pdf b/Tutorials/04. Lock-based Array Queue.pdf new file mode 100644 index 0000000..07e482d Binary files /dev/null and b/Tutorials/04. Lock-based Array Queue.pdf differ diff --git a/Tutorials/05. N-gender Bathroom Lock.pdf b/Tutorials/05. N-gender Bathroom Lock.pdf new file mode 100644 index 0000000..d482b1e Binary files /dev/null and b/Tutorials/05. N-gender Bathroom Lock.pdf differ diff --git a/Tutorials/06. Savings Account.pdf b/Tutorials/06. Savings Account.pdf new file mode 100644 index 0000000..45bc8dd Binary files /dev/null and b/Tutorials/06. Savings Account.pdf differ