Blocking (computing)

Blocking (computing)

Blocking occurs when a function does not return until it either completes its task or results in an error.

A process that is blocked is one that waits for the completion of some event,such as an I/O operation [harv|Stallings|2004]

In a two state model (running and not-running), processes would go ontothe (running) queue before being dispatched for execution. Without ablocked state, if priority is measured by length of time on the queue,blocked processes would be selected even though they have nothing to execute.This is undesirable since one may wish to maximize processorutilization. Hence the desire for a blocked queue(s)/state where blockedprocesses can be put until the event occurs.

After receiving the event, it moves from the blocked state into adifferent state, such as ready.

References

* cite book| title = Operating Systems: Internals and Design Principles | first = William | last = Stallings | year = 2004 | publisher = Prentice Hall | edition = 5th


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • Blocking — may refer to:In telecommunications: *Block size (data storage and transmission), the formatting of data into blocks for purposes of transmission, storage, checking, or other functions *Block storage, a sequence of bytes or bits, having a nominal… …   Wikipedia

  • Blocking (scheduling) — In a multitasking computer system, individual tasks, or threads of execution, must share the resources of the system. These resources might be:* the CPU * network * memory * diskor any other shared resource.When one task is using a resource, it… …   Wikipedia

  • Category:Computing terminology — From Technical terminology: Technical terminology is the specialized vocabulary of a field. These terms have specific definitions within the field, which is not necessarily the same as their meaning in common use. Jargon is similar, but more… …   Wikipedia

  • Non-blocking synchronization — In computer science, non blocking synchronization ensures that threads competing for a shared resource do not have their execution indefinitely postponed by mutual exclusion. Literature up to the turn of the century used non blocking synonymously …   Wikipedia

  • Non-blocking algorithm — In computer science, a non blocking algorithm ensures that threads competing for a shared resource do not have their execution indefinitely postponed by mutual exclusion. A non blocking algorithm is lock free if there is guaranteed system wide… …   Wikipedia

  • Distributed computing — is a field of computer science that studies distributed systems. A distributed system consists of multiple autonomous computers that communicate through a computer network. The computers interact with each other in order to achieve a common goal …   Wikipedia

  • Grid computing — is a term referring to the combination of computer resources from multiple administrative domains to reach a common goal. The grid can be thought of as a distributed system with non interactive workloads that involve a large number of files. What …   Wikipedia

  • Parallel computing — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing …   Wikipedia

  • Concurrent computing — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent c …   Wikipedia

  • Process (computing) — In computing, a process is an instance of a computer program that is being executed. It contains the program code and its current activity. Depending on the operating system (OS), a process may be made up of multiple threads of execution that… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”