PCLSRing

From Wikipedia, the free encyclopedia

PCLSRing (often also colloquially known as PC Lusering) is the term used in the ITS operating system for a consistency principle in the way one process accesses the state of another process. One scenario causes particular complications:

  • Process A makes a time-consuming system call. By "time-consuming" is meant that the system needs to put Process A into a wait state and reschedule some other process for execution while waiting for the call to complete. A common example of such a call is an I/O operation.
  • While Process A is in this wait state, Process B tries to make some access into the state of Process A, for example send it a signal.

The question is, what should be the visible state of the context of Process A at the time of the access by Process B? In fact it is in the middle of a system call, but ITS enforces the appearance that system calls are not visible to other processes (or even to the same process).

If the system call cannot complete before the access, then it must be restartable. This means that the program counter is backed up to the point of entry to the system call, while the call arguments are updated to reflect whatever portion of the operation has already been completed. For an I/O operation, this means among other things that the buffer start address must be advanced over the data already transferred, while the length of data to be transferred must be decremented accordingly. Then, after the access by Process B, Process A can resume execution, and the system call automatically resumes from where it left off.

Contrast this with the approach taken in the UNIX operating system, where there is restartability, but it is not transparent. Instead, an I/O operation returns the number of bytes actually transferred (or the EINTR error if the operation was interrupted before any bytes were actually transferred), and it is up to the application to check this and manage its own resumption of the operation until all the bytes have been transferred. In the philosophy of UNIX, this is an example of the "worse is better" principle.

Of course, another entirely different approach is possible. It is implicit in the above discussion that the system call has to be synchronous--that is, the calling process has to be forced to wait for the operation to complete. But there is no essential reason for this: in the OpenVMS operating system, all I/O and other such time-consuming operations are inherently asynchronous, which means the semantics of the system call is "start the operation, and perform one or more of these notifications when it completes" after which it returns immediately to the caller. There is a standard set of available notifications (such as set an event flag, or deliver an asynchronous system trap), as well as a set of system calls for explicitly suspending the process while waiting for these, which are a) fully restartable in the ITS sense, and b) much smaller in number than the set of actual time-consuming system calls.

For convenience, OpenVMS provides alternative "start operation and wait for completion" synchronous versions of all time-consuming system calls. These are implemented essentially as "perform the actual asynchronous operation" followed by "wait until the operation sets the event flag". Any access to the process context during this time will simply see it about to (re)enter the wait-for-event-flag call.

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.