Αγορά Πολιτών

Τρόπος Συμμετοχής

Χορηγίες

Πολίτες στην Αγορά

Έχουμε 1151 επισκέπτες συνδεδεμένους

Επικοινωνία

Γερμανία 004917667046073

The Absolute Evil

 

Gang-stalking Greeks

 

Byzantine Atrocities

 

European Dissidents ALARM

 

Human Rights' Court

 

The used up men

 

Dissidents - USG RICO crimes

 

Open Letter to Theresa May

 

Open Letter to António Guterres UN's SG

 

Triangulation - Zersetzen

 

Open Letter to Andrew Parker, MI5

  

Πράξεις ποταπές - Despicable choices

 

 

My father's death

 

Cavitation damage

 

Burglary and vandalism

 

Dry mini submarine

 

Message to Bundeswehr 2

 

Message to Bundeswehr 1

 

“Tough” guys and TOUGH guys

 

Μοναδική λύση, το Χόλιγουντ

 

Charlatans

 

Zeppelin: Beyond Gravity

 

Foreign intervention in Greece?

 

Η ανελεύθερη Ελλάδα

 

Η Ελλάδα καταγώγιο;

 

Αν.Επ. Π. Παυλόπουλο

  

Intangible prisons

 

Plausible deniability

 

Images of German w & s

 

Crimes against Humanity

 

"Chimera" - "Bellerophon"

 

pr. Donald Trump

 

  

Legal Notice 87

 

Βδέλλες, αποικιοκρατικές

 

Being a German

 

Legal Notice 84

 

Dirty colonial methods

 

Georgi Markov, BG - KGB

 

Samples of Barbarity

 

Ελλάδα - αποκόλληση

 

Έλληνες, στο έλεος...

 

Harvester's log 16/3/17

 

 

Legal Notice 66

 

Execrable

 

Legal Notice 62

 

  

My story

 

  

Aggression?

 

  

Η Εστία μου

 

  

Why so untidy?

 

  

Αποικιοκρατία

 

  

Εξόντωση Ελλήνων αντιφρονούντων;

 

  

Ζήτημα εμπιστοσύνης

 

  

Μεθοδικότητα

 

  

Ανοικτή Επιστολή πρέσβη ΗΠΑ

Αφορμή, U2RIT vs Ελλάδα;

Βιοηθική

A request to U2RIT

Colonial aggression - 2

Open Letter to UN S.G.

Open Letter to p.C. & p. O.

Δήλωση πρόθεσης επαναπατρισμού

 

Ο "εφιάλτης" της Νυρεμβέργης

Συλλογή Φωτογραφιών

Αίτημα προστασίας, προς Ιταλία

Chroma key, background removal

Science and Ethics

Να συμβάλει και η U2RIT

Θα ξαναφτιάξουν πολλές φορές Άουσβιτς και Zyclon B

 

Split-Screen effect

Η Ζωή είναι Ωραία.

Βόρεια Κορέα

Λευτεριά στους Έλληνες, εξανα- γκαστικά "Εξαφανισμένους"

 

Μυστικές δίκες;

Trustworthiness

Πολιτισμό, ή, απληστία;

Ακραία Στυγνότητα

Η Τέχνη της Επιβίωσης

Political Asylum 3

Επιστροφή στις ρίζες

The Human Cost of Torture

An urgent appeal for solidarity

More obvious than the Sun

Western "culture"

Political Asylum

Έννομη Προστασία

Μια μήνυση που εγείρει ερωτηματικά

 

 

 

Honor your father...

Noise

Creative Greeks

A pair of Dictatorships

The pseudo-dilemma, Unfreedom or War? PDF Εκτύπωση E-mail
Αξιολόγηση Χρήστη: / 0
ΧείριστοΆριστο 
Συνεννόηση για Δράση - Απόψεις
Συντάχθηκε απο τον/την Χρήστος Μπούμπουλης (Christos Boumpoulis)   
Τετάρτη, 24 Ιανουάριος 2018 08:51
The pseudo-dilemma, Unfreedom or War?
The Red Terror was a period of political repression and mass killings carried out by Bolsheviks after the beginning of the Russian Civil War in 1918. Soviet historiography describes the Red Terror as having been officially announced in September 1918 by Yakov Sverdlov and ending about October 1918. However, the term was frequently applied to Bolshevik political repression during the whole period of the Civil War (1917–1922), as distinguished from the White Terror carried out by the anti-Bolshevik side. The Cheka (the Bolshevik secret police) carried out the repressions of the Red Terror. Estimates for the total number of people killed during the Red Terror for the initial period of repression are at least 10,000. The most accurate estimations for the total number of killings put the number at about 100,000. Estimates for total executed reach 200,000. The majority of the violence's targets during the initial phase of the Red Terror were representatives of the Tsarist regime and former Tsarist officers, along with significant numbers of bourgeoisie.
 
Human Harvest Official Trailer
www.youtube.com/watch?v=N7ZmFLi0lgY
 
Khazarian Mafia has Gone Mad, Follows the French Revolution’s Reign of Terror
If we take cognizance of the bloody aftermath of the French Revolution, we need to know that in the modern era, Khazarian Mafia has also gone mad and follows the French Revolution’s Reign of Terror in its worst form. This Mafia has refined the tactics of the guillotine and tortured to deaths millions of people, belonging to various nations. If guillotine resulted into quick death of persons, Khazarian Mafia’s techniques have been eliminating the human beings not only through mass murder, but also through perennial pain which may also be equated with slow poison.
 
The Thirty Years' War was a war fought primarily in Central Europe between 1618 and 1648. One of the longest and most destructive conflicts in human history, as well as the deadliest European religious war in history, the war resulted in eight million fatalities.
 
Mutual Exclusion
In computer science, mutual exclusion is a property of concurrency control, which is instituted for the purpose of preventing race conditions; it is the requirement that one thread of execution never enter its critical section at the same time that another concurrent thread of execution enters its own critical section. The requirement of mutual exclusion was first identified and solved by Edsger W. Dijkstra in his seminal 1965 paper titled Solution of a problem in concurrent programming control, which is credited as the first topic in the study of concurrent algorithms. A simple example of why mutual exclusion is important in practice can be visualized using a singly linked list of four items, where the second and third are to be removed. The removal of a node that sits between 2 other nodes is performed by changing the nextpointer of the previous node to point to the next node (in other words, if node i is being removed, then the next pointer of node i − 1 is changed to point to node i + 1, thereby removing from the linked list any reference to node i). When such a linked list is being shared between multiple threads of execution, two threads of execution may attempt to remove two different nodes simultaneously, one thread of execution changing the nextpointer of node i − 1 to point to node i + 1, while another thread of execution changes the next pointer of node i to point to node i + 2. Although both removal operations complete successfully, the desired state of the linked list is not achieved: node i + 1 remains in the list, because the next pointer of node i − 1 points to node i + 1.This problem (called a race condition) can be avoided by using the requirement of mutual exclusion to ensure that simultaneous updates to the same part of the list cannot occur.
Problem description
The problem which mutual exclusion addresses is a problem of resource sharing: how can a software system control multiple processes' access to a shared resource, when each process needs exclusive control of that resource while doing its work? The mutual-exclusion solution to this makes the shared resource available only while the process is in a specific code segment called the critical section. It controls access to the shared resource by controlling each mutual execution of that part of its program where the resource would be used. A successful solution to this problem must have at least these two properties: It must implement mutual exclusion: only one process can be in the critical section at a time.It must be free of deadlocks: if processes are trying to enter the critical section, one of them must eventually be able to do so successfully, provided no process stays in the critical section permanently. Deadlock freedom can be expanded to implement one or both of these properties: Lockout-freedom guarantees that any process wishing to enter the critical section will be able to do so eventually. This is distinct from deadlock avoidance, which requires that some waiting process be able to get access to the critical section, but does not require that every process gets a turn. If two processes continually trade a resource between them, a third process could be locked out and experience resource starvation, even though the system is not in deadlock. If a system is free of lockouts, it ensures that every process can get a turn at some point in the future.A k-bounded waiting property gives a more precise commitment than lockout-freedom. Lockout-freedom ensures every process can access the critical section eventually: it gives no guarantee about how long the wait will be. In practice, a process could be overtaken an arbitrary or unbounded number of times by other higher-priority processes before it gets its turn. Under a k-bounded waiting property, each process has a finite maximum wait time. This works by setting a limit to the number of times other processes can cut in line, so that no process can enter the critical section more than k times while another is waiting. Every process' program can be partitioned into four sections, resulting in four states. Program execution cycles through these four states in order:
Non-Critical SectionOperation is outside the critical section; the process is not using or requesting the shared resource.TryingThe process attempts to enter the critical section. Critical SectionThe process is allowed to access the shared resource in this section. Exit The process leaves the critical section and makes the shared resource available to other processes.If a process wishes to enter the critical section, it must first execute the trying section and wait until it acquires access to the critical section. After the process has executed its critical section and is finished with the shared resources, it needs to execute the exit section to release them for other processes' use. The process then returns to its non-critical section.
Enforcing mutual exclusion
There are both software and hardware solutions for enforcing mutual exclusion. Some different solutions are discussed below.
Hardware solutions
On uniprocessor systems, the simplest solution to achieve mutual exclusion is to disable interrupts during a process's critical section. This will prevent any interrupt service routines from running (effectively preventing a process from being preempted). Although this solution is effective, it leads to many problems. If a critical section is long, then the system clock will drift every time a critical section is executed because the timer interrupt is no longer serviced, so tracking time is impossible during the critical section. Also, if a process halts during its critical section, control will never be returned to another process, effectively halting the entire system. A more elegant method for achieving mutual exclusion is the busy-wait.Busy-waiting is effective for both uniprocessor and multiprocessor systems. The use of shared memory and an atomic test-and-set instruction provide the mutual exclusion. A process can test-and-set on a location in shared memory, and since the operation is atomic, only one process can set the flag at a time. Any process that is unsuccessful in setting the flag can either go on to do other tasks and try again later, release the processor to another process and try again later, or continue to loop while checking the flag until it is successful in acquiring it. Preemption is still possible, so this method allows the system to continue to function—even if a process halts while holding the lock. Several other atomic operations can be used to provide mutual exclusion of data structures; most notable of these is compare-and-swap (CAS). CAS can be used to achieve wait-free mutual exclusion for any shared data structure by creating a linked list where each node represents the desired operation to be performed. CAS is then used to change the pointers in the linked list during the insertion of a new node. Only one process can be successful in its CAS; all other processes attempting to add a node at the same time will have to try again. Each process can then keep a local copy of the data structure, and upon traversing the linked list, can perform each operation from the list on its local copy.
Software solutions
Beside hardware-supported solutions, some software solutions exist that use busy waitingto achieve mutual exclusion. Examples of these include the following: Dekker's algorithm; Peterson's algorithm; Lamport's bakery algorithm; Szymanski's algorithm;Taubenfeld's black-white bakery algorithm. These algorithms do not work if out-of-order execution is used on the platform that executes them. Programmers have to specify strict ordering on the memory operations within a thread. It is often preferable to use synchronization facilities provided by an operating system's multithreading library, which will take advantage of hardware solutions if possible but will use software solutions if no hardware solutions exist. For example, when the operating system's lock library is used and a thread tries to acquire an already acquired lock, the operating system could suspend the thread using a context switch and swap it out with another thread that is ready to be run, or could put that processor into a low power state if there is no other thread that can be run. Therefore, most modern mutual exclusion methods attempt to reduce latencyand busy-waits by using queuing and context switches. However, if the time that is spent suspending a thread and then restoring it can be proven to be always more than the time that must be waited for a thread to become ready to run after being blocked in a particular situation, then spinlocks are an acceptable solution (for that situation only).
Bound on the mutual exclusion problem
One binary test&set register is sufficient to provide the deadlock-free solution to the mutual exclusion problem. But a solution built with a test&set register can possibly lead to the starvation of some processes which become caught in the trying section. In fact, Ω  distinct memory states are required to avoid lockout. To avoid unbounded waiting,n distinct memory states are required.
Recoverable mutual exclusion
Most algorithms for mutual exclusion are designed with the assumption that no failure occurs while a process is running inside the critical section. However, in reality such failures may be commonplace. For example, a sudden loss of power or faulty interconnect might cause a process in a critical section to experience an unrecoverable error or otherwise be unable to continue. If such a failure occurs, conventional, non-failure-tolerant mutual exclusion algorithms may deadlock or otherwise fail key liveness properties. To deal with this problem, several solutions using crash-recovery mechanisms have been proposed.
Types of mutual exclusion devices
The solutions explained above can be used to build the synchronization primitives below: locks (mutexes);readers–writer locks; recursive locks; semaphores; monitors; message passing; tuple space.Many forms of mutual exclusion have side-effects. For example, classic semaphorespermit deadlocks, in which one process gets a semaphore, another process gets a second semaphore, and then both wait till the other semaphore to be released. Other common side-effects include starvation, in which a process never gets sufficient resources to run to completion; priority inversion, in which a higher priority thread waits for a lower-priority thread; and high latency, in which response to interrupts is not prompt.Much research is aimed at eliminating the above effects, often with the goal of guaranteeing non-blocking progress. No perfect scheme is known. Blocking system calls used to sleep an entire process. Until such calls became threadsafe, there was no proper mechanism for sleeping a single thread within a process (see polling).
 
The Asians created, naturally, inter-Asian missunderstandings.
And the Europeans, due to their, "mutual exclusion" related manifestation of undecidability, internalized the inter-Asian missunderstandings.
The pseudo dilemma, Unfreedom or War, according to my opinion, expresses the typical Asian avertion towards evolution.
Europe, naturally, between Unfreedom and War, chooses Freedom and Peace.
The potential claim that, Europe, in order to make the transition, from the current unfreedom to the required Freedom, she, supposedly, has to bare the horrible consequences of an war, can only be a product of an ordinary disassociation with reality.
The Asians' self-sufficiency could become accomplished, though under proper terms.
The Europe's, peaceful and prudent, transition towards, Peace, Freedom, Cooperation and frugal Prosperity, according to my opinion, shall be characterized by the typical, German, accuracy and efficiency.
By maintaining even strength; and by keeping a positive and active attitude; and by evolving in order to overcome our manifestations of undecidability; and by decyphering correctly the Asian mentality; and by, faithfully, following the Germans, I am confident that, Europe's imminent evolution is, centainly, going to be, positive and creative.
 
Christos Boumpoulis
economist