Changes for page Concurrency

Summary

• Page properties (1 modified, 0 added, 0 removed)

Details

Page properties

Content

...	...	@@ -1,99 +97,3 @@
1		-Objects are abstractions of processing, threads are abstractions of timing.
2		-
3		-### Why concurrency?
4		-
5		-* Concurrency is a decoupling strategy. The what is decoupled from the when. Concurrency is important and can improve the throughput and structure of an application. On the other hand, it is hard to write clean concurrent code and it is harder to debug.
6		-* Concurrency doesn't always improve performance behavior and but it always changes the design of the program. When working with containers, you should know exactly what you are doing.
7		-* Concurrency demands a certain amount of management effort, which degrades performance behavior and requires additional code. Proper concurrency is complex, even for simple problems. Concurrency bugs are usually not reproducible; therefore, they are often written off as one-time occurrences (cosmic rays, glitches, etc.) rather than treated as true defects, as they should be. Concurrency requires a fundamental change in design strategy.
8		-* Challenges: When threads access out-of-sync data, incorrect results may be returned.
9		-
10		-### Principles of defensive concurrency programming
11		-
12		-*
13		-
14		-SRP
15		- * Changes to concurrent code should not be mixed with changes to the rest of the code. So you should separate the two cleanly.
16		- * Concurrency has its own life cycle with development, modification, and polish.
17		- * Concurrent code is associated with special problems that have a different form and often a higher degree of difficulty than non-concurrent code.
18		-*
19		-
20		-Constrain the range of validity of data
21		- * Take data encapsulation to heart; restrict access to all shared resources.
22		- * So you should keep the mass of shared code low, and shared resources should only be claimed by threads that need them. That means one should divide the blocks and resources into smaller blocks if necessary.
23		-*
24		-
25		-Work with copies of the data
26		- *
27		-
28		-One can sometimes get around data sharing by:
29		- *
30		- * working with copies of objects and treating them as read-only objects.
31		- * making multiple copies of an object, having multiple threads compute results on it, and merging those results into a single thread.
32		- * It is often worth creating multiple objects to avoid concurrency issues.
33		-*
34		-
35		-Threads should be as independent of each other as possible.
36		- * Threads should not share data or know anything about each other. Instead, they should prefer to work with their own local variables.
37		- * Try to decompose data into independent subsets that can be processed by independent threads, possibly in different processes.
38		-
39		-### Things to learn before working with concurrency
40		-
41		-*
42		-
43		-Get to know your library
44		- * Use the thread-safe collections provided.
45		- * Use the executor framework to execute disjointed tasks.
46		- * Use non-blocking solutions if possible.
47		- * Multiple library classes are not thread-safe.
48		-*
49		-
50		-Thread-safe collections
51		- * So you should use ConcurrentHashMap instead of HashMap.
52		- * Author's recommendations: java.util.concurrent, java.util.concurrent.atomic, java.util.concurrent.locks.
53		-*
54		-
55		-Get to know execution models
56		- *
57		-
58		-Basic definitions
59		- *
60		- * Bound Resources
61		- * Mutual Exclusion
62		- * Starvation
63		- * Deadlock
64		- * Livelock
65		- * Thread Pools
66		- * Runnable
67		- * Callable
68		- * Future
69		- * Java Executor Framework
70		- * Producer-consumer
71		- * Reader-recorder
72		- * Philosopher problem → Study algorithms and their application in solutions.
73		-
74		-### Watch out for dependencies between synchronized methods
75		-
76		-* Dependencies between synchronized methods in concurrent code cause subtle bugs.
77		-*
78		-
79		-Avoid applying more than one method to a shared object. If this is not possible, you have three options:
80		- * Client-based locking: the client should lock the server before the first method is called and ensure that the lock includes the code that calls the last method.
81		- * Server-based locking: Create a method in the server that locks the server, calls all methods, and then unlocks the server. Have the client call the new method.
82		- * Adapted Server: Create an intermediate component that performs the lock. This is a variant of server-based locking if the original server cannot be changed.
83		-*
84		-
85		-Keep synchronized sections small.
86		- * Locks are expensive because they add administrative overhead to delays. On the other hand, critical sections must be protected.
87		- * Critical sections, are parts of the code that are only executed correctly if several threads do not access it at the same time.
88		- * Keep synchronized sections as small as possible.
89		-
90		-### Writing correct shutdown code is difficult
91		-
92		-*
93		-
94		-You should think about a shutdown as early as possible and get it running as soon as possible. If you wait, it will always take longer. Study the available algorithms because this task is probably harder than you think.
95		- * TODO: Why do I need shutdown code?
96		-
97	97	Some Notes:
98	98
99	99	* When I/O is the bottleneck of your application, more threads will increase the performance in opposite to when CPU is the bottleneck.