US20050125801A1 - Method and apparartus for context switching in computer operating systems - Google Patents
Method and apparartus for context switching in computer operating systems Download PDFInfo
- Publication number
- US20050125801A1 US20050125801A1 US10/509,220 US50922004A US2005125801A1 US 20050125801 A1 US20050125801 A1 US 20050125801A1 US 50922004 A US50922004 A US 50922004A US 2005125801 A1 US2005125801 A1 US 2005125801A1
- Authority
- US
- United States
- Prior art keywords
- memory
- write
- context switch
- flag
- processor
- 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.)
- Abandoned
Links
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/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4812—Task transfer initiation or dispatching by interrupt, e.g. masked
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
- G06F12/0804—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches with main memory updating
-
- 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/461—Saving or restoring of program or task context
Definitions
- the present invention relates to a method and apparatus for context switching in computer operating systems.
- Operating systems are used within computer systems so as to increase the utilisation of the system's processor.
- the operating system advantageously serves to schedule instructions to the processor in order to limit the time period for which the processor might otherwise remain idle due to its faster operating speed.
- the switching between running processes should be as fast as possible and employ the minimum possible number of processor cycles.
- the cached data of the previously running process may be written back to memory for consistency between the contents of the cache and memory.
- the time taken to write the cached data back to memory once it has been identified that a context switch is to be conducted is a disadvantageously limiting feature with regard to the overall time required to execute the context switch.
- the present invention therefore seeks to provide for a simplified solution to the problem of context switching time delays.
- a method of context switching between processes in a computer operating system including writing cached data back to a memory means, comprising the step of the writing cached data back to the memory means during processor idle cycles at completion of a process and prior to initiation of the context switch.
- the invention is advantageous in that it employs the idle loop entered by the processor once, for example, a runnable process has completed and while the processor is waiting for the next event, such as the completion of an input/output operation, to occur.
- the processor is waiting for the next event, such as the completion of an input/output operation, to occur.
- spare processor cycles are lost and the present invention advantageously makes use of such cycles in order to write-back the cached data to memory.
- cached data can somewhat automatically be written back to memory so that, should a context switch be required, there is then no need to first write back the cached data to memory before commencing with the context switch. This can increase substantially the switching time required for context switches in an operating system.
- the feature of claim 2 is advantageous in providing for an effective means for indicating that cached data write-back has occurred so as to lead to appropriate subsequent control steps depending on whether a context switch is required or not.
- claims 3 - 5 advantageously further adapts the subject matter of claim 2 in a particularly effective manner so as to lead to a suitable form of process switching as required.
- a computer implemented system including a processor and cache memory arranged to receive operating system instructions for context switching between processes, and including control means for writing back cached data to memory means during processor idle cycles at completion of a process, and prior to initiation of the context switch.
- a computer program product having computer program instructions and arranged for controlling context switching between processes in a computer operating system so as to write cached data back to memory means during processor idle cycles at completion of a process and prior to initiation of the context switch.
- the present invention can therefore be provided as a software, or hardware, solution to the problem discussed above.
- FIG. 1 is a flow diagram of a context switching operation according to an embodiment of the present invention
- FIG. 2 is a schematic block diagram of a computer system including an operating system and related control means according to an embodiment of the present invention.
- FIG. 3 is a schematic block diagram of a computer system embodying the present invention and illustrating the transfer of cached pages.
- the invention proposes the use of idling time to write the cached data back to memory of the last running process, hence removing the time penalty of this operation at process switching time. Once the cached data has been written back to memory, a flag for that process is set to indicate that it has been done.
- the last runnable processes's flag is checked to see if its cached data has been written back during a CPU idle, and if set, the switch does not need to write cache back. However, if the CPU idle has not been entered, and hence the last runnable processes's flag is not set, then the process switching operating need to write the cache back.
- the resulting advantage is that for a system that has free CPU idle time, switching between processes is faster and the system becomes more responsive to the user. With current fast processors, processor idle time is available for most moderately loaded systems. Processor idle time also occurs when processes are using Input/Output steps and the processor is waiting for these transactions to complete.
- FIG. 1 there is provided a flow diagram illustrating an embodiment of the present invention in which a current process 10 is to be rescheduled 12 .
- a search for the next runnable process is made and, if one is located, a check at 16 is made to ascertain if the previous running process's flag has been set. If no flag has been set then a decision is made at 18 to copy back the cache of the previous running process and the flag of the next runnable process identified at 14 is cleared at 20 . If at 14 it was determined that the previous running process's flag had been set, then the method skips on to block 20 directly.
- the context switch to the new process is made and, at 24 , the new process becomes the currently running process.
- the method checks to see if the previous running process's flag has been set. If the flag has not been set, then the cached data is copied back at 28 and a flag in the previous running process's process descriptor is set at 30 . A sleep mode is then entered at 32 until, for example, an interrupt occurs and the method returns to block 14 as part of an idle loop.
- FIG. 2 illustrates computer system 34 embodying the present invention and which comprises the operating system kernel 36 and user mode processes 38 .
- the user mode processes comprises three processes 40 , 42 and 44 and the system illustrates the process 40 being blocked such that a scheduler 44 reschedules to process 42 .
- Each of the runnable processes is associated with a respective runnable process list 46 , 48 having respective flags 46 a , 48 a .
- the configuration illustrated in FIG. 2 is such as to illustrate a context switch between processes and the manner in which the runnable process descriptor lists point to identify the runnable processes.
- FIG. 3 illustrates a CPU 50 , data cache 52 and memory 54 of a computer system 56 , and illustrates inparticular the manner in which cached pages 58 - 62 are written back to respective memory locations 64 - 68 of the memory in accordance with the present invention.
- the data cache pages 58 - 62 are written back to the memory 54 if the process's flag is not set.
- the present invention finds particular use in UNIX-like systems, such as Linux, FreeBSD, Solaris, etc and that use a processor with a level-1 or level-2 cache. All such UNIX-like systems have an idle loop, or idle process, that employ effectively wasted CPU cycles, and most modern processors have some form of memory cache in, or between, the processor and main memory.
- the present invention can therefore find use in most current computer operating systems.
- the invention can comprise a software, or hardware, solution to the problem of the prior art. If the idea is implemented in hardware, one of a variety of methods could be used. For example, the CPU sleep mode could be employed for the data cache write-back automatically during a sleep period. Also, “flush data cache during sleep” flag in a status register could be employed to inform the CPU sleep operation to conduct the data cache write-back. Further, an extra sleep op-code could be added that performs the data cache write-back, in addition to the normal sleep op-code. The addition of a data cache write-back operand to a CPU sleep opcode is also an option.
- the present invention advantageously employs processor idle time to accelerate, and simplify, context switching in computer operating systems.
- the invention overcomes the problem of relatively slow context switching speeds between runnable processes/tasks which arises due to the general requirement to write cached data back to memory. Since, in the prior-art, this writing-back of cached memory is carried out at the time of the actual context switch, the employment of otherwise spare processor cycles in the idle loop of the operating system advantageously serves to enhance the operating speed since, at the time of initiating the context switch, the cached data has already been written back to memory.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Memory System Of A Hierarchy Structure (AREA)
Abstract
The present invention provides for a method and apparatus for a computer implemented system including a processor and cache memory arranged to receive operating system instructions for context switching between processes, and including control means for writing back cache data to memory means during processor idle cycle at completion of a process, and prior to initiation of the context switch so as to enhance the operating speed since, at the time of initiating the context switch, the cached data has already been written back to memory.
Description
- The present invention relates to a method and apparatus for context switching in computer operating systems.
- Operating systems are used within computer systems so as to increase the utilisation of the system's processor. In view of the difference in operating speed between the processor and, for example input output devices, the operating system advantageously serves to schedule instructions to the processor in order to limit the time period for which the processor might otherwise remain idle due to its faster operating speed.
- With developments in multitasking, and multithreading, an increasing number of interruptions are required to be handled by the operating system and correspondingly frequent context switches between different processes are then required.
- With, for example, UNIX-like kernels, the switching between running processes should be as fast as possible and employ the minimum possible number of processor cycles. However, before a context switch to a new process can be achieved, the cached data of the previously running process may be written back to memory for consistency between the contents of the cache and memory. The time taken to write the cached data back to memory once it has been identified that a context switch is to be conducted is a disadvantageously limiting feature with regard to the overall time required to execute the context switch.
- Attempts have been made to reduce context switching time as illustrated for example in U.S. Pat. No. 6,006,320. Here a duplicate arithmetic logic unit, instruction and data cache, register set and load/store unit are provided in an attempt to speed up the context switching process. However, such an approach to this problem can be considered disadvantageous in requiring the aforementioned duplication of hardware and proves to be unnecessarily complex.
- The present invention therefore seeks to provide for a simplified solution to the problem of context switching time delays.
- According to one aspect of the present invention there is provided a method of context switching between processes in a computer operating system including writing cached data back to a memory means, comprising the step of the writing cached data back to the memory means during processor idle cycles at completion of a process and prior to initiation of the context switch.
- The invention is advantageous in that it employs the idle loop entered by the processor once, for example, a runnable process has completed and while the processor is waiting for the next event, such as the completion of an input/output operation, to occur. During such an idle loop, spare processor cycles are lost and the present invention advantageously makes use of such cycles in order to write-back the cached data to memory.
- Thus, at the end of a process, cached data can somewhat automatically be written back to memory so that, should a context switch be required, there is then no need to first write back the cached data to memory before commencing with the context switch. This can increase substantially the switching time required for context switches in an operating system.
- The feature of claim 2 is advantageous in providing for an effective means for indicating that cached data write-back has occurred so as to lead to appropriate subsequent control steps depending on whether a context switch is required or not.
- The subject matter of claims 3-5 advantageously further adapts the subject matter of claim 2 in a particularly effective manner so as to lead to a suitable form of process switching as required.
- According to another aspect of the present invention, there is provided a computer implemented system including a processor and cache memory arranged to receive operating system instructions for context switching between processes, and including control means for writing back cached data to memory means during processor idle cycles at completion of a process, and prior to initiation of the context switch.
- In accordance with a further aspect of the present invention, there is provided a computer program product having computer program instructions and arranged for controlling context switching between processes in a computer operating system so as to write cached data back to memory means during processor idle cycles at completion of a process and prior to initiation of the context switch.
- As will be appreciated the present invention can therefore be provided as a software, or hardware, solution to the problem discussed above.
- The present invention is described further hereinafter, by way of example only, with reference to the accompanying drawings in which:
-
FIG. 1 is a flow diagram of a context switching operation according to an embodiment of the present invention; -
FIG. 2 is a schematic block diagram of a computer system including an operating system and related control means according to an embodiment of the present invention; and -
FIG. 3 is a schematic block diagram of a computer system embodying the present invention and illustrating the transfer of cached pages. - As will be appreciated, the invention proposes the use of idling time to write the cached data back to memory of the last running process, hence removing the time penalty of this operation at process switching time. Once the cached data has been written back to memory, a flag for that process is set to indicate that it has been done.
- When a switch between runnable processes occurs, the last runnable processes's flag is checked to see if its cached data has been written back during a CPU idle, and if set, the switch does not need to write cache back. However, if the CPU idle has not been entered, and hence the last runnable processes's flag is not set, then the process switching operating need to write the cache back.
- The resulting advantage is that for a system that has free CPU idle time, switching between processes is faster and the system becomes more responsive to the user. With current fast processors, processor idle time is available for most moderately loaded systems. Processor idle time also occurs when processes are using Input/Output steps and the processor is waiting for these transactions to complete.
- Turning first to
FIG. 1 , there is provided a flow diagram illustrating an embodiment of the present invention in which acurrent process 10 is to be rescheduled 12. At step 14 a search for the next runnable process is made and, if one is located, a check at 16 is made to ascertain if the previous running process's flag has been set. If no flag has been set then a decision is made at 18 to copy back the cache of the previous running process and the flag of the next runnable process identified at 14 is cleared at 20. If at 14 it was determined that the previous running process's flag had been set, then the method skips on to block 20 directly. At 22 the context switch to the new process is made and, at 24, the new process becomes the currently running process. - Back at
block 14, should a next runnable process not have been found, then the method checks to see if the previous running process's flag has been set. If the flag has not been set, then the cached data is copied back at 28 and a flag in the previous running process's process descriptor is set at 30. A sleep mode is then entered at 32 until, for example, an interrupt occurs and the method returns toblock 14 as part of an idle loop. - If at
block 26 it is determined that the previous running process's flag has been set, then the method skips to block 30 as illustrated. -
FIG. 2 illustratescomputer system 34 embodying the present invention and which comprises theoperating system kernel 36 anduser mode processes 38. The user mode processes comprises threeprocesses process 40 being blocked such that ascheduler 44 reschedules to process 42. Each of the runnable processes is associated with a respectiverunnable process list respective flags FIG. 2 is such as to illustrate a context switch between processes and the manner in which the runnable process descriptor lists point to identify the runnable processes. - Lastly,
FIG. 3 illustrates aCPU 50,data cache 52 andmemory 54 of a computer system 56, and illustrates inparticular the manner in which cached pages 58-62 are written back to respective memory locations 64-68 of the memory in accordance with the present invention. As will be appreciated, the data cache pages 58-62 are written back to thememory 54 if the process's flag is not set. - Analysis on a Philips TriMedia 1300 (with an external memory manager unit) prototype board has shown that a typical 1 Mb user mode application takes about 6000-7000 CPU cycles to write the process's data cache back to memory, which is about 30-50% of the total context switch time. With the data cache being written to memory during CPU idle time, the context switch time loses this 30-50% overhead and so almost doubles the context switch speed. It will of course be appreciated that these figures vary, depending on the size of the application and the number of cached regions of memory.
- The present invention finds particular use in UNIX-like systems, such as Linux, FreeBSD, Solaris, etc and that use a processor with a level-1 or level-2 cache. All such UNIX-like systems have an idle loop, or idle process, that employ effectively wasted CPU cycles, and most modern processors have some form of memory cache in, or between, the processor and main memory.
- The present invention can therefore find use in most current computer operating systems.
- As noted before, the invention can comprise a software, or hardware, solution to the problem of the prior art. If the idea is implemented in hardware, one of a variety of methods could be used. For example, the CPU sleep mode could be employed for the data cache write-back automatically during a sleep period. Also, “flush data cache during sleep” flag in a status register could be employed to inform the CPU sleep operation to conduct the data cache write-back. Further, an extra sleep op-code could be added that performs the data cache write-back, in addition to the normal sleep op-code. The addition of a data cache write-back operand to a CPU sleep opcode is also an option.
- Thus, as will be appreciated, the present invention advantageously employs processor idle time to accelerate, and simplify, context switching in computer operating systems. The invention overcomes the problem of relatively slow context switching speeds between runnable processes/tasks which arises due to the general requirement to write cached data back to memory. Since, in the prior-art, this writing-back of cached memory is carried out at the time of the actual context switch, the employment of otherwise spare processor cycles in the idle loop of the operating system advantageously serves to enhance the operating speed since, at the time of initiating the context switch, the cached data has already been written back to memory.
Claims (12)
1. A method of context switching between processes in a computer operating system including writing cached data back to a memory means, comprising the step of the writing cached data back to the memory means during processor idle cycles at completion of a process and prior to initiation of the context switch.
2. A method as claimed in claim 1 , including the step of setting a flag to indicate cached data has been written back to memory subsequent to the completion of the process.
3. A method as claimed in claim 2 , including the step of, at the time of requiring a context switch, checking for the said flag to identify if the previous process's cached data has been written back to memory.
4. A method as claimed in claim 3 , including the step of, upon identifying that the said flag has been set, conducting the context switch without further cache write-back to memory.
5. A method as claimed in claim 3 , and including the step of conducting a cached data write-back to memory at the time of requiring a context switch if the said flag has not been identified as set.
6. A computer implemented system including a processor and cache memory arranged to receive operating system instructions for context switching between processes, and including control means for writing back cache data to memory means during processor idle cycle at completion of a process, and prior to initiation of the context switch.
7. A system as claimed in claim 6 , and arranged to employ a processor sleep mode to write cache data back to memory automatically during a sleep period.
8. A system as claimed in claim 6 , and including a status register having a flag for initiating data cache write-back during a CPU sleep operation.
9. A system as claimed in claim 6 , wherein the operating system is arranged with an additional sleep code instruction for the data cache write-back
10. A system as claimed in claim 9 , wherein the sleep code of the processor includes an additional data cache write-back instruction.
11. A computer program product having computer program instructions and arranged for controlling context switching between processors in a computer operating system so as to write cached data back to memory means during processor idle cycles at completion of a process and prior to initiation of the context switch.
12. (canceled)
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
GB0207296.5 | 2002-03-28 | ||
GBGB0207296.5A GB0207296D0 (en) | 2002-03-28 | 2002-03-28 | Method and appartus for context switching in computer operating systems |
PCT/IB2003/000626 WO2003083656A2 (en) | 2002-03-28 | 2003-02-14 | Method and apparatus for context switching in computer operating systems |
Publications (1)
Publication Number | Publication Date |
---|---|
US20050125801A1 true US20050125801A1 (en) | 2005-06-09 |
Family
ID=9933869
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/509,220 Abandoned US20050125801A1 (en) | 2002-03-28 | 2003-02-14 | Method and apparartus for context switching in computer operating systems |
Country Status (6)
Country | Link |
---|---|
US (1) | US20050125801A1 (en) |
EP (1) | EP1523710A2 (en) |
JP (1) | JP2005521937A (en) |
AU (1) | AU2003206026A1 (en) |
GB (1) | GB0207296D0 (en) |
WO (1) | WO2003083656A2 (en) |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20030051146A1 (en) * | 2001-09-11 | 2003-03-13 | Akihiro Ebina | Security realizing system in network |
US20050044340A1 (en) * | 2003-08-18 | 2005-02-24 | Kitrick Sheets | Remote translation mechanism for a multinode system |
US7735088B1 (en) * | 2003-08-18 | 2010-06-08 | Cray Inc. | Scheduling synchronization of programs running as streams on multiple processors |
US7743223B2 (en) | 2003-08-18 | 2010-06-22 | Cray Inc. | Decoupling of write address from its associated write data in a store to a shared memory in a multiprocessor system |
US8307194B1 (en) | 2003-08-18 | 2012-11-06 | Cray Inc. | Relaxed memory consistency model |
CN103294608A (en) * | 2012-02-29 | 2013-09-11 | 富士通株式会社 | Processor, information processing apparatus, and arithmetic method |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB0516474D0 (en) * | 2005-08-10 | 2005-09-14 | Symbian Software Ltd | Pre-emptible context switching in a computing device |
JP5101128B2 (en) * | 2007-02-21 | 2012-12-19 | 株式会社東芝 | Memory management system |
JP7087150B1 (en) * | 2021-03-26 | 2022-06-20 | ミラクシアエッジテクノロジー株式会社 | Memory control system |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6321299B1 (en) * | 1998-04-29 | 2001-11-20 | Texas Instruments Incorporated | Computer circuits, systems, and methods using partial cache cleaning |
US20030056062A1 (en) * | 2001-09-14 | 2003-03-20 | Prabhu Manohar K. | Preemptive write back controller |
US6606687B1 (en) * | 1999-02-18 | 2003-08-12 | Texas Instruments Incorporated | Optimized hardware cleaning function for VIVT data cache |
-
2002
- 2002-03-28 GB GBGB0207296.5A patent/GB0207296D0/en not_active Ceased
-
2003
- 2003-02-14 US US10/509,220 patent/US20050125801A1/en not_active Abandoned
- 2003-02-14 EP EP03702909A patent/EP1523710A2/en not_active Withdrawn
- 2003-02-14 WO PCT/IB2003/000626 patent/WO2003083656A2/en not_active Application Discontinuation
- 2003-02-14 AU AU2003206026A patent/AU2003206026A1/en not_active Abandoned
- 2003-02-14 JP JP2003581012A patent/JP2005521937A/en active Pending
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6321299B1 (en) * | 1998-04-29 | 2001-11-20 | Texas Instruments Incorporated | Computer circuits, systems, and methods using partial cache cleaning |
US6606687B1 (en) * | 1999-02-18 | 2003-08-12 | Texas Instruments Incorporated | Optimized hardware cleaning function for VIVT data cache |
US20030056062A1 (en) * | 2001-09-14 | 2003-03-20 | Prabhu Manohar K. | Preemptive write back controller |
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20030051146A1 (en) * | 2001-09-11 | 2003-03-13 | Akihiro Ebina | Security realizing system in network |
US20050044340A1 (en) * | 2003-08-18 | 2005-02-24 | Kitrick Sheets | Remote translation mechanism for a multinode system |
US7577816B2 (en) | 2003-08-18 | 2009-08-18 | Cray Inc. | Remote translation mechanism for a multinode system |
US7735088B1 (en) * | 2003-08-18 | 2010-06-08 | Cray Inc. | Scheduling synchronization of programs running as streams on multiple processors |
US7743223B2 (en) | 2003-08-18 | 2010-06-22 | Cray Inc. | Decoupling of write address from its associated write data in a store to a shared memory in a multiprocessor system |
US8307194B1 (en) | 2003-08-18 | 2012-11-06 | Cray Inc. | Relaxed memory consistency model |
CN103294608A (en) * | 2012-02-29 | 2013-09-11 | 富士通株式会社 | Processor, information processing apparatus, and arithmetic method |
Also Published As
Publication number | Publication date |
---|---|
GB0207296D0 (en) | 2002-05-08 |
WO2003083656A2 (en) | 2003-10-09 |
AU2003206026A1 (en) | 2003-10-13 |
WO2003083656A3 (en) | 2005-02-03 |
EP1523710A2 (en) | 2005-04-20 |
AU2003206026A8 (en) | 2003-10-13 |
JP2005521937A (en) | 2005-07-21 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6044430A (en) | Real time interrupt handling for superscalar processors | |
US5867725A (en) | Concurrent multitasking in a uniprocessor | |
US5613114A (en) | System and method for custom context switching | |
US6981083B2 (en) | Processor virtualization mechanism via an enhanced restoration of hard architected states | |
US6205467B1 (en) | Microprocessor having a context save unit for saving context independent from interrupt requests | |
US5420991A (en) | Apparatus and method for maintaining processing consistency in a computer system having multiple processors | |
US5721855A (en) | Method for pipeline processing of instructions by controlling access to a reorder buffer using a register file outside the reorder buffer | |
US7272664B2 (en) | Cross partition sharing of state information | |
US7849298B2 (en) | Enhanced processor virtualization mechanism via saving and restoring soft processor/system states | |
US5349667A (en) | Interrupt control system for microprocessor for handling a plurality of maskable interrupt requests | |
EP0762270B1 (en) | Microprocessor with load/store operation to/from multiple registers | |
US5414864A (en) | Method for selectively saving/restoring first registers and bypassing second registers in register units based on individual lock/unlock status thereof | |
US5727227A (en) | Interrupt coprocessor configured to process interrupts in a computer system | |
JP3663317B2 (en) | Computer system | |
US6378023B1 (en) | Interrupt descriptor cache for a microprocessor | |
JPH10312282A (en) | Method and device for improving insruction completion | |
US5687381A (en) | Microprocessor including an interrupt polling unit configured to poll external devices for interrupts using interrupt acknowledge bus transactions | |
US20050125801A1 (en) | Method and apparartus for context switching in computer operating systems | |
US5948093A (en) | Microprocessor including an interrupt polling unit configured to poll external devices for interrupts when said microprocessor is in a task switch state | |
US5943494A (en) | Method and system for processing multiple branch instructions that write to count and link registers | |
US20040111593A1 (en) | Interrupt handler prediction method and system | |
JPH0916409A (en) | Microcomputer | |
US6675238B1 (en) | Each of a plurality of descriptors having a completion indicator and being stored in a cache memory of an input/output processor | |
US6311267B1 (en) | Just-in-time register renaming technique | |
US5841999A (en) | Information handling system having a register remap structure using a content addressable table |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: KONINKLIJKE PHILIPS ELECTRONICS N.V., NETHERLANDS Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:KING, COLIN I.;REEL/FRAME:016266/0943 Effective date: 20031030 |
|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |