US7130936B1 - System, methods, and computer program product for shared memory queue - Google Patents
System, methods, and computer program product for shared memory queue Download PDFInfo
- Publication number
- US7130936B1 US7130936B1 US10/425,286 US42528603A US7130936B1 US 7130936 B1 US7130936 B1 US 7130936B1 US 42528603 A US42528603 A US 42528603A US 7130936 B1 US7130936 B1 US 7130936B1
- Authority
- US
- United States
- Prior art keywords
- buffer
- enqueuing
- tail
- status
- pointer
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Lifetime, expires
Links
- 238000000034 method Methods 0.000 title claims abstract description 133
- 238000004590 computer program Methods 0.000 title claims abstract description 63
- 238000004891 communication Methods 0.000 claims abstract description 152
- 230000008569 process Effects 0.000 claims abstract description 77
- 230000006870 function Effects 0.000 claims description 28
- 238000012545 processing Methods 0.000 claims description 25
- 230000008878 coupling Effects 0.000 claims description 3
- 238000010168 coupling process Methods 0.000 claims description 3
- 238000005859 coupling reaction Methods 0.000 claims description 3
- 230000004048 modification Effects 0.000 description 5
- 238000012986 modification Methods 0.000 description 5
- 230000008901 benefit Effects 0.000 description 3
- 230000003139 buffering effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000002708 enhancing effect Effects 0.000 description 1
- 238000013519 translation Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/546—Message passing systems or structures, e.g. queues
Definitions
- the present invention relates to the field of operating systems and more particularly to a structure, method, algorithm, and program shared memory queue.
- Today many computer programs are intended to be processed in multi-processor and/or multi-threaded environments.
- processing is typically associated with executing a process (such as a computer program or set of computer instructions) and is generally considered to be an operating system concept that may include the computer program being executed and additional information such as specific operating system information.
- executing a computer program creates a new process to identify, support, and control execution of the computer program.
- Many operating systems such as UNIX, are capable of running many processes at the same time using either a single processor and/or multiple processors. Multiple processors can perform tasks in parallel with one another, that is, a processor can execute multiple computer programs interactively, and/or execute multiple copies of the same computer program interactively.
- the advantages of such an environment includes a more efficient and faster execution of computer programs and the ability of a single computer to perform multiple tasks concurrently or in parallel.
- a multiprocessor system such as for example a network processor system, may include a number of system-on-chip components, that may be optimized for specific processing, such as for example optimized for processing packet input-output and packet modification.
- a packet may include data, a packet destination address, and a packet sender address.
- Support for processing a high volume of packets may be provided by a multiprocessor system that requires improvements in common operating system functions.
- a multiprocessor system is particularly susceptible to inefficient processing techniques that may otherwise be effective with a single processor system.
- Communication between computer programs typically includes the use of the buffer.
- a first computer program may request mutually exclusive access to the buffer and enqueue a communication.
- a second computer program may request mutually exclusive access to the buffer and dequeue the communication.
- mutual exclusive access to the buffer and/or any buffer attributes are minimized to enhance the overall performance of the buffer.
- conventional buffering systems provide mutual exclusive access to the buffer and any associated buffer attributes.
- one aspect of the present invention is directed to a method for a shared memory queue to support communicating between computer processes, such as an enqueuing process and a dequeuing process.
- a buffer may be allocated including at least one element having a data field and a reserve field, a head pointer and a tail pointer.
- the enqueuing process may enqueue a communication into the buffer using mutual exclusive access to the element identified by the head pointer.
- the dequeuing process may dequeue a communication from the buffer using mutual exclusive access to the element identified by the tail pointer. Mutual exclusive access to said head pointer and tail pointer is not required.
- a system and computer program for a shared memory queue are also disclosed.
- FIG. 1 generally illustrates a router receiving and forwarding a packet, according to the prior art.
- FIG. 2 generally illustrates a router including a CPU and memory for receiving and forwarding a packet, according to the prior art.
- FIG. 3 generally illustrates a router including a CPU and memory for receiving and forwarding a packet with communication between processes, according to an embodiment of the present invention.
- FIG. 4 generally illustrates communication and processing, according to an embodiment of the present invention.
- FIG. 5 generally illustrates a method for processing a communication, according to an embodiment of the present invention.
- FIG. 6 illustrates an embodiment of a method implemented on a computer readable media, according to an embodiment of the present invention.
- FIG. 7 illustrates an embodiment of a method executed by a computer system, according to an embodiment of the present invention.
- NP network processor
- Teja are references to particular embodiments, computer programming code segments, or other references to subject matter developed by Teja Technologies of San Jose, Calif.
- the present invention provides innovative operating system techniques for network processing designed and implemented for network processors.
- network processors are multiprocessor system-on-chip components optimized for packet input-output and modification.
- Network processors typically include a tightly coupled multiprocessor architecture.
- the present invention is capable of enhancing packet throughput and minimizing latency through the use of novel computer program software techniques for common operating system functions, and associated architectures and operating system methodologies according to an embodiment of the present invention.
- FIG. 1 illustrating a conventional router 1301 coupled between multiple computer systems 1300 - x (for example, computer systems 1300 - 1 , 1300 - 2 , 1300 - 3 , . . . , 1300 -N).
- Communication between multiple computers systems 1300 - x may use the router 1301 to route a packet of information 1341 , or more simply a packet 1341 , between computer systems.
- computer system 1300 - 1 may send a packet 1341 to the computer system 1300 - 3 through the router 1301 .
- the router 1301 typically receives the packet 1341 , analyzes the packet to determine where to forward the packet, and then, as illustrated, forwards the packet to the destination computer system 1300 - 3 .
- the conventional router 1301 may include a CPU 1310 coupled with memory 1320 .
- the memory 1320 may be coupled with one or more process 1350 - x (for example, process 1350 - 1 , 1350 - 2 , . . . , 1350 -N).
- Each of the process may communicate with another process, such as for example process 1350 - 1 may communicate with process 1350 -N.
- a process may include instructions for performing a particular activity or function, such as for example a function for receiving packet 1341 , determining the destination address of the received packet 1341 , and forwarding the packet 1341 to the determined destination address.
- the CPU 1310 may execute instructions associated with each process 1350 - x .
- communication between processes is typically supported using a communication link 323 , such as for example communication between process 1350 - 1 and 1350 -N.
- Other of the processes 1350 - x may be similarly coupled with the communication link 323 .
- Communication may be provided through the use of queues that require mutual exclusive access to the entire queue. Unfortunately, communications are typically restricted by unnecessary processing associated with mutual exclusive access to the entire queue, such as for example a buffer and a set of pointers coupled with the buffer.
- FIG. 3 illustrates an innovative router, generally designated 1302 .
- the innovative router 1302 may include one or more computer programs 1200 coupled with one or more processes 1350 - x .
- a computer program 1200 may be used to receive the packet 1341 , communicate with other processes in support of processing the packet 1341 , and/or to send a corresponding packet 1341 to the computer system 1300 - 3 .
- a sender may be or include either a computer program 1200 or a process 1350 - x
- a receiver may be or include either a computer program 1200 or a process 1350 - x
- a computer program may initiate a send communication function 801 to be received by the receive communication function 802 .
- the queue 803 may enqueue the communication from the send communication function 801 and make communication available for dequeuing by the receive communication function 802 .
- the queue 803 is stored in a common memory and the memory communication link 804 supports access to the queue 803 by both the send communication function 801 and the receive communication function 802 .
- communication between processes and/or computer program can be enhanced by using a common memory 1320 for the queue 803 .
- FIG. 4 generally illustrates communication between two processes, including a first process 1350 - 1 , a second process 1350 - 2 using the queue 803 , according to an embodiment of the present invention.
- the send communication function 801 sends a communication to the receive communication function 802 using the queue 803 .
- the send communication function 801 may send communication 805 for coupling with the queue 803 .
- the receive communication function 802 can receive the communication coupled with the queue 803 .
- the queue 803 is coupled with a memory 1320 that is accessible by both the first process 1350 - 1 and the second process 1350 - 2 .
- the queue 803 includes a buffer 812 , a tail pointer 810 , and a head pointer 811 .
- Mutual exclusive access 830 is provided for the buffer 812 .
- the buffer 812 includes at least one element 813 - x (such as for example, element 813 - 1 , 813 - 2 , . . . , 813 -N).
- the element 813 - x includes a data field 820 and a reserve field 821 .
- the tail pointer 810 is coupled with a element 813 - x , such as 813 - 1 , to identify where the next communication may be enqueued.
- the head pointer 811 is coupled with a element 813 - x , such as 813 -N, to identify where the next communication may be dequeued from.
- the present invention does not require mutual exclusive access for either the tail pointer 810 or the head pointer 811 .
- the data field 820 is used to store the communication 805 .
- the data field 820 may be used to identify a communication 805 , such as for example storing a pointer that is coupled with the communication 805 .
- the reserve field 821 may be selected from a group of statuses consisting of an available status and a reserved status. Other embodiments may provide for different structures.
- An available status indicates the corresponding element 813 - x is not coupled with a communication 805 . If the tail pointer 810 is coupled with an element 813 - x with an available status then a communication 805 may be enqueued with the element 813 - x and the reserve field may be updated to the reserved status.
- the reserved status indicates the corresponding element 813 - x is coupled with a communication 805 .
- the head pointer 810 is coupled with an element 813 - x with a reserved status then a communication may be dequeued from to the element 813 - x and the reserve field may be updated to the available status. If the head pointer 810 is coupled with an element 813 - x with an available status then the queue may be empty.
- mutual exclusive access to the reserve field and data field of an element 813 - x can ensure the integrity of a communication.
- the shared memory queue does not require mutual exclusive access to either the head pointer 811 or the tail pointer 810 .
- an enqueuing status 822 may be coupled with each element 813 - x to indicate the successful completion of enqueuing a communication coupled with an element 813 - x .
- a dequeuing status 823 may be coupled with each element 813 - x to indicate the successful completion of dequeuing a communication coupled with an element 813 - x .
- the enqueuing status 822 and the dequeuing status 823 may also be combined into one status.
- FIG. 5 generally illustrates an embodiment of a method for communication 840 using a shared memory queue including initializing a queue 841 , enqueuing the communication at 850 , and dequeuing a communication at 865 , according to one embodiment of the present invention.
- Initialization of the queue at 841 may be performed by a process 1350 - x and/or a computer program 1200 - x .
- Allocating the buffer 812 at 842 includes allocating at least one element 813 - x .
- Each element 813 - x typically includes a data field 820 and a reserve field 821 .
- the head pointer 811 may be initialized at 843 to an element 813 - x allocated at 842 .
- the tail pointer 810 may be initialized at 847 to an element 813 - x allocated at 842 . Both the tail pointer 810 and the head pointer 811 may be initialized to point to the same element 813 - x .
- the reserve field 821 coupled with each element 813 - x may be initialized at 848 to indicate the element is available.
- the enqueuing status 822 may be initialized at 849 to indicate that a communication is not currently being enqueued with the corresponding element 813 - x .
- the dequeuing status 823 may be initialized at 849 to indicate that a communication is not currently being dequeued from the corresponding element 813 - x.
- a method of enqueuing a communication at 850 may be performed by the send communication function 801 and typically includes accessing the tail pointer 810 at 851 , requesting an element 813 - x access at 852 , and enqueuing the communication 805 at 855 if the access request at 852 was granted, and not enqueuing the communication 805 at 859 if the access request at 852 was denied.
- mutual exclusive access to the tail pointer 810 is not provided. Consequently multiple computer programs 1200 - x and/or multiple processes 1350 - x may have simultaneous access to the tail pointer 810 .
- the present invention does not require mutual exclusive access to the tail pointer 810 .
- enqueuing a communication 805 at 850 includes accessing the tail pointer at 851 , requesting element access at 852 , and enqueuing at 855 .
- the request element access at 852 checks the reserve field 821 at 853 to determine if the corresponding element is available. If the element 813 - x is available then access is granted and the communication 805 may be enqueued at 855 .
- Enqueuing a communication 805 at 855 may include updating the reserve field 821 at 856 to indicate the element 813 - x is available for dequeuing.
- the communication 805 may be coupled with the element 813 - x at 857 .
- Mutually exclusive access 830 may be provided for the updating the reserve field and/or enqueuing the communication at 857 .
- updating the reserve field at 856 and enqueuing the communication at 857 may be performed using mutual exclusive access to the element 813 - x .
- updating the element 813 - x is performed using mutual exclusive access to the element.
- test-and-set capability is used to perform the request element access at 852 , update the reserve field at 856 , and add the communication to the queue at 857 .
- a test-and-set capability is a known implementation for supporting mutual exclusive access and not described in further detail here.
- the tail pointer 810 may be incremented at 858 to point to the next element in the group of elements 813 - x . According to one embodiment of the present invention, the tail pointer 810 may be incremented at 858 before updating the reserve field at 856 and/or adding the communication 805 to the queue at 857 .
- the enqueuing status 822 may be set at 854 to indicate the communication 805 is currently be coupled with the element 813 - x at 857 .
- the update enqueuing status at 854 may be performed again to indicate coupling the communication 805 with the element 813 - x at 857 was completed.
- the communication 805 may be coupled with the buffer 812 without having a limitation on the size of the communication 805 .
- request access at 852 was denied then the communication 805 can not be enqueued in the buffer 812 .
- Several possible reasons for denial of the requested access at 852 may include the buffer 812 is full and/or the element 813 - x coupled with the tail pointer 810 is currently used by another send communication function 801 .
- a method of dequeuing a communication at 865 may be performed by the receive communication function 802 and typically includes accessing the head pointer 811 at 866 , requesting an element 813 - x access at 867 , and dequeuing the communication 805 at 870 if the access request at 867 was granted, and not dequeuing the communication 805 at 879 if the access request at 867 was denied.
- mutual exclusive access to the head pointer 811 is not provided. Consequently multiple programs 1200 - x and/or multiple processes 1350 - x may have simultaneous access to the head pointer 811 .
- the present invention does not require mutual exclusive access to the head pointer 811 .
- dequeuing a communication 805 at 870 includes accessing the head pointer at 866 , requesting element access at 867 , and dequeuing at 870 .
- the request element access at 867 checks the reserve field 821 at 868 to determine if the corresponding element is reserved. If the element 813 - x is reserved then access is granted and the communication 805 may be dequeued at 870 .
- Dequeuing a communication 805 at 870 may include updating the reserve field 821 at 873 to indicate the element 813 - x is currently available for enqueuing another communication.
- the communication 805 may be decoupled from the element 813 - x at 875 .
- Mutually exclusive access 830 may be provided for the updating the reserve field and/or dequeuing the communication at 875 .
- updating the reserve field at 873 and dequeuing the communication at 875 may be performed using mutual exclusive access to the element 813 - x .
- dequeuing the element 813 - x is performed using mutual exclusive access to the element.
- a so-called test-and-set capability is used to perform the request element access at 867 , update the reserve field at 873 , and dequeue the communication from the queue at 875 .
- the head pointer 811 may be incremented at 877 to point to the next element in the group of elements 813 - x . According to one embodiment of the present invention, the head pointer 810 may be incremented at 877 before updating the reserve field at 873 and/or dequeuing the communication 805 from the queue at 875 .
- the dequeuing status 823 may be set at 874 to indicate the communication 805 is currently being decoupled from the element 813 - x at 875 .
- the update dequeuing status at 874 may be performed again to indicate decoupling the communication 805 from the element 813 - x at 875 was completed.
- the communication 805 may be decoupled from the buffer 812 without having a limitation on the size of the communication 805 .
- the communication 805 can not be dequeued from the buffer 812 .
- Several possible reasons for denial of the requested access at 867 may include the buffer is empty and/or the element 813 - x coupled with the head pointer 811 is currently used by another receive communication function 802 .
- the buffer 812 may be defined by an ordered set of elements 813 - x .
- the tail pointer 810 and head pointer 811 may point to the same element 813 - x , such as for example element 813 - 1 .
- the reserve field may be initialized to an available status at 848 for each of the elements 813 - x .
- An initial attempt to dequeue the communication at 865 may result in access denied because the reserve field was initialized to an available state and thereby indicates that no communication 805 has been previously queued.
- An initial attempt to enqueue a communication 850 would result in access granted because the reserve field indicates an available status.
- the ordered set of elements 813 - x is a circular set and/or list of elements 813 - x.
- the queue is a first-in and first-out queue (FIFO).
- FIFO queue provides that the first communication enqueued in the queue is the first communication dequeued from the queue.
- the buffer 812 may be implemented as a set of elements, with a tail pointer and a head pointer.
- a communication 805 may be enqueued to a tail and dequeued from the head.
- a circular buffer may be used to represent set of elements.
- each element 813 - x coupled with the buffer 812 may be defined as N-bits.
- N-bit element such as for example, a 32-bit element, a 64-bit element, or 128-bit element
- one bit may be reserved to identified the reserve field 821 .
- the remaining bits may define the data field and/or to couple a communication 805 with the element 813 - x .
- each element 813 - x is of a uniform size, such as for example, a 32-bit element.
- the head pointer 811 and the tail pointer 800 may be stored in a computer register coupled with a CPU and/or in a computer memory 1320 .
- the use of a computer register may be advantageous in a so-called multithreaded processors environment, such as for example a UNIX operating system and/or a real time embedded system.
- the head pointer 811 and the tail pointer 800 may be stored in a computer memory 1320 that is accessible to multiple processors may be advantageous in a so-called parallel processing computer system.
- the term element is synonymous with the term node.
- the queue consists of a head pointer, a tail pointer, and an array of elements.
- An element consists of a data field and a reservation field.
- the head and tail pointer are both initialized to a first element within the array of elements.
- a dequeue is performed by locking an element identified by the head pointer, and reading the element pointed to by the head pointer. If the dequeue finds the reserve field is set to unavailable, the data field is returned, the reserved field is set to available, and the head pointer is set to point to the next element and then the element is unlocked. If the dequeue finds the reserved field is set to available, the element is unlocked.
- An enqueue is done by locking an element identified by the tail pointer, and reading the element pointed to by the tail pointer. If the enqueue finds the reserved field is set to unavailable, the data field is written, the reserved field is set to unavailable, and the tail pointer is set to the next element and then the element is unlocked. If the enqueue finds the reserved field is set to available, the element is unlocked.
- FIG. 6 illustrates an exemplary method according to the present invention in the form of a computer program stored or defined on a computer readable media 1210 .
- a computer program 1200 and computer program product represents at least one of the methods described herein, such as for translation processing 450 .
- the computer program 1200 is coupled with or stored in a computer readable media 1210 , such that a computer system can read and execute the computer program 1200 .
- FIG. 7 illustrates an exemplary computer system 1300 including at least one processor or central processing unit (CPU) 1310 , a memory 1320 coupled to the CPU 1310 , and support for input and output 1340 .
- the computer program 1200 may be loaded into a memory 1320 accessible to the computer system 1300 , which is capable of executing the computer program 1200 .
- the computer program 1200 may be permanently embedded in the memory 1320 or partially embedded and partially loaded into memory.
- the support for input and output 1340 typically interacts with the computer program 1200 .
- the present invention enhances performance by supporting communication between processes and/or computer programs thereby providing a more efficient utilization of resources. Further, communication between computer processes and/or computer programs without requiring unnecessary mutual exclusive access is more efficient.
Abstract
Description
Claims (26)
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/425,286 US7130936B1 (en) | 2002-02-22 | 2003-04-28 | System, methods, and computer program product for shared memory queue |
US11/590,671 US20070079077A1 (en) | 2002-04-29 | 2006-10-31 | System, method, and computer program product for shared memory queue |
Applications Claiming Priority (10)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US35945302P | 2002-02-22 | 2002-02-22 | |
US37682402P | 2002-04-29 | 2002-04-29 | |
US43295402P | 2002-12-11 | 2002-12-11 | |
US43278502P | 2002-12-11 | 2002-12-11 | |
US43287202P | 2002-12-11 | 2002-12-11 | |
US43275702P | 2002-12-11 | 2002-12-11 | |
US43277802P | 2002-12-11 | 2002-12-11 | |
US43292802P | 2002-12-11 | 2002-12-11 | |
US43334802P | 2002-12-12 | 2002-12-12 | |
US10/425,286 US7130936B1 (en) | 2002-02-22 | 2003-04-28 | System, methods, and computer program product for shared memory queue |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/590,671 Division US20070079077A1 (en) | 2002-04-29 | 2006-10-31 | System, method, and computer program product for shared memory queue |
Publications (1)
Publication Number | Publication Date |
---|---|
US7130936B1 true US7130936B1 (en) | 2006-10-31 |
Family
ID=37189352
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/425,286 Expired - Lifetime US7130936B1 (en) | 2002-02-22 | 2003-04-28 | System, methods, and computer program product for shared memory queue |
Country Status (1)
Country | Link |
---|---|
US (1) | US7130936B1 (en) |
Cited By (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20050289213A1 (en) * | 2004-06-25 | 2005-12-29 | International Business Machines Corporation | Switching between blocking and non-blocking input/output |
US20070006004A1 (en) * | 2005-06-30 | 2007-01-04 | Intel Corporation | Dynamic bus parking |
US20070079077A1 (en) * | 2002-04-29 | 2007-04-05 | Baines Mandeep S | System, method, and computer program product for shared memory queue |
US20090037422A1 (en) * | 2007-07-31 | 2009-02-05 | Lik Wong | Combining capture and apply in a distributed information sharing system |
KR100930520B1 (en) | 2007-01-25 | 2009-12-09 | 삼성전자주식회사 | Methods and devices for processing queues in network systems |
US20100198920A1 (en) * | 2009-01-30 | 2010-08-05 | Oracle International Corporation | High performant information sharing and replication for single-publisher and multiple-subscriber configuration |
US20110010392A1 (en) * | 2007-07-31 | 2011-01-13 | Lik Wong | Checkpoint-Free In Log Mining For Distributed Information Sharing |
FR3007542A1 (en) * | 2013-06-21 | 2014-12-26 | St Microelectronics Grenoble 2 | DATA EXCHANGE FILE HAVING UNLIMITED DEPTH |
US11226852B2 (en) | 2016-11-25 | 2022-01-18 | Genetec Inc. | System for inter-process communication |
Citations (29)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4800521A (en) | 1982-09-21 | 1989-01-24 | Xerox Corporation | Task control manager |
US5239634A (en) * | 1989-09-21 | 1993-08-24 | Digital Equipment Corporation | Memory controller for enqueuing/dequeuing process |
US5247677A (en) | 1992-05-22 | 1993-09-21 | Apple Computer, Inc. | Stochastic priority-based task scheduler |
US5260868A (en) | 1986-08-11 | 1993-11-09 | Texas Instruments Incorporate | Method for calendaring future events in real-time |
US5301312A (en) | 1991-08-21 | 1994-04-05 | International Business Machines Corporation | Method and system for utilizing benign fault occurrence to measure interrupt-blocking times |
US5465335A (en) | 1991-10-15 | 1995-11-07 | Hewlett-Packard Company | Hardware-configured operating system kernel having a parallel-searchable event queue for a multitasking processor |
US5530879A (en) | 1994-09-07 | 1996-06-25 | International Business Machines Corporation | Computer system having power management processor for switching power supply from one state to another responsive to a closure of a switch, a detected ring or an expiration of a timer |
US5619409A (en) | 1995-06-12 | 1997-04-08 | Allen-Bradley Company, Inc. | Program analysis circuitry for multi-tasking industrial controller |
US5636124A (en) | 1995-03-08 | 1997-06-03 | Allen-Bradley Company, Inc. | Multitasking industrial controller |
US5640563A (en) | 1992-01-31 | 1997-06-17 | International Business Machines Corporation | Multi-media computer operating system and method |
US5671446A (en) * | 1995-03-16 | 1997-09-23 | Apple Computer, Inc. | Method and apparatus for atomically accessing a queue in a memory structure where LIFO is converted to FIFO |
US5701481A (en) | 1983-05-31 | 1997-12-23 | Canon Kabushiki Kaisha | Data processing apparatus which operates in a plurality of operation modes and includes first and second monitoring means |
US5781187A (en) | 1994-05-31 | 1998-07-14 | Advanced Micro Devices, Inc. | Interrupt transmission via specialized bus cycle within a symmetrical multiprocessing system |
US5872909A (en) | 1995-01-24 | 1999-02-16 | Wind River Systems, Inc. | Logic analyzer for software |
US5938708A (en) | 1997-07-03 | 1999-08-17 | Trw Inc. | Vehicle computer system having a non-interrupt cooperative multi-tasking kernel and a method of controlling a plurality of vehicle processes |
US5944840A (en) | 1997-09-10 | 1999-08-31 | Bluewater Systems, Inc. | Continuous monitor for interrupt latency in real time systems |
US6035348A (en) * | 1997-06-30 | 2000-03-07 | Sun Microsystems, Inc. | Method for managing multiple ordered sets by dequeuing selected data packet from single memory structure |
US6105048A (en) | 1995-08-18 | 2000-08-15 | Siemens Aktiengesellschaft | Apparatus and method for the real-time processing of a plurality of tasks |
US6279108B1 (en) | 1987-06-02 | 2001-08-21 | Seagate Technology Llc | Programmable microcontroller architecture for disk drive system |
US6341303B1 (en) | 1998-08-28 | 2002-01-22 | Oracle Corporation | System and method for scheduling a resource according to a preconfigured plan |
US6349321B1 (en) | 1997-04-30 | 2002-02-19 | Kabushiki Kaisha Toshiba | Data processing system and scheduling method |
US6359622B1 (en) | 1995-07-19 | 2002-03-19 | Extempo Systems, Inc. | System and method for directed improvisation by computer controlled characters |
US6385638B1 (en) | 1997-09-04 | 2002-05-07 | Equator Technologies, Inc. | Processor resource distributor and method |
US6385637B1 (en) | 1997-08-21 | 2002-05-07 | Rockwell Science Center, Inc. | Periodic process timer |
US6425091B1 (en) | 1999-02-03 | 2002-07-23 | Motorola, Inc. | Method and apparatus for tolerating scheduling latency and achieving time alignment for transmit and receive signals in high-speed modems implemented on host processors |
US6438573B1 (en) | 1996-10-09 | 2002-08-20 | Iowa State University Research Foundation, Inc. | Real-time programming method |
US6438651B1 (en) * | 1999-11-01 | 2002-08-20 | International Business Machines Corporation | Method, system, and program for managing requests to a cache using flags to queue and dequeue data in a buffer |
US6510531B1 (en) * | 1999-09-23 | 2003-01-21 | Lucent Technologies Inc. | Methods and systems for testing parallel queues |
US6779084B2 (en) * | 2002-01-23 | 2004-08-17 | Intel Corporation | Enqueue operations for multi-buffer packets |
-
2003
- 2003-04-28 US US10/425,286 patent/US7130936B1/en not_active Expired - Lifetime
Patent Citations (29)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4800521A (en) | 1982-09-21 | 1989-01-24 | Xerox Corporation | Task control manager |
US5701481A (en) | 1983-05-31 | 1997-12-23 | Canon Kabushiki Kaisha | Data processing apparatus which operates in a plurality of operation modes and includes first and second monitoring means |
US5260868A (en) | 1986-08-11 | 1993-11-09 | Texas Instruments Incorporate | Method for calendaring future events in real-time |
US6279108B1 (en) | 1987-06-02 | 2001-08-21 | Seagate Technology Llc | Programmable microcontroller architecture for disk drive system |
US5239634A (en) * | 1989-09-21 | 1993-08-24 | Digital Equipment Corporation | Memory controller for enqueuing/dequeuing process |
US5301312A (en) | 1991-08-21 | 1994-04-05 | International Business Machines Corporation | Method and system for utilizing benign fault occurrence to measure interrupt-blocking times |
US5465335A (en) | 1991-10-15 | 1995-11-07 | Hewlett-Packard Company | Hardware-configured operating system kernel having a parallel-searchable event queue for a multitasking processor |
US5640563A (en) | 1992-01-31 | 1997-06-17 | International Business Machines Corporation | Multi-media computer operating system and method |
US5247677A (en) | 1992-05-22 | 1993-09-21 | Apple Computer, Inc. | Stochastic priority-based task scheduler |
US5781187A (en) | 1994-05-31 | 1998-07-14 | Advanced Micro Devices, Inc. | Interrupt transmission via specialized bus cycle within a symmetrical multiprocessing system |
US5530879A (en) | 1994-09-07 | 1996-06-25 | International Business Machines Corporation | Computer system having power management processor for switching power supply from one state to another responsive to a closure of a switch, a detected ring or an expiration of a timer |
US5872909A (en) | 1995-01-24 | 1999-02-16 | Wind River Systems, Inc. | Logic analyzer for software |
US5636124A (en) | 1995-03-08 | 1997-06-03 | Allen-Bradley Company, Inc. | Multitasking industrial controller |
US5671446A (en) * | 1995-03-16 | 1997-09-23 | Apple Computer, Inc. | Method and apparatus for atomically accessing a queue in a memory structure where LIFO is converted to FIFO |
US5619409A (en) | 1995-06-12 | 1997-04-08 | Allen-Bradley Company, Inc. | Program analysis circuitry for multi-tasking industrial controller |
US6359622B1 (en) | 1995-07-19 | 2002-03-19 | Extempo Systems, Inc. | System and method for directed improvisation by computer controlled characters |
US6105048A (en) | 1995-08-18 | 2000-08-15 | Siemens Aktiengesellschaft | Apparatus and method for the real-time processing of a plurality of tasks |
US6438573B1 (en) | 1996-10-09 | 2002-08-20 | Iowa State University Research Foundation, Inc. | Real-time programming method |
US6349321B1 (en) | 1997-04-30 | 2002-02-19 | Kabushiki Kaisha Toshiba | Data processing system and scheduling method |
US6035348A (en) * | 1997-06-30 | 2000-03-07 | Sun Microsystems, Inc. | Method for managing multiple ordered sets by dequeuing selected data packet from single memory structure |
US5938708A (en) | 1997-07-03 | 1999-08-17 | Trw Inc. | Vehicle computer system having a non-interrupt cooperative multi-tasking kernel and a method of controlling a plurality of vehicle processes |
US6385637B1 (en) | 1997-08-21 | 2002-05-07 | Rockwell Science Center, Inc. | Periodic process timer |
US6385638B1 (en) | 1997-09-04 | 2002-05-07 | Equator Technologies, Inc. | Processor resource distributor and method |
US5944840A (en) | 1997-09-10 | 1999-08-31 | Bluewater Systems, Inc. | Continuous monitor for interrupt latency in real time systems |
US6341303B1 (en) | 1998-08-28 | 2002-01-22 | Oracle Corporation | System and method for scheduling a resource according to a preconfigured plan |
US6425091B1 (en) | 1999-02-03 | 2002-07-23 | Motorola, Inc. | Method and apparatus for tolerating scheduling latency and achieving time alignment for transmit and receive signals in high-speed modems implemented on host processors |
US6510531B1 (en) * | 1999-09-23 | 2003-01-21 | Lucent Technologies Inc. | Methods and systems for testing parallel queues |
US6438651B1 (en) * | 1999-11-01 | 2002-08-20 | International Business Machines Corporation | Method, system, and program for managing requests to a cache using flags to queue and dequeue data in a buffer |
US6779084B2 (en) * | 2002-01-23 | 2004-08-17 | Intel Corporation | Enqueue operations for multi-buffer packets |
Non-Patent Citations (3)
Title |
---|
Deshpande, et al., "The Shift Programming Language for Dynamic Networks of Hybrid Automata" IEEE Transactions on Automatic Control, Apr. 1998, 43(4): 584-587. |
Deshpande, et al., "Viable Control of Hybrid Systems", Hybrid Systems II, Springer 1995. |
Interrupt Driven Task Scheduler for Systems, IBM Technical Disclosure Bulletin, Mar. 1992, US. |
Cited By (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20070079077A1 (en) * | 2002-04-29 | 2007-04-05 | Baines Mandeep S | System, method, and computer program product for shared memory queue |
US20050289213A1 (en) * | 2004-06-25 | 2005-12-29 | International Business Machines Corporation | Switching between blocking and non-blocking input/output |
US20070006004A1 (en) * | 2005-06-30 | 2007-01-04 | Intel Corporation | Dynamic bus parking |
US7529955B2 (en) * | 2005-06-30 | 2009-05-05 | Intel Corporation | Dynamic bus parking |
US20090217070A1 (en) * | 2005-06-30 | 2009-08-27 | Intel Corporation | Dynamic Bus Parking |
KR100930520B1 (en) | 2007-01-25 | 2009-12-09 | 삼성전자주식회사 | Methods and devices for processing queues in network systems |
US20110010392A1 (en) * | 2007-07-31 | 2011-01-13 | Lik Wong | Checkpoint-Free In Log Mining For Distributed Information Sharing |
US20090037422A1 (en) * | 2007-07-31 | 2009-02-05 | Lik Wong | Combining capture and apply in a distributed information sharing system |
US8799213B2 (en) | 2007-07-31 | 2014-08-05 | Oracle International Corporation | Combining capture and apply in a distributed information sharing system |
US9009104B2 (en) | 2007-07-31 | 2015-04-14 | Oracle International Corporation | Checkpoint-free in log mining for distributed information sharing |
US20100198920A1 (en) * | 2009-01-30 | 2010-08-05 | Oracle International Corporation | High performant information sharing and replication for single-publisher and multiple-subscriber configuration |
US9230002B2 (en) * | 2009-01-30 | 2016-01-05 | Oracle International Corporation | High performant information sharing and replication for single-publisher and multiple-subscriber configuration |
FR3007542A1 (en) * | 2013-06-21 | 2014-12-26 | St Microelectronics Grenoble 2 | DATA EXCHANGE FILE HAVING UNLIMITED DEPTH |
US9594506B2 (en) | 2013-06-21 | 2017-03-14 | Stmicroelectronics (Grenoble 2) Sas | Data queue having an unlimited depth |
US10140020B2 (en) | 2013-06-21 | 2018-11-27 | Stmicroelectronics (Grenoble 2) Sas | Data queue having an unlimited depth |
US11226852B2 (en) | 2016-11-25 | 2022-01-18 | Genetec Inc. | System for inter-process communication |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7443836B2 (en) | Processing a data packet | |
US6532509B1 (en) | Arbitrating command requests in a parallel multi-threaded processing system | |
TW544629B (en) | Thread signaling in multi-threaded network processor | |
JP3553634B2 (en) | Interconnect interface | |
US7269179B2 (en) | Control mechanisms for enqueue and dequeue operations in a pipelined network processor | |
US7676588B2 (en) | Programmable network protocol handler architecture | |
EP1247168B1 (en) | Memory shared between processing threads | |
US7853951B2 (en) | Lock sequencing to reorder and grant lock requests from multiple program threads | |
US7158964B2 (en) | Queue management | |
US20070124728A1 (en) | Passing work between threads | |
US20040252709A1 (en) | System having a plurality of threads being allocatable to a send or receive queue | |
US20060072563A1 (en) | Packet processing | |
JPH09506727A (en) | Message Mechanism for Large Scale Parallel Processing System | |
US20030043803A1 (en) | Transmitting multicast data packets | |
CA2536037A1 (en) | Fast and memory protected asynchronous message scheme in a multi-process and multi-thread environment | |
JPH08180001A (en) | Communication system, communication method and network interface | |
JPH06187302A (en) | Transfer request queue control system | |
US7293158B2 (en) | Systems and methods for implementing counters in a network processor with cost effective memory | |
US20070044103A1 (en) | Inter-thread communication of lock protected data | |
US7130936B1 (en) | System, methods, and computer program product for shared memory queue | |
US20070079077A1 (en) | System, method, and computer program product for shared memory queue | |
US9804959B2 (en) | In-flight packet processing | |
US9703739B2 (en) | Return available PPI credits command | |
JP2736237B2 (en) | Remote memory access controller | |
US7320044B1 (en) | System, method, and computer program product for interrupt scheduling in processing communication |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: TEJA TECHNOLOGIES INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BAINES, MANDEEP S.;KAPADIA, SHAMIT D.;DESHPANDE, AKASH R.;REEL/FRAME:013842/0392 Effective date: 20030716 |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
AS | Assignment |
Owner name: ARC INTERNATIONAL I.P., INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:TEJA TECHNOLOGIES, INC.;REEL/FRAME:020143/0918 Effective date: 20070330 |
|
FEPP | Fee payment procedure |
Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
FPAY | Fee payment |
Year of fee payment: 4 |
|
AS | Assignment |
Owner name: SYNOPSYS, INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:VIRAGE LOGIC CORPORATION;VL C.V.;ARC CORES LIMITED;AND OTHERS;REEL/FRAME:025105/0907 Effective date: 20100902 |
|
FEPP | Fee payment procedure |
Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Free format text: PAYER NUMBER DE-ASSIGNED (ORIGINAL EVENT CODE: RMPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
FEPP | Fee payment procedure |
Free format text: PAT HOLDER NO LONGER CLAIMS SMALL ENTITY STATUS, ENTITY STATUS SET TO UNDISCOUNTED (ORIGINAL EVENT CODE: STOL); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
REFU | Refund |
Free format text: REFUND - PAYMENT OF MAINTENANCE FEE, 8TH YR, SMALL ENTITY (ORIGINAL EVENT CODE: R2552); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
FPAY | Fee payment |
Year of fee payment: 8 |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1553) Year of fee payment: 12 |