Dijkstra's Shortest Path Algorithm
An elegant algorithm for finding the shortest path between nodes in a graph.
note
-
-
Packet capturing in parallel with Ansible
An Ansible playbook for running tcpdump in parallel across many servers and collecting the captures.
-
fork System Call
A system call that duplicates the current process, creating a parent and child that continue from the same point.
-
Orphan Processes
A child process whose parent has exited.
-
Zombie Processes
A dead process waiting to be reaped.
-
Getting Started With Ansible
An introduction to Ansible