Abstract: A computer readable storage medium storing a set of instructions executable by a processor. The set of instructions is operable to receive, from a first processor, a message to be sent to a second processor; store the message in a portion of a shared memory, the shared memory being shared by the first processor and the second processor; store, in an instruction list stored in a further portion of the shared memory, an instruction corresponding to the message; and prompt the second processor to read the message list.

Abstract: The exemplary embodiments describe systems and methods for utilizing a semaphore with timeout and lock-free path for message passing architectures. One embodiment is related to a method comprising receiving a request from a client to access an object, the object including a plurality of resources, placing the request in a lock-free pend queue of a semaphore, manipulating a count of the semaphore based on an availability of at least one of the plurality of resources, and determining whether the client can use a fast path to the object.

Abstract: A system and method for receiving time series data, representing the time series data as vector data, generating a plurality of indices using the vector data, wherein each of the indices has a different resolution and independently searching each of the indices for a given event. The vector data may be Symbolic Aggregate approXimation (SAX) data and the indices are SAX indices.

Abstract: A method for an acquisition of a semaphore for a thread includes decrementing a semaphore count, storing a current thread context of the semaphore when the semaphore count is less than a first predetermined value, determining a release count of a pending queue associated with the semaphore where the pending queue indicates unpended threads of the semaphore, and adding the thread to the pending queue when the release count is less than a second predetermined value.

Abstract: A system and method for creating a set of objects correlated with a query. For each element of the set, calculating one of a relevance or a correlation between the element and other elements of the set, constructing an archetype comprising a list of elements of the set for which the relevance or the correlation satisfies a threshold and associating the list of elements with a probability and sorting the list of elements by the probability, wherein the elements having a greater probability are first.

Abstract: Described is a system and method for storing a plurality of data points in a form Subject->Object and Object->Subject, where subject and object are differently typed entities, wherein the data points are stored in a plurality of segments, performing an expression search in each segment to identify an expression set of objects or subjects which can be viewed as the right hand side of the expression, determining, for each segment, actions corresponding to each of the data points in the expression set, determining a count of each of the actions and applying a metric to each of the expression set, the actions and the count to obtain a result.

Abstract: The exemplary embodiments describe systems and methods for utilizing a semaphore with timeout and lock-free path for message passing architectures. One embodiment is related to a method comprising receiving a request from a client to access an object, the object including a plurality of resources, placing the request in a lock-free pend queue of a semaphore, manipulating a count of the semaphore based on an availability of at least one of the plurality of resources, and determining whether the client can use a fast path to the object.

Abstract: The exemplary embodiments described herein relate to systems and methods for improved process switching of a paravirtualized guest with a software-based memory management unit (“MMU”). One embodiment relates to a non-transitory computer readable storage medium including a set of instructions executable by a processor, the set of instructions, when executed, resulting in a performance of the following: create a plurality of new processes for each of a plurality of virtual environments, each of the virtual environments assigned one of a plurality of address space identifiers (“ASIDs”) stored in a cache memory, perform a process switch to one of the virtual environments thereby designating the one of the virtual environments as the active virtual environment, determine whether the active virtual environment has exhausted each of the ASIDs, and flush a cache memory when it is determined that the active virtual environment has exhausted each of the ASIDs.

Abstract: A system and method for receiving a request from a requester for access to a computing resource, instructing the requester to wait for access to the resource when the resource is unavailable and allowing the requester to perform other tasks while waiting, determining whether the requester is available when the resource subsequently becomes available, and granting access to the resource by the requester if the requester is available.

Abstract: A method including requesting access to a resource governed by a spinlock; determining an allocation of the resource to a further requester; determining an expiration of a time limit for the spinlock, if the resource is allocated to the further requester; and initiating a fault recovery, if the time limit is expired.

Abstract: Systems and methods of automating jury attendance verification and service payment are provided. A juror may report to for jury duty at the date/time identified on his/her jury summons and may be asked to provide the jury summons to check in for jury duty. The juror may present his/her summons to a juror-interaction machine that may read a personal identifier included on the summons. The machine may validate the personal identifier and confirm that the juror has checked in for jury service. At the conclusion of jury service, the machine may read the juror's summons containing a personal identifier and confirm that the juror has completed jury service. The machine may then dispense a cash payment to the juror. The machine also may capture a video clip or still image of the juror using the machine for verification and/or security.

Abstract: A method for an acquisition of a semaphore for a thread includes decrementing a semaphore count, storing a current thread context of the semaphore when the semaphore count is less than a first predetermined value, determining a release count of a pending queue associated with the semaphore where the pending queue indicates unpended threads of the semaphore, and adding the thread to the pending queue when the release count is less than a second predetermined value.

Abstract: A method including requesting access to a resource governed by a spinlock; determining an allocation of the resource to a further requester; determining an expiration of a time limit for the spinlock, if the resource is allocated to the further requester; and initiating a fault recovery, if the time limit is expired.

Abstract: A computer readable storage medium storing a set of instructions executable by a processor. The set of instructions is operable to receive, from a first processor, a message to be sent to a second processor; store the message in a portion of a shared memory, the shared memory being shared by the first processor and the second processor; store, in an instruction list stored in a further portion of the shared memory, an instruction corresponding to the message; and prompt the second processor to read the message list.

Abstract: A system and method for receiving a request from a requester for access to a computing resource, instructing the requester to wait for access to the resource when the resource is unavailable and allowing the requester to perform other tasks while waiting, determining whether the requester is available when the resource subsequently becomes available, and granting access to the resource by the requester if the requester is available.

Abstract: Randomly spaced articles in serial order are separated into predetermined linear configurations or rows of a predetermined number of articles and thereafter simultaneously transferred into compartments in rows in a container. In reverse operation, articles from the compartments in the container are transferred into single file order. The apparatus used in these operations includes a conveyor upon which the predetermined linear configuration of articles is established, and a conveyor which moves the container and its rows of compartments into alignment to receive the articles, and an elevator assembly for transferring the articles in the predetermined configuration between the first conveyor and the rows of the container. Separably operable conveyor segments and separator plates establish the predetermined linear configuration on the conveyor, and the conveyor moves to avoid interference with the movement path of the articles transferred by the elevator assembly.