updates

Signed-off-by: Raj Patil <rajp152k@gmail.com>
rajp152k · Jan 27, 2025 · a02b408 · a02b408
1 parent 93450fa
commit a02b408
Show file tree

Hide file tree

Showing 10 changed files with 63 additions and 0 deletions.
diff --git a/Content/20231229123304-hashmap.org b/Content/20231229123304-hashmap.org
@@ -7,3 +7,6 @@
 
  - Hashmap: A [[id:20230715T173535.681936][Data Structure]] that is stores values indexable with hashed keys.
  - Hash [[id:a31671c6-12ea-4fc9-93cb-73d29fd508a6][Function]]: the corresponding mapping mechanism yielding values for a hashed key.
+
+* Relevant Nodes
+** [[id:fe847008-84df-4128-8a72-7b15ac5655cf][SHA]]
diff --git a/Content/20240101082700-content_delivery_network.org b/Content/20240101082700-content_delivery_network.org
@@ -32,3 +32,5 @@
 ** [[id:80775b3c-b6f1-47db-8752-8c582d9cba53][AnyCast]]
 * Resources
  - https://www.youtube.com/watch?v=RI9np1LWzqw&list=PLCRMIe5FDPsd0gVs500xeOewfySTsmEjf&index=15&ab_channel=ByteByteGo
+ - https://www.akamai.com/resources/reference-architecture/content-delivery
+ - https://www.akamai.com/glossary/what-is-a-cdn
diff --git a/Content/20240205171209-go.org b/Content/20240205171209-go.org
@@ -19,6 +19,9 @@ func main(){
 #+end_src
 
 * Stream
+** 0x234C
+ - hands on SWE with golang
+ - aggressive level up phase
 ** 0x22B2
 - post theGoPL, will finish of TDD with Go
 - have found it to be productive when starting out building a new service

diff --git a/Content/20240501185858-load_balancing.org b/Content/20240501185858-load_balancing.org
@@ -31,6 +31,8 @@
  - application level communication protocols (Layer 7 - HTTP majority) influence routing decisions
 ** Network (L3) Load Balancing
  - Layer 3 traffic is examined (TCP/UDP) to influence routing decisions
+ - checkout [[id:641de843-c1c1-46f4-a994-116e1e5d5abf][Maglev]]
+
 ** Global Server Load Balancing
  - Done across [[id:e5d0b6eb-ea62-4339-a190-97f4cb4b5678][geographically distributed servers]]
  - traffic redirected to a geographically closer server

diff --git a/Content/20250109121831-conferences.org b/Content/20250109121831-conferences.org
@@ -9,3 +9,6 @@
 * European Lisp Symposium
  - https://european-lisp-symposium.org/
 
+
+* UseNix
+ - https://www.usenix.org/
diff --git a/Content/20250120120423-consistent_hashing.org b/Content/20250120120423-consistent_hashing.org
@@ -68,3 +68,5 @@
 * Resources
  - https://www.toptal.com/big-data/consistent-hashing
  - https://en.wikipedia.org/wiki/Consistent_hashing
+ - http://theory.stanford.edu/~tim/s16/l/l1.pdf
+ - https://tom-e-white.com/2007/11/consistent-hashing.html
diff --git a/Content/20250122090314-sdi_glossary.org b/Content/20250122090314-sdi_glossary.org
@@ -18,3 +18,5 @@ A quick index into most common abbreviations in the domain of computer science
 | QPS    | Queries Per Second                     |
 | SSL    | Secure Sockets Layer: Precursor to [[id:06fa9da7-4126-4b08-a367-3a751f31de51][TLS]] |
 | [[id:06fa9da7-4126-4b08-a367-3a751f31de51][TLS]]    | Transport Layer Security               |
+| [[id:fe847008-84df-4128-8a72-7b15ac5655cf][SHA]]    | [[id:6e9b50dc-c5c0-454d-ad99-e6b6968b221a][Secure]] [[id:235113d9-983a-4782-a4e8-d027ba52d82b][Hash]] Algorithms                 |
+|        |                                        |
diff --git a/Content/20250127070238-heapsort.org b/Content/20250127070238-heapsort.org
@@ -3,3 +3,29 @@
 :END:
 #+title: Heapsort
 #+filetags: :algo:cs:
+
+* Detailed Elaboration
+
+- *Definition*: Heapsort is a comparison-based sorting algorithm utilizing a [[id:5ed05b89-71e5-423c-b51c-dc53133c3e91][binary heap]] data structure. It is an efficient way to sort a collection of items.
+
+- *Complexity*:
+  - Time Complexity:
+    - Worst-case: O(n log n)
+    - Average-case: O(n log n)
+    - Best-case: O(n log n)
+  - Space Complexity: O(1) (in-place sorting)
+
+- *Process*:
+  1. *Heap Construction*: Transform the list into a max-heap (or min-heap).
+  2. *Sorting*:
+     - Remove the maximum (or minimum) element from the heap, placing it in the sorted output.
+     - Re-establish the heap property (heapify).
+     - Repeat until the heap is empty.
+
+- *Stability*: Heapsort is **not a stable sorting** algorithm because it can change the relative order of equal elements.
+
+- *Use Cases*:
+  - Best suited for situations where memory space is limited.
+  - Effective for large datasets and when the complete data is not available at once.
+* Resources
+ - https://www.youtube.com/watch?v=koyuy564TZ8&list=PLrS21S1jm43igE57Ye_edwds_iL7ZOAG4&index=2&ab_channel=PavelMavrin
diff --git a/Content/20250127095716-sha.org b/Content/20250127095716-sha.org
@@ -0,0 +1,9 @@
+:PROPERTIES:
+:ID:       fe847008-84df-4128-8a72-7b15ac5655cf
+:ROAM_ALIASES: "Secure Hash Algorithms"
+:END:
+#+title: SHA
+#+filetags: :math:cs:
+
+* Resources
+ - https://en.wikipedia.org/wiki/Secure_Hash_Algorithms
diff --git a/Content/20250127101126-maglev.org b/Content/20250127101126-maglev.org
@@ -0,0 +1,11 @@
+:PROPERTIES:
+:ID:       641de843-c1c1-46f4-a994-116e1e5d5abf
+:END:
+#+title: Maglev
+#+filetags: :tool:cs:
+
+* Relevant Nodes
+** [[id:0d7c2dea-a250-4380-b826-ad4d2547d8d6][Load Balancing]]
+
+* Resources
+ - https://research.google/pubs/maglev-a-fast-and-reliable-software-network-load-balancer/