Price’s law
[Note: this could be some random bullshit on Linkedin, but I thought it interesting.]
50% of the work is done by the square root of the total number of people who participate in the work.
He tested it across different groups and audiences and it almost universally applied.
Especially in business.
The square root of the number of people in a company do 50% of the work.
Competence grows linearly.
Incompetence grows exponentially.??? What does this mean?
This is similar to the 80-20 Rule 202212291608
Note 12-29-22: Apparently, this is a “poor fit” according to empirical data.
uid: 202211260107 tags: #knowledge
Snow Shopping
Boots shopping
Snowboard shopping
- Jones Frontier snowboard size 156 - sporting goods - by owner - sale — $300
- Email: readdle-spark://bl=QTpta2hhdHRhckBiZXJrZWxleS5lZHU7SUQ6Q0FBNT1Wb2M4VXN2Mm9BaHhZeXYx%0D%0AcVBCY1hUVUZheDg9TmYzZnBkM1p1ZmNpNDBzNGN3QG1haWwuZ21haWwuY29tO2dJ%0D%0ARDoxNzUwNDE2MDY3NDI4NTY3MDEzOzE0MzcwOTQ4NjM%3D
Vocabulary
- Stance setback: This means that the snowboard is closer to the tail, which makes it easier to ride in powder.
uid: 202211241336 tags: #snowboarding
Total Order Broadcast
Total order broadcast is usually described as a protocol for exchanging messages between nodes. Informally, it requires that two safety properties always be satisfied:
- Reliable delivery
- No messages are lost: if a message is delivered to one node, it is delivered to all nodes.
- Totally ordered delivery
- Messages are delivered to every node in the same order.
Created from: Raft & Paxos 202211231100
uid: 202211232155 tags: #distributed-systems #software-engineering
Consensus
A consensus algorithm must satisfy the following properties:
- Uniform agreement: No two nodes decide differently.
- Integrity: No node decides twice.
- Validity: If a node decides value
v, then v was proposed by some node. - Termination: Every node that does not crash eventually decides some value.
Created from: Raft & Paxos 202211231100
uid: 202211232125 tags: #distributed-systems #software-engineering
Leaky Bucket
The algorithm is used for packet transmissions, to keep within defined limits on the bandwidth and burstiness of the network.
A simple leaky bucket algorithm can be implemented using FIFO queue.
The following is an algorithm for variable-length packets:
- Initialize a counter to n at the tick of the clock.
- Repeat until n is smaller than the packet size of the packet at the head of the queue.
- Pop a packet out of the head of the queue, say P.
- Send the packet P, into the network
- Decrement the counter by the size of packet P.
Created from: Algorithms to know before system design interviews 202211231052
uid: 202211231056 tags: #algorithms #software-engineering
Consistent Hashing
Consistent hashing is a way of evenly distributing load across a system of caches on the internet (like a content delivery network (CDN)).
In computer science, consistent hashing is a special kind of hashing technique such that when a hash table is resized, only n/m keys need to be remapped on average where n is the number of keys and m is the number of slots. In contrast, in most traditional hash tables, a change in the number of array slots causes nearly all keys to be remapped because the mapping between the keys and the slots is defined by a modular operation.
Created from: Algorithms to know before system design interviews 202211231052
uid: 202211231055 tags: #algorithms #software-engineering