SYSTEM, METHOD, AND COMPUTER PROGRAM FOR SENDING A RESPONSE TO A CLIENT BASED ON A REPLICATION MESSAGE RECEIVED FROM A MASTER SERVER
Publication Date: 2008-Jun-11
The IP.com Prior Art Database
A system, method, and computer program are provided for sending a response to a client based on a replication message received from a master server. In use, a replication message is received at a replication server from a master server. Further, a response is sent from the replication server to a client based on the replication message received from the master server.
Field of the Invention
 The present invention relates to a queue, and more particularly to inserting and removing data from the queue.
 Traditionally, data processing systems have utilized queues. The queues have been utilized by the data processing systems to store data that is waiting to be processed. However, techniques generally utilized for processing data stored in such queues have exhibited various limitations.
 One technique conventionally utilized for processing data in the queue has been to utilize a lock on the queue. As an example, a locking queue utilizes a lock to indicate that data is being read and written to the queue. As a result of the locking queue, a speed of processing is reduced by preventing other processing from being performed while the queue is locked.
 Another technique conventionally utilized for processing data in the queue has been to utilize a lock free queue. For example, the lock free queue allows for data to be read and written to the queue without utilizing a lock. However, traditionally lock free queues have only allowed for a single dimension queue.
 There is thus a need for addressing these and/or other issues associated with the prior art.
 A data structure, method, and computer program provide a linked list in a first dimension and a plurality of linked lists in a second dimension. In use, a linked list in a first dimension is provided. Further, the linked list in the first dimension includes a plurality of nodes. Additionally, each node includes a head pointer and a tail pointer. In addition, a plurality of linked lists in a second dimension is provided. Furthermore, the tail pointer of one of the nodes in the linked list in the first dimension points to a first node in one of the linked lists in the second dimension.
BRIEF DESCRIPTION OF THE DRAWINGS
 Figure 1 illustrates a network architecture, in accordance with one possible embodiment.
 Figure 2 illustrates an exemplary system, in accordance with one embodiment.
 Figure 3 illustrates a data structure including a linked list in a first dimension a plurality of linked lists in a second dimension, in accordance with another embodiment.
 Figure 4 illustrates a method for inserting an event into a data structure, in accordance with yet another embodiment.
 Figure 5 illustrates a method for inserting an event into a data structure, in accordance with still yet another embodiment.
 Figure 6 illustrates a method for removing a node from a data structure, in accordance with one embodiment.