The following operators can be used to better focus your queries.
( ) , AND, OR, NOT, W/#
? single char wildcard, not at start
* multi char wildcard, not at start
(Cat? OR feline) AND NOT dog?
Cat? W/5 behavior
(Cat? OR feline) AND traits
Cat AND charact*
This guide provides a more detailed description of the syntax that is supported along with examples.
This search box also supports the look-up of an IP.com Digital Signature (also referred to as Fingerprint); enter the 72-, 48-, or 32-character code to retrieve details of the associated file or submission.
Concept Search - What can I type?
For a concept search, you can enter phrases, sentences, or full paragraphs in English. For example, copy and paste the abstract of a patent application or paragraphs from an article.
Concept search eliminates the need for complex Boolean syntax to inform retrieval. Our Semantic Gist engine uses advanced cognitive semantic analysis to extract the meaning of data. This reduces the chances of missing valuable information, that may result from traditional keyword searching.
The following provides a fast performance path in the movement (and removal) of an item onto a fixed-length move mode queue as well as concurrent ENQ/DEQ without serialization.
English (United States)
This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
100% of the total text.
Page 1 of 2
Fast Fixed-Length Move Mode Queue Item Placement
The following provides a fast performance path in the movement (and
removal) of an item onto a fixed-length move mode queue as well as concurrent
ENQ/DEQ without serialization.
Before proceeding, some definitions and assumptions will first
be given. A "fixed-length move mode queue," as presented here refers
to a pushdown stack with FIFO (first-in, first-out) queueing
discipline. "Move mode" refers to the fact that the item passed on
ENQ is not chained directly onto the queue but rather moved onto the
stack and the stack element chained.
The format of the queue and stack is set forth in Fig. 1.
CTR=0; SPILL 0,
TAIL points to first entry on STACK.
HEAD points to first entry on STACK.
Then the algorithm, as set forth in the flow charts of Fig. 2
and 3, for placing elements onto and off of queue is as follows:
Note: ENQ's and DEQ's are concurrent and not serialized.
The actual movement of items on and off queue stack occurs in one INSTR
(EX) without having to perform a BCTR (Branch on Count Register Instruction)
tie up a register, etc. This is done by embedding the MVC in the queue anchor.
The LL of the MVC is queue dependent.
SPILL points (when not 0) to a duplicate queue anchor, and
stack spill is used when the current stack is full.
ENQ-LOCK (identical to) high order bit of TAIL.
DEQ-LOCK (identical to) high order bit of HEAD.
Page 2 of 2
[This page contains 3 pictures or other non-text objects]