Scribd
Upload
72 views

Platform Script

Dijkstra's work in 1965 focused on operating system design using cooperating sequential processes and developing an efficient mechanism for process cooperation. Common operating system and programming language mechanisms for concurrency include semaphores, mutex locks, condition variables, monitors, event flags, message passing, and spinlocks. Semaphores use integers to signal processes while binary semaphores only take values of 0 or 1. Mutex locks must be unlocked by the same process that locked it. Condition variables block threads until a condition is met. Monitors encapsulate variables and procedures for synchronization. Event flags use bits to synchronize threads. Message passing and spinlocks also provide synchronization between processes and threads.

Uploaded by

andres tabaldo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
72 views

Platform Script

Dijkstra's work in 1965 focused on operating system design using cooperating sequential processes and developing an efficient mechanism for process cooperation. Common operating system and programming language mechanisms for concurrency include semaphores, mutex locks, condition variables, monitors, event flags, message passing, and spinlocks. Semaphores use integers to signal processes while binary semaphores only take values of 0 or 1. Mutex locks must be unlocked by the same process that locked it. Condition variables block threads until a condition is met. Monitors encapsulate variables and procedures for synchronization. Event flags use bits to synchronize threads. Message passing and spinlocks also provide synchronization between processes and threads.

Uploaded by

andres tabaldo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Script

Hello there welcome to Platform news, I’m (Nick vincent tabaldo).

International News

(Nick) The first major advancement in dealing with concurrency-related problems came in around
1965 with Dijkstra's written formal works.

Dijkstra's work focuses on operating system (OS) design as a collection of cooperating sequential
processes, with the development of an efficient and reliable mechanism for supporting cooperation.

The common OS and programming language mechanisms that are used to provide or support
concurrency

(Nick) Counting Semaphore – This involves an integer value that is used for signaling processes.
Only three (3) operations may be performed on a semaphore, all of which are atomic: initialize,
decrement, and increment. The decrement operation may result in the blocking of a process, and the
increment operation may result in the unblocking of a process. This concurrency mechanism is also
known as the general semaphore.

(Nick) Binary Semaphore – This is a semaphore that only takes the values zero (0) and one (1). It is
sometimes easier to implement binary semaphores than counting semaphores.
For other language mechanisms, we have our reporter (Denzel) to give more details

(Denzel) Thanks nick continuing: Mutual Exclusion (Mutex) Lock – This mechanism is similar to a
binary semaphore. The key difference between the two is that the process that locks the mutex must
be the one to unlock it, and only the holder of the lock can operate.

(Denzel) Condition Variable – This is a data type that is used to block a process or a thread until a
specific condition is true. It i1s a special kind of variable that is used to determine if a certain
condition has been met or not. It is used to communicate between threads when certain conditions
become true. A conditional variable is like a queue.

(Nick) Thank you Denzel. It is time for a short break. Stay with us! (Break??)

(Nick) Welcome back! we have more news to report (This is platform news?? hahahaha)
We have our reporter shane to give us more information kindly update our viewers about the OS and
programming language mechanisms

(Shane) Sure nick: Monitor – This is a programming construct that encapsulates variables, access
procedures, and initialization code within an abstract data type. It is easier to control and has been
implemented in a number of programming languages such as Java and Pascal-Plus. The monitor's
variable may only be accessed via its access procedures, and that only one (1) process can actively
access the monitor at any given time.

(Shane) Event Flag – An Event Flag is a single bit, like a Binary Semaphore. It is a memory word used as
a synchronization mechanism. A specific application code is associated with each bit in a flag. A thread
can wait for either a single event or a combination of events by checking one (1) or multiple bits in the
corresponding flag.

For more details nick we have another reporter from our studio?? (hahaha langya dito ko na alam)
John albert
(John albert) Thank you ms shane Mailbox or Message Passing – This mechanism is considered as a
means for two (2) processes to exchange information, and that may be used for process
synchronization.

Spinlock – This is a mechanism in which a process executes in an infinite loop waiting for the value of
a lock variable to indicate availability.  It allows a thread to acquire it to simply wait in loop until the
lock is available i.e. a thread waits in a loop or spin until the lock is available. Spinlock is held for a
short period of time.

Back to you nick

“Thank you, Albert. I am your host, Nick Vincent Andreu Tabaldo , and this is Platform News, thank
you for watching.”

You might also like