Modeling/TheoremParadigm
-
Reactive ManifestoModeling/TheoremParadigm 2020. 7. 5. 18:31
1. Overview 1.1 Comparison Term Reactive Systems Reactive Programming Functional Reactive Programming(FRP) Description Architecture and Design Generally, Event-Based Often confused with Reactive Programming 1.2 Reactive Programming with Reactive Systems Reactive Programming is a useful implementation technique Reactive Programming focuses on non-blocking, asynchronous execution - a key of charac..
-
Parallel Algorithms and Sequential AlgorithmsModeling/TheoremParadigm 2020. 2. 27. 21:22
1. Overview In the case of Sequential algorithms, It should execute the tasks one after each other. In the case of Parallel algorithms, we execute different tasks with different processors then combine the results. Some problems are easy to parallelizable, other problems are completely sequential. 2. Description 2.1 Parallel algorithms Checking prime numbers in a range. We have to make subsets. ..
-
Locking Strategies and DeadlocksModeling/TheoremParadigm 2020. 2. 27. 01:37
1. Overview In concurrent computing, a deadlock is a state in which each member of a group is waiting for another member, including itself, to take action, such as sending a message or more commonly releasing a lock. Deadlock is a common problem in multiprocessing systems, parallel computing, and distributed systems, where software and hardware locks are used to arbitrate shared resources and im..
-
Database ScalingModeling/TheoremParadigm 2020. 2. 23. 20:50
1. Methods of Scaling 1.1 Vertical Scaling (Scale-up) In Vertical Scaling, we increase the CPU, RAM, and Storage or buy a more robust server in order to support more traffic and load on our database server. 1.2 Horizontal Scaling (Scale-out) In Horizontal Scaling we add more systems with the smaller configuration in terms of CPU, RAM and Storage to distribute the traffic or load across these sys..
-
Cooperative vs Preemptive MultitaskingModeling/TheoremParadigm 2019. 11. 10. 14:08
1. Overview Cooperative multitasking, also known as non-preemptive multitasking, is a style of computer multitasking in which the operating system never initiates a context switch from a running process to another process. Instead, processes voluntarily yield control periodically or when idle or logically blocked in order to enable multiple applications to be run concurrently. This type of multi..
-
Eventual consistency and strict consistencyModeling/TheoremParadigm 2019. 9. 28. 21:23
1. Overview Let’s define eventual consistency vs strict consistency. 2. Description 2.1 Strict consistency(or immediate or strong) For any incoming write operation, once a write is acknowledged to the client, the updated value is visible on reading from any replicated node (server) in the system Guaranteed data resiliency Once a write is acknowledged to the client the update is protected from no..
-
Difference between Concurrency and ParallelismModeling/TheoremParadigm 2019. 8. 18. 20:31
1. Overview Distinguish two concepts in detail. 2. Comparison Between Concurrency and Parallelism Concurrency Parallelism Basic Running multiple computations at the same time Running multiple computations simultaneously Achieved through Interleaving operation Using multiple CPU's Benefits An increasing amount of work accomplished at a time Multiple CPU's for operating multiple processes Make use..
-
Polymorphism, Upcasting, And DowncastingModeling/TheoremParadigm 2019. 8. 18. 20:21
1. Overview Organize Polymorphism, Upcasting, and Downcasting. and then find usages and pitfalls each casting. 2. Description 2.1 Polymorphism The ability of an object to take on many forms. All methods in Java are virtual by default. so Any method can be overridden when used in inheritance unless that method is declared as final or static. When we cast object only the reference type of the obje..