Mutual exclusion - CompWisdom
About us  |  Why use us?  |  Press  |  Contact us

 

Topic: Mutual exclusion



  
 Mutual exclusion - Wikipedia, the free encyclopedia
Mutual exclusion (often abbreviated to mutex) algorithms are used in concurrent programming to avoid the concurrent use of un-shareable resources by pieces of computer code called critical sections.
On a uniprocessor system the common way to achieve mutual exclusion is to disable interrupts for the smallest possible number of instructions that will prevent corruption of the shared data structure, the so-called "critical region".
Most classical mutual exclusion methods attempt to reduce latency and busy-waits by using queuing and context switches.
http://en.wikipedia.org/wiki/Mutual_exclusion   (466 words)

  
 Detalle Notas Prensa
For further information about these and other computer threats, visit Panda Software's Encyclopedia.
- Mutex (Mutual Exclusion Object): a technique used to control access to resources (examples: programs or even other viruses) and prevent more than one process from simultaneously accessing the same resource.
http://www.pandasoftware.com/about/press/viewNews.aspx?noticia=6444   (464 words)

  
 Mutual exclusion - Computing Reference - eLook.org
One of the most commonly used techniques for mutual exclusion is the semaphore.
http://www.elook.org/computing/mutual-exclusion.htm   (38 words)

  
 Articles - Monitor
A small interactive bootstrap program or machine code debugger
A programming technique for managing access of parallel processes to shared resources while ensuring mutual exclusion: Monitor (synchronization)
A Hall monitor, one who patrols the hall of a school.
http://www.wholez.com/articles/Monitor   (402 words)

Compwisdom
 About us   |  Why use us?   |  Press   |  Contact us

 Copyright © 2006 CompWisdom.com Usage implies agreement with terms.