scispace - formally typeset
Patent

Single-keyed indexed file for TP queue repository

Reads0
Chats0
TLDR
A task queue is structured as a single-keyed indexed file in which the key has a most significant portion indicating a priority level and a less significant portion that is ordered with the loading of the tasks into the queue.
Abstract
A task queue is structured as a single-keyed indexed file in which the key has a most significant portion indicating a priority level and a less significant portion that is ordered with the loading of the tasks into the queue. For any given task record in the queue, the less significant portion of the key is determinable from a respective task identifier. Preferably the less significant portion of the key is a "time stamp" including the current date when the task was created and a representation of the data processor's internal 24 hour time clock, and a task identification number is formed by appending a node number to the time stamp in the event that the system has multiple processors capable of creating different tasks at the same time. This format of the single key causes an internal ordering of the records in the queue that is sequential with respect to the less significant portion of the key within blocks of records having the same priority. Therefore, due to the relationship between the key and the task identification number for each task record in the queue, it is possible to quickly search for the record having a requested task identification number. Conventional memory management facilities for accessing key-indexed files can be used for searching the queue. In this case the queue is searched by random or "key next" access to repeatedly step through the possible priority levels until a record having a matching key is found or the end of file is reached. When a record having a matching key is found, the requested task identification number is compared to the identification field of the record. If there is a match, the desired record has been found. If not, then searching continues by sequential access until there is a match of the identification numbers or until the keys no longer match.

read more

Citations
More filters
Patent

Three-dimensional memory card structure with internal direct chip attachment

TL;DR: In this article, a memory card structure is disclosed containing an embedded three dimensional array of semiconductor memory chips, which are placed in the chip wells and are covered by insulating and wiring levels.
Patent

System and method for rapid completion of data processing tasks distributed on a network

TL;DR: In this article, a method for running tasks on a network, comprising of creating (200) at least one sub-group of data from a universe of data, identifying (202) the sub-groups of data with a header, the header containing executable code, sending (204) the subsets of data to an available processor, and performing (206) tasks with the available processor to obtain result data using the subgroups of the data and instructions contained in the executable code in the header.
Patent

Systems and methods for synchronizing databases in a receive-only network

TL;DR: In this article, a distributed system for synchronizing a plurality of databases in a distributed manner is presented, in which each change made to a master database in a central computer is broadcast to a multiplicity of remote computers, each containing a replica of the master database, via a packet having an assigned next-broadcast-number and a sequential next-sequence-number.
Patent

Search mechanism for a queue system

TL;DR: In this paper, a key cache data structure has been proposed to improve the performance of a queue system including a queue for storing a plurality of data items and a search mechanism by maintaining an array of entries, each of which has a key field and a pointer field.
Patent

Method and apparatus for data storage and retrieval

Dixon Robert
TL;DR: In this article, a method and system of data storage and retrieval comprising the formation of records having a key field which is a numeric concatenation of at least two identifiers is presented.
References
More filters
Patent

Sequencing of multiple tasks in a data processor

TL;DR: In this paper, the next task to be executed among a prioritized set of pending tasks is specified by storing queues QA-QH each containing information identifying pending tasks of a particular priority level, 7, 6 1, 0, maintaining queue occupancy data in terms of the first and last task control block (TCB) address for each queue.