Interrupt coalescing

Abstract

In an embodiment of the invention, a method comprises: collecting a plurality of interrupts and servicing coalesced active interrupts to a processor if an interrupt count limit has occurred or if a timeout count has expired. In another embodiment of the invention, an apparatus comprises: an interrupt controller configured to collect a plurality of interrupts and configured to service coalesced active interrupts to a processor if an interrupt count limit has occurred or if a timeout count has expired. In yet another embodiment of the invention, an article of manufacture comprises: a non-transient computer-readable medium having stored thereon instructions that permit a method comprising: collecting a plurality of interrupts and servicing coalesced active interrupts to a processor if an interrupt count limit has occurred or if a timeout count has expired.

Description

FIELD

Embodiments of the invention relate generally to interrupt handling systems which are typically applied to computer systems and/or System-on-Chip (SoC) applications.

DESCRIPTION OF RELATED ART

The background description provided herein is for the purpose of generally presenting the context of the disclosure of the invention. Work of the presently named inventors, to the extent the work is described in this background section, as well as aspects of the description that may not otherwise qualify as prior art at the time of filing, are neither expressly nor impliedly admitted as prior art against this present disclosure.

Computers usually provide a way to start software routines in response to asynchronous events. These events are signaled to the Central Processing Unit (CPU) via interrupt requests. The CPU has a specifically written piece of software to handle the interrupts. This software is called an interrupt service routine or interrupt handler.

Interrupts were originated to avoid wasting the CPU's valuable time in software loops (also called polling loops) waiting for events. Instead, the CPU was able to do other tasks while the event is pending. When the event occurred, the interrupt would signal the CPU to execute the interrupt service routine. Before the CPU can start processing the interrupt service routine, the CPU must first save the state of the current task that the CPU is handling. When the CPU is done executing the interrupt service routine, the saved state is restored to continue the processing of the saved task.

In the modern computer systems, interrupts allow the CPU to respond promptly to events, while other work or task is performed. As the CPU's function becomes complicated, the number of tasks that the CPU is required to perform increases as well. Therefore, the CPU is periodically interrupted and in effect, the CPU's performance is reduced because the saving and retrieving of the CPU's current execution adds finite time to the processing of each of the interrupts. However, with the below-discussed method called “interrupt coalescing” in one embodiment of the invention, interrupt events are collected by the interrupt controller and are signaled to the CPU only when certain events are satisfied. This method in an embodiment of the invention advantageously reduces the interrupt processing overhead of the CPU (the time spent for saving and restoring the current execution) in a busy system. Therefore, the performance of the CPU is being optimized, and the throughput of the system is increased in accordance with at least one embodiment of the invention.

One example of a current method and system for generating interrupts is disclosed in, for example, U.S. Pat. No. 5,708,814. However, while the conventional solutions are suited for their intended purposes, the conventional solutions are also subject to at least one or more shortcomings and/or limitations.

SUMMARY

Interrupt handling for current complex computer systems is quite difficult to manage. There should be an efficient way on handling multiple interrupts from various interfaces so that the time of the CPU for responding to each interface would be managed in such a way that not every interrupt events from each interface would cause the CPU to hold and save its current execution in order to service the interrupt request. One method or apparatus to manage such cases is through the implementation of an interrupt coalescing mechanism in an embodiment of the invention. An embodiment of the invention also provides a method of generating an interrupt to the CPU whenever a certain amount of interrupts is received by the interrupt controller or if a timeout count has expired. The assertion of coalesced interrupt is based on the interrupt ranges and timeout counts that is firmware configurable. When the certain condition for the assertion of coalesced interrupt is met, the interrupt controller will generate coalesced interrupts to the processor (e.g., CPU). As soon as the processor has serviced all the coalesced interrupts, the interrupt controller will capture again actual interrupts until the interrupt controller generates another set of coalesced interrupts. With this feature, the number of interrupts to the processor is being reduced, and thus the performance of the processor is being optimized because the processor can have more time for other tasks. In another embodiment, the interrupt controller continuously capture interrupts while the processor services the coalesced interrupts. In this case, the interrupt controller generates the next set of coalesced interrupts when the certain condition for the assertion of this next set of coalesced interrupts is met.

Accordingly, embodiments of the invention may include at least one or more of the following. In an embodiment of the invention, a method comprises: collecting a plurality of interrupts and servicing coalesced active interrupts to a processor if an interrupt count limit has occurred or if a timeout count has expired.

In another embodiment of the invention, an apparatus comprises: an interrupt controller configured to collect a plurality of interrupts and configured to service coalesced active interrupts to a processor if an interrupt count limit has occurred or if a timeout count has expired.

In yet another embodiment of the invention, an article of manufacture comprises: a non-transient computer-readable medium having stored thereon instructions that permit a method comprising: collecting a plurality of interrupts and servicing coalesced active interrupts to a processor if an interrupt count limit has occurred or if a timeout count has expired.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention, as claimed.

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate one (several) embodiment(s) of the invention and together with the description, serve to explain the principles of the invention.

BRIEF DESCRIPTION OF DRAWINGS

Non-limiting and non-exhaustive embodiments of the present invention are described with reference to the following figures, wherein like reference numerals refer to like parts throughout the various views unless otherwise specified.

It is to be noted, however, that the appended drawings illustrate only typical embodiments of this invention and are therefore not to be considered limiting of its scope, for the present invention may admit to other equally effective embodiments.

FIG. 1 is a diagram illustrating an apparatus (system) comprising an interrupt controller module and interrupt controller sub-modules connected to several core modules and to a processor (e.g., CPU), wherein the sub-modules comprises an interrupt tagging/search block including an interrupt stack register, an interrupt coalescing module, and a state machine module, according to an embodiment of the invention.

FIG. 2 is a diagram illustrating an interrupt coalescing module which comprises the register settings, comparators, timers, and other sub-blocks for interrupt coalescing operations, according to an embodiment of the invention.

FIG. 3 is a diagram illustrating a process flow of how interrupts received from interface cores are being coalesced, according to an embodiment of the invention.

DETAILED DESCRIPTION

In the following detailed description, for purposes of explanation, numerous specific details are set forth to provide a thorough understanding of the various embodiments of the present invention. Those of ordinary skill in the art will realize that these various embodiments of the present invention are illustrative only and are not intended to be limiting in any way. Other embodiments of the present invention will readily suggest themselves to such skilled persons having the benefit of this disclosure.

In addition, for clarity purposes, not all of the routine features of the embodiments described herein are shown or described. One of ordinary skill in the art would readily appreciate that in the development of any such actual implementation, numerous implementation-specific decisions may be required to achieve specific design objectives. These design objectives will vary from one implementation to another and from one developer to another. Moreover, it will be appreciated that such a development effort might be complex and time-consuming, but would nevertheless be a routine engineering undertaking for those of ordinary skill in the art having the benefit of this disclosure. The various embodiments disclosed herein are not intended to limit the scope and spirit of the herein disclosure.

Exemplary embodiments for carrying out the principles of the present invention are described herein with reference to the drawings. However, the present invention is not limited to the specifically described and illustrated embodiments. A person skilled in the art will appreciate that many other embodiments are possible without deviating from the basic concept of the invention. Therefore, the principles of the present invention extend to any work that falls within the scope of the appended claims.

As used herein, the terms “a” and “an” herein do not denote a limitation of quantity, but rather denote the presence of at least one of the referenced items.

In the following description and in the claims, the terms “include” and “comprise” are used in an open-ended fashion, and thus should be interpreted to mean “include, but not limited to . . . ”. Also, the term “couple” (or “coupled”) is intended to mean either an indirect or direct electrical connection (or an indirect or direct optical connection). Accordingly, if one device is coupled to another device, then that connection may be through a direct electrical (or optical) connection, or through an indirect electrical (or optical) connection via other devices and/or other connections.

An embodiment of the invention can solve the problem of frequent interrupts to the processor (e.g., CPU) wherein these frequent interrupts tend to reduce the over-all system performance of the processor. An embodiment of the invention can also have a flexible number of groups wherein each group has its unique configurable settings for waiting time and interrupt count limit. Another embodiment of the invention also has an option for generating an immediate interrupt which is also a firmware configurable setting.

FIG. 1 is a diagram illustrating an apparatus 100 (system 100) comprising the interrupt controller module 107 having interrupt controller sub-modules which are connected to several core modules (e.g., core modules 100, 101, 102) and to a processor 111 (e.g., CPU 111), according to an embodiment of the invention. The core modules 100, 101, 102 may vary in number as noted by, for example, the dots symbols 114. In an embodiment, the interrupt controller 107 (i.e., interrupt controller module 107) comprises interrupt controller sub-modules that include the interrupt tagging/searching block 106, interrupt coalescing module 105, and state machine 104. The interrupt controller 107 is interfaced to several core modules 100, 101 and 102. In particular, the interrupt tagging/searching block 106 is interfaced to the core modules 100, 101, and 102. On the other side, the interrupt controller 107 is connected to the processor 111 (e.g., CPU 111). CPU 111 can be a single CPU or a group of multiple CPUs. In particular, the interrupt coalescing module 105 and interrupt tagging/searching block 106 is interfaced to processor (CPU) 111.

Core modules 100, 101 and 102 can be any interrupt source cores or interface engines that can be connected to the CPU 111. Each core module 100, 101 and 102 has a dedicated interrupt signal and interrupt information like interrupt tag, interrupt source index, and interrupt status (illustrated at each line at group 103) transmitted to the interrupt controller 107. For example, cores 100, 101, and 102 transmit the core interrupt signals 112a, 112b, and 112c, respectively, among the group 103. The core interrupt signals from the core modules may vary in number as noted by, for example, the dot symbols 116. The signal 112a comprises a dedicated interrupt signal and interrupt information, wherein the interrupt information comprises an interrupt tag, interrupt source index, and interrupt status. The signals 112b and 112c also comprise respective dedicated interrupt signals and respective interrupt information.

Interrupt controller 107 comprises the interrupt tagging/searching block 106, the interrupt coalescing module 105, and the state machine 104. Core interrupt signals of group 103 are received by the interrupt tagging/searching block 106 for tagging and stacking mechanism. Each core interrupt signal of group 103 is also passed through the interrupt coalescing module 105 as an output active interrupt 0 to output active interrupt N of interrupt tagging/searching block 106 after the interrupt tagging/searching block 106 confirms that interrupt is valid by checking the valid interrupt signal(s) (in the group 103) that comes from each core 100-102. The parameter N can be any suitable integer. The active interrupts (0 to N) may vary in number as noted by, for example, the dot symbols 117. The active interrupt 0 to output active interrupt N are also shown as active interrupts 200 in FIG. 2.

The state machine 104 controls the ready status and busy status of an interrupt stack register 115 located in the interrupt tagging/searching block 106. Interrupt coalescing module 105 generates coalesced interrupt signal 129 based on the interrupt settings configured by the CPU 111 via data and address bus 108 or interrupt settings based on the default reset value settings in case there is no update made by the CPU 111. In response to the coalesced interrupt signal 129, the interrupt tagging/searching block 106 sends the valid interrupt signal 109 to the CPU 111 for an interrupt service routine execution. When the CPU 111 receives the valid interrupt 109, the CPU 111 reads the interrupt information like interrupt tag, interrupt source index, and interrupt status, from the stack register 115 of the interrupt tagging/searching block 106 via address and data bus 110. The CPU 111 can proceed to execution of the interrupt service routine after the CPU 111 has read the stack register 115 containing the information about the interrupt. In response to the valid interrupt signal 109, the interrupt service routine of the CPU 111 will service the coalesced interrupts (wherein the coalesced interrupts comprise the active interrupts 112a through 112c that have been collected and coalesced by the interrupt tagging/searching module 106).

After the CPU 111 has completed servicing of the coalesced interrupts, the CPU 111 writes back the interrupt information to the stack registers 115 of the interrupt tagging/searching block 106 via address and data bus 110. Interrupt tagging/searching block 106 makes a comparison on the current content of the stack register 115 against the content written back by CPU 111 via bus 110. If the contents in the comparison are the equal, then the interrupt stack register 115 in the interrupt tagging/searching block 106 is cleared by the state machine 104 and the valid interrupt signal 109 to CPU 111 is de-asserted by the interrupt tagging/searching block 106.

In another embodiment of the invention, the CPU 111 reads Interrupt DONE Count register (191) inside the interrupt coalescing module 105. This indicates how many outstanding interrupts have been collected and coalesced into the valid interrupt signal 109. The “read” from the stack register 115 can be done multiple times depending on the value in Interrupt DONE Count.

FIG. 2 is a diagram illustrating an interrupt coalescing module 105 which comprises the register settings, comparators, timers, and other sub-blocks for an interrupt coalescing operations, according to an embodiment of the invention. The adder 201 (in the interrupt coalescing module 105) receives each active interrupt 0 to interrupt N signals of group 200 which are output signals from interrupt tagging/searching block 106. These output signals group 200 are captured to become level signals, and are summed by adder 201. Every time there is/are new active interrupt/s of group 200, the adder 201 automatically updates the sum 230 of the adder 201. The result of the addition of the adder 201, checking of comparators, timer settings, and decoders determines the assertion of the coalesced interrupt 229. The value 230 is reflected in the Interrupt Done Count register (191). Coalesced interrupt 229 is also shown as coalesced interrupt 129 in FIG. 1.

The bus 205 (e.g., a signal path 205, or one or more data paths and/or address paths) is used for programming the values 207, 209 and 211, 216 and 218, 221, and 223. The values 207, 209 through 211, 216 through 218, 221, and 223 are set in, for example, one or more respective registers 251, and are also values that are programmable by firmware or software.

According to an embodiment of the invention, there are two ways coalesced interrupt is asserted. The first technique (way) is based on the predetermined number of interrupts and the second technique (way) is based on a predetermined timeout delay. If the sum of active interrupts output 230 by adder 201 is equal to or greater than the predetermined value set on the register maximum threshold count 207, or less than the predetermined value set on register minimum count range 0 209, then the coalesced interrupt signal 229 is asserted immediately. In this case, the coalesced interrupt signal 229 is sometimes called an “immediate interrupt” since the coalesced interrupt signal 229 does not need to wait for some delay time or interrupt asserts on zero delay time. The predetermined value set on register maximum threshold count 207 is checked by the comparator 208 and compared with the sum of active interrupts output 230. Comparator 208 outputs “1” or “high” when this comparison is true. In the same way, the predetermined value set on register minimum count range 0 209 is checked by comparator 206 and compared with the sum of active interrupts output 230. Comparator 206 outputs “1” or “high” when this comparison is true.

If the sum of active interrupts 230 that are output by adder 201 is equal or greater than the predetermined value set on register minimum count range 0 209 and less than the predetermined value set on register maximum threshold count 207, the assertion of coalesced interrupt 229 will be based on the predetermined timeout delays as performed by the N-BIT TIMER_0 217 through N-BIT TIMER_K 219. The N-BIT timers (e.g., N-BIT timers 217 and 219 in FIG. 2) may vary in number as noted by, for example, the dot symbols 231. Therefore, there can more than two N-BIT timers in the interrupt coalescing module 105.

The respective predetermined values set on register TIMEOUT SETTING 0 216 to register TIMEOUT SETTING K register 218 are assigned to corresponding N-BIT TIMER_0 timer 217 to N-BIT TIMER_K timer 219, respectively, when TIMER CONTROL 213 outputs enable signals 214. TIMER CONTROL 213 receives output signals 235 and 236 from comparators 210 and 212, respectively. These outputs identify the current timer that is expected to output the timeout signal. According to an embodiment of the invention, if the number of active interrupts 230 as resulted or added in adder 201 is equal or greater than the predetermined value on register minimum count range 0 209 and less than the predetermined value set on register minimum count range K 211, comparator 210 will output “1” or “high” and therefore the corresponding timer, N-BIT TIMER_0 217, will be enabled by the TIMER CONTROL 213 output 214. It should be noted that as soon as the N-BIT TIMER_0 217 is enabled, all timers (up to N-BIT TIMER_K 219) are also enabled. When sum output 230 of adder 201 became equal or greater than the register minimum count range K 211, N-BIT TIMER_0 217 will be disabled and the timeout is expected on N-BIT TIMER_K 219. It should be noted the existence of intermediate minimum count range X's whose value is greater than the register minimum count range 0 209 and less than the register minimum count range K 211. Furthermore, it should also be noted that the predetermined value on register minimum count range 0 209 should be less than the predetermined value on register minimum count range K 211. In the same way, it should also be noted that the corresponding N-bit timers 217 and 219 should be set in such a way that N-BIT TIMER_0 217 will have a delay time less than the delay time of N-BIT TIMER_K 219.

Additionally, the values between (and including) the register minimum count range 0 209 and register minimum count range K 211 may vary in number as noted by, for example, the dot symbols 232. Therefore, there can be one or more additional register minimum count range values in addition to the values 209 and 211. Similarly, there can be one or more additional comparators in addition to the comparators 210 and 212. The one or more additional comparators between the comparators 210 and 212 may vary in number as noted by, for example, the dot symbols 233. Each additional comparator between the comparators 210 and 212 would receive and compare the sum 230 and the additional register minimum count range value between the values 209 and 211.

Additionally, the values between (and including) the register timeout setting 0 216 and register timeout setting K 218 may vary in number as noted by, for example, the dot symbols 234. Therefore, there can be one or more additional register timeout setting values in addition to the values 216 and 218. The one or more additional N-BIT timers between the N-BIT TIMER_0 217 and N-BIT TIMER_K 219 would receive the additional timeout settings value between the values 216 and 218.

There are two ways on configuring the delay time for each timer (N-BIT TIMER_0 217 to N-BIT TIMER_K 219). The first way is through the configuration of the predetermined values on register TIMEOUT SETTING 0 216 to register TIMEOUT SETTING K 218. Assuming the input clock frequency (which is any output bit 252 from X-bit width GLOBAL TIMER 221) used by N-BIT TIMER_0 217 to N-BIT TIMER_K 219 are of the same granularity or time scale, setting the register TIMEOUT SETTING 0 216 less than register TIMEOUT SETTING K 218 ensures that delay time for N-BIT TIMER_0 217 is faster or less than N-BIT TIMER_K 219. In the same way, assuming the predetermined values on register TIMEOUT SETTING 0 216 to register TIMEOUT SETTING K 218 are the same, setting the predetermined value of register CLK SCALE SELECT 223 in such a way that the selector 225 for multiplexer 222 selects the faster frequency than the select line 225 for multiplexer 224 so that N-BIT TIMER_0 217 will be faster than N-BIT TIMER_K 219. The input clock frequency to multiplexers 222 and 224 defines different granularity or time scale which is any bit from X-bit width reference timer or GLOBAL TIMER 221. For example, GLOBAL TIMER 221 is 4-bit width timer. Bit 0, bit 1, bit 2 and bit 3 outputs of GLOBAL TIMER 221 are the reference clock frequencies that are selected via multiplexers 222 and 224. In addition, depending on what register settings will be varied, the condition that N-BIT TIMER_0 217 is faster than N-BIT TIMER_K 219 will be true.

Additionally, there can be one or more additional multiplexers between the multiplexers 222 and 224, wherein this one or more additional multiplexers receive the output bit 252 from global timer 221. The one or more additional multiplexers between the multiplexers 222 and 224 may vary in number as noted by, for example, the dot symbols 237. The one or more additional N-BIT timers between the N-BIT TIMER_0 217 and N-BIT TIMER_K 219 would receive the output of the one or more additional multiplexers between the multiplexers 222 and 224.

The outputs of the n-bit timers 217 and 219 are monitored by DECODER 220. DECODER 220 asserts an output 254 to OR gate 226 whenever any of the timers (timers 217 and 219) elapsed. The output 254 of DECODER 220 is ORed with the outputs (outputs 256, 258) of comparator 206 and comparator 208, respectively, for the coalesced interrupt signal 229.

Whenever coalesced interrupt 229 is asserted, the current sum output 230 of adder 201 is loaded to the DECREMENTOR block 204. When output 260 of DECREMENTOR 204 becomes zero (decoded by NOR gate 203) and the output 261 of OR gate 226 is zero, AND gate 227 will be asserted and register 228 will be reset and coalesced interrupt output 229 will be de-asserted. When decrement signal 202 goes high, the current value of DECREMENTOR block 204 is decreased by one. Decrement signal 202 is asserted when the CPU 111 clears the interrupt register 115 (FIG. 1) in the interrupt tagging/searching block 106. After the CPU 111 has completed servicing an interrupt, the CPU 111 writes back the interrupt information to the stack registers 115 of the interrupt tagging/searching block 106 via address and data bus 110. Interrupt tagging/searching block 106 makes a comparison on the current content of the stack register 115 against the one written back by CPU 111. If comparison is the equal, then interrupt register 115 in the interrupt tagging/searching block 106 is cleared and the coalesced interrupt signal 109 to CPU 111 is de-asserted.

In another embodiment of the invention, Decrement signal 202 is asserted when the CPU reads the interrupt stack register 115 in the interrupt tagging/searching block 106. When decrement signal 202 goes high, the current value of DECREMENTOR block 204 is decreased by one. After the CPU 111 has completed servicing of the coalesced interrupts, the CPU 111 sends a request to clear the DONE status bit (one of the bits of the Interrupt Done Status register (193)) by writing to the Interrupt Done Status Register (193) inside the interrupt coalescing module 105 via address and data bus 110.

Upon receiving CPU 111's clear request, the Interrupt Done Status Register (193) clears the DONE status bit when the output 260 of DECREMENTOR 2014 becomes zero.

When output 260 of DECREMENTOR 204 becomes zero (decoded by NOR gate 203) and the output 261 of OR gate 226 is zero, AND gate 227 will be asserted and register 228 will be reset and coalesced interrupt output 229 will be de-asserted. Consequently, the valid interrupt signal 109 to CPU 111 is de-asserted by the interrupt tagging/searching block 106.

FIG. 3 is a diagram illustrating a process flow 300 (or method 300) of how interrupts received from interface cores are being coalesced, according to an embodiment of the invention.

Reference is now made to both FIG. 2 and FIG. 3. At 301, the method 300 will start. At 305, the method 300 checks for an asserted active interrupt 200 from any core (e.g., cores 100, 101, and/or 102 in FIG. 1). If there is no asserted active interrupt 200, then the method 300 will start again at 301. At 305, if there is there is an asserted active interrupt 200, then the method 300 will perform the operations at 310. In the method 300, the term “operations” can mean a single operation, a single sequence, or a single step, or can mean a plurality of operations, a plurality of sequences, or a plurality of steps.

At 310, the adder 201 counts the number of active interrupts 200 that are asserted. The method 300 then performs the operations at 315, 320, 325, and 330. Typically, the operations at 315, 320, 325, and 330 are performed in a parallel manner and/or concurrently.

At 315, the comparator 206 compares the sum 230 of the adder 201 to the minimum count range 0 209. At 316, the method 300 determines if the sum 230 of the adder 201 is less than the minimum count range 0 209. At 316, if the sum 230 of the adder 201 is not less than the minimum count range 0 209, then the method 300 will again perform the operations at 315. At 316, if the sum 230 of the adder 201 is less than the minimum count range 0 209, then the method 300 will perform the operations at 317. At 317, the OR gate 226 outputs a signal 261 with a value of “1” (or “high”) and the register 228 asserts the coalesced interrupt 229. The coalesced interrupt 229 is similarly discussed above as coalesced interrupt 129 with reference to FIG. 1. The method 300 then returns to 301 after asserting the coalesced interrupt 229 at 317.

At 320, the comparator 208 compares the sum 230 of the adder 201 to the maximum threshold count 207. At 321, the method 300 determines if the sum 230 of the adder 201 is equal to or greater than the maximum threshold count 207. At 321, if the sum 230 of the adder 201 is _NOT_(EQUAL _OR_ GREATER) (which is _NOT_ EQUAL _AND_{— —}NOT_— GREATER or In boolean logic notation: (A|B)′=A′ & B′) than the maximum threshold count 207, then the method 300 will again perform the operations at 320. At 321, if the sum 230 of the adder 201 is equal to or greater than the maximum threshold count 207, then the method 300 will perform the operations at 317, as similarly discussed above, wherein the register 228 asserts the coalesced interrupt 229. The method 300 then returns to 301 after asserting the coalesced interrupt 229 at 317.

At 325, the comparator 210 compares the sum 230 of the adder 201 to the minimum count range 0 209 and up to the minimum count range K 211. At 326, the method 300 checks if the sum 230 of the adder 201 is equal to or greater than the count range of minimum count range 0 209, and also checks if the sum 230 is less than the minimum count range K 211. At 326, if the sum 230 of the adder 201 is as follows:

Let A=EQUAL to Min Count Range 0 209

Let B=GREATER THAN Min Count Range 0 209

Let C=LESS THAN Min Count Range K 211

Logical Notation:

((A|B) & C)′=(A|B)′|C′=A′ & B′|C′

_NOT_— EQUAL _AND_{— —}NOT_— GREATER THAN Min Count Range 0 209 _OR_{— —}NOT_— LESS THAN Min Count Range K 211,

then the method 300 will again perform the operations in 325. At 326, if the sum 230 of the adder 201 is equal to or greater than the minimum count range 0 209, and if the sum 230 of the adder 201 is less than the minimum count range K 211, then the method 300 will perform the operations at 327. The parameter K can any suitable integer value. At 327, the timer control 213 enables the N-bit timer_0 217 and up to the N-bit timer_K 219 if the result of the comparator 210 is true. The parameter N can be any suitable integer value. At 327, the timer control 213 disables the N-bit timer 217 if the result of the comparator 212 is true. At 327, the timer control 213 disables the N-bit timer_K 219 if the result of the comparator 208 is true. At 328, the method 300 then checks if the enabled N-bit timer (timer 217 or timer 219) has reached a time limit. At 328, if the enabled N-bit timer (timer 217 or timer 219) has not yet reached a time limit, then the method 300 will perform the operations at 327. At 328, if the enabled N-bit timer (timer 217 or timer 219) has reached a time limit, then the method 300 will perform the operations at 329. At 329, the decoder block 220 (or decoder 220) outputs a decoder signal 254 that has a value of “1” or “high”. The method 300 then performs the operations at 317 wherein the coalesced interrupt 229 is asserted, as similarly discussed above. The method 300 then returns to 301 after asserting the coalesced interrupt 229 at 317.

At 330, the comparator 212 compares the sum 230 of the adder 201 to the minimum count range K 211, and compares the sum 230 of the adder 201 to the maximum threshold count 207. At 331, the method 300 checks if the sum 230 of the adder 201 is equal to or greater than the minimum count range K 211, and checks if the sum 230 of the adder 201 is less than the maximum threshold count 207. At 331, if the sum 230 of the adder 201 is _NOT_(EQUAL _OR_— GREATER) (which is _NOT_— EQUAL _AND_— NOT_ GREATER or In boolean logic notation: (A|B)′=A′ & B′) than the threshold count 207, then the method 300 performs the operations at 330. At 331, if the sum 230 of the adder 201 is equal to or greater than the minimum count range K 211, and if the sum 230 of the adder 201 is less than the maximum threshold count 207, then the method 300 performs the operations at 327 and the method 300 then performs the subsequent operations at 328 and 329 as all similarly discussed above. The method 300 then returns to 301 after asserting the coalesced interrupt 229 at 317.

Interrupt Coalescing is a method of generating an interrupt to the CPU whenever a certain amount of interrupts is received by the interrupt controller, in an embodiment of the invention. The assertion of coalesced interrupts is based on the interrupt ranges and timeout counts. Interrupt ranges and timeout settings are typically firmware configurable. With this method in an embodiment of the invention, the number of interrupts to the processor is being reduced, and thus the performance of the processor is being optimized because the processor can have more time for other tasks. Another embodiment of the invention provides an apparatus that performs the above-mentioned operations.

Foregoing described embodiments of the invention are provided as illustrations and descriptions. They are not intended to limit the invention to precise form described. In particular, it is contemplated that functional implementation of invention described herein may be implemented equivalently in hardware, software, firmware, and/or other available functional components or building blocks, and that networks may be wired, wireless, or a combination of wired and wireless.

It is also within the scope of the present invention to implement a program or code that can be stored in a non-transient machine-readable (or non-transient computer-readable medium) having stored thereon instructions that permit a method (or that permit a computer) to perform any of the inventive techniques described above, or a program or code that can be stored in an article of manufacture that includes a non-transient computer readable medium on which computer-readable instructions for carrying out embodiments of the inventive techniques are stored. Other variations and modifications of the above-described embodiments and methods are possible in light of the teaching discussed herein.

The above description of illustrated embodiments of the invention, including what is described in the Abstract, is not intended to be exhaustive or to limit the invention to the precise forms disclosed. While specific embodiments of, and examples for, the invention are described herein for illustrative purposes, various equivalent modifications are possible within the scope of the invention, as those skilled in the relevant art will recognize.

These modifications can be made to the invention in light of the above detailed description. The terms used in the following claims should not be construed to limit the invention to the specific embodiments disclosed in the specification and the claims. Rather, the scope of the invention is to be determined entirely by the following claims, which are to be construed in accordance with established doctrines of claim interpretation.

Claims

1. A method, comprising: collecting a plurality of interrupts;if coalesced active interrupts have not exceeded an interrupt count limit, then enabling a timer; andservicing the coalesced active interrupts to a processor if the coalesced active interrupts have exceeded the interrupt count limit or if a timeout count of the timer has expired;wherein servicing the coalesced active interrupts comprises:comparing a sum of active interrupts to a minimum count range 0 and up to a minimum count range K, wherein K is an integer;if the sum of the active interrupts is equal to or is greater than the minimum count range 0, and if the sum of the active interrupts is less than the minimum count range K, then waiting for the timeout count to expire before servicing the coalesced active interrupts.

2. The method of claim 1, wherein servicing the coalesced active interrupts comprises: if a sum of active interrupts is equal to or greater than the interrupt count limit or is less than a predetermined value set on a minimum count range 0, then servicing the coalesced active interrupts.

3. The method of claim 1, wherein servicing the coalesced active interrupts comprises: comparing a sum of active interrupts to first predetermined value set on a minimum count range 0;if the sum of the active interrupts is less than the minimum count range 0, then servicing the coalesced active interrupts.

4. The method of claim 1, wherein servicing the coalesced active interrupts comprises: comparing a sum of active interrupts to a maximum threshold count;if the sum of the active interrupts is equal to or greater than the maximum threshold count, then servicing the coalesced active interrupts.

5. The method of claim 1, further comprising: asserting a coalesced interrupt signal to permit servicing of the coalesced active interrupts.

6. The method of claim 5, further comprising: clearing an interrupt stack register so that the coalesced interrupt signal is de-asserted.

7. The method of claim 1, wherein the interrupt count limit and timeout count are programmable values.

8. An apparatus, comprising: an interrupt controller configured to collect a plurality of interrupts, configured to enable a timer if coalesced active interrupts have not exceeded an interrupt count limit, and configured to service the coalesced active interrupts to a processor if the coalesced active interrupts have exceeded the interrupt count limit or if a timeout count of the timer has expired;wherein the interrupt controller is configured to wait for the timeout count to expire before servicing the coalesced active interrupts based on a comparison of a sum of active interrupts to a minimum count range 0 and up to a minimum count range K, wherein K is an integer and if the sum of the active interrupts is equal to or is greater than the minimum count range 0, and if the sum of the active interrupts is less than the minimum count range K.

9. The apparatus of claim 8, wherein the interrupt controller is configured to service the coalesced active interrupts if a sum of active interrupts is equal to or greater than the interrupt count limit or is less than a predetermined value set on a minimum count range 0.

10. The apparatus of claim 8, wherein the interrupt controller is configured to service the coalesced active interrupts based on a comparison of a sum of active interrupts to first predetermined value set on a minimum count range 0 and if the sum of the active interrupts is less than the minimum count range 0.

11. The apparatus of claim 8, wherein the interrupt controller is configured to service the coalesced active interrupts based on a comparison of a sum of active interrupts to a maximum threshold count and if the sum of the active interrupts is equal to or greater than the maximum threshold count.

12. The apparatus of claim 8, wherein the interrupt controller is configured to assert a coalesced interrupt signal to permit servicing of the coalesced active interrupts.

13. The apparatus of claim 12, wherein the interrupt controller is configured to clear an interrupt stack register so that the coalesced interrupt signal is de-asserted.

14. The apparatus of claim 8, wherein the interrupt count limit and timeout count are programmable values.

15. An article of manufacture, comprising: a non-transitory computer-readable medium having stored thereon instructions operable to permit an apparatus to:collect a plurality of interrupts;enable a timer if coalesced active interrupts have not exceeded an interrupt count limit; andservice the coalesced active interrupts to a processor if the coalesced active interrupts have exceeded the interrupt count limit or if a timeout count of the timer has expired;wherein the instructions are operable to permit the apparatus to service the coalesced active interrupts so that the apparatus:compares a sum of active interrupts to a minimum count range 0 and up to a minimum count range K, wherein K is an integer;if the sum of the active interrupts is equal to or is greater than the minimum count range 0, and if the sum of the active interrupts is less than the minimum count range K, then the apparatus waits for the timeout count to expire before servicing the coalesced active interrupts.

16. The article of manufacture of claim 15, wherein the instructions are operable to permit the apparatus to service the coalesced active interrupts so that if a sum of active interrupts is equal to or greater than the interrupt count limit or is less than a predetermined value set on a minimum count range 0, then the apparatus services the coalesced active interrupts.

17. The article of manufacture of claim 15, wherein the instructions are operable to permit the apparatus to service the coalesced active interrupts so that the apparatus compares a sum of active interrupts to first predetermined value set on a minimum count range 0; andif the sum of the active interrupts is less than the minimum count range 0, then the apparatus services the coalesced active interrupts.

18. The article of manufacture of claim 15, wherein the instructions are operable to permit the apparatus to service the coalesced active interrupts wherein the apparatus compares a sum of active interrupts to a maximum threshold count; andif the sum of the active interrupts is equal to or greater than the maximum threshold count, then the apparatus services the coalesced active interrupts.