|Publication number||US4626988 A|
|Application number||US 06/472,467|
|Publication date||Dec 2, 1986|
|Filing date||Mar 7, 1983|
|Priority date||Mar 7, 1983|
|Also published as||DE3483010D1, EP0118828A2, EP0118828A3, EP0118828B1|
|Publication number||06472467, 472467, US 4626988 A, US 4626988A, US-A-4626988, US4626988 A, US4626988A|
|Inventors||Steven L. George|
|Original Assignee||International Business Machines Corporation|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (7), Referenced by (80), Classifications (8), Legal Events (8)|
|External Links: USPTO, USPTO Assignment, Espacenet|
1. Technical Field
The invention relates to an apparatus and a method for fetching instructions in a data processing system.
2. Background Art
Processor performance is degraded by storage access conflicts. Memory contention occurs because of various storage accesses for reading instructions and operands and for storing results. These conflicts may be especially noticeable in an attached processor or multiprocessor environment. A significant amount of processor performance degradation caused by storage conflicts is due to instruction fetches. Program loops magnify this problem because these loops often make instruction fetches unnecessarily redundant. Repetitive loops frequently occur in most programs, and as a result, the same set of instructions are executed many times. The instruction fetches or prefetches then become redundant since the information read is the same as that just recently read from storage when the same loop was previously executed.
In an attempt to eliminate making some of these repetitive storage accesses to read instructions which were just recently accessed, small, fast secondary memories have been used to temporarily store the first instruction in a program loop as well as the address of the second instruction in the loop. In addition, look-ahead buffers for storing instructions prior to their use and look-behind or look-aside buffers for storing instructions which have been executed in anticipation of their further use have also been employed.
Until the present invention, however, there has been no apparatus for providing for both the look-aside storage of loop instructions and the efficient control of when and how the look-aside buffer is used to enhance processor performance. With prior systems and techniques tasks such as effectively invalidating the contents of the look-aside buffer when a program loop is exited, when an update or alteration of the loops contents is made in storage, or when virtual to real address mapping changes are made often degraded processor performance or resulted in errors due to the execution of invalid instructions.
The instruction fetch look-aside buffer of the present invention is integrated with an efficient mode control apparatus to significantly enhance processor performance by reducing storage contention and effectively managing the use of the look-aside buffer.
The present invention employs a look-aside buffer for storing a predetermined maximum number of instructions that may be executed in the future. In the normal mode of operation, instructions to be executed are fetched from storage into one or more instruction buffers. These instructions are then latched into an instruction register for decoding and processing. As these instructions are latched into the instruction register they are also simultaneously fed into the look-aside buffer. Low order instruction address bits are also copies into an associativity array. The array locations are addressed by a pointer register which is incremented for successive instructions. In this way a predetermined number of previously executed instructions will have been stored for possible future use. When a branch instruction is detected in the instruction counter, the target address of this branch instruction is latched into a target register. The previous contents of the target register were the target address of the immediately previous branch instruction. This previous target address is shifted from the target register into another register when a new target address is latched into the target register. Moreover, when a branch instruction is detected in the instruction counter, the source address associated with that branch instruction is stored in a source register.
Before the loop mode of operation will be entered and the normal mode exited two conditions must be met. First, the new target address and the previous target address must be equal (i.e., the same location is being branched to twice). This determination is made by comparing the contents of the target register with the contents of the register housing the previous target address.
The second condition which must be met before loop mode is entered is that the source address associated with the branch instruction detected must be within a predetermined range of the target address. This determination is made by subtracting the previous target address from the source address. The higher order bits of the resulting difference (i.e., the size of the loop) are tested for zeroes to ensure the loop size is within the predetermined allowable maximum.
After loop mode is entered instructions cease to be fetched from storage. Instead the current instruction address is compared with the partial instruction addresses which were stored in the look-aside buffer during normal mode operations. If a match is discovered, the instruction is extracted from the look-aside buffer and latched directly into the instruction register. If no match is discovered, loop mode is exited and normal operations are resumed.
Loop mode can also be exited when the instruction loop has been passed through. This is determined by comparing the current instruction address with the source address associated with the branch instruction stored in the source register. If the current instruction address is greater than or equal to the source address, loop mode is exited and normal mode operations are resumed.
In the event that loop mode is exited, an update or alteration of the contents of the look-aside buffer is made in storage, or virtual to real address mapping changes are made, the contents of the look-aside buffer will be invalidated. Such invalidation will result in no match between the current instruction and the contents of the look-aside buffer.
The present invention has several significant advantages over prior instruction fetch apparatuses and methods. The present invention provides for invalidating the contents of the look-aside buffer to prevent errors due to the execution of invalid instructions. The present invention also reduces storage contention while providing efficient management to entry to and exit from loop mode operations. The present invention also significantly enhances processor performance by the integration of a look-aside buffer with a control system capable of exploiting the redundancy inherent in the employment of program loops.
FIG. 1 is an illustration of a typical program loop with a branch instruction and its associated target address and source address.
FIG. 2 is one embodiment of the instruction fetch look-aside buffer circuitry of the present invention.
FIG. 3 is another embodiment of the present invention.
FIG. 4 is still another embodiment of the present invention.
Referring to FIG. 1, a potential program loop 13 is created through the use of a branch instruction 10. Branch instruction 10 has an address 14 and a target address 11. Target address 11 is the address of the next instruction to be executed after the condition required to branch (e.g., cond. low) is met. A source address 12 is also associated with branch instruction 10. If the condition required to branch set forth in branch instruction 10 is not met, program loop 13 is exited. Source address 12 is the address of the instruction following branch instruction 10. Source address 12 is thus the address of the instruction to be executed after program loop 13 is exited due to an unsuccessful branch (i.e., branch condition not met).
Referring now to FIG. 2, an instruction counter 20 is employed to store the address of the current instruction. Instruction counter 20 is updated by the central processor (not shown) so that instruction counter 20 contains the address of the current instruction or immediately after update contains the address of the next instruction.
Instruction counter 20 detects when the current address stored in instruction counter 20 is a branch instruction address. The target address of this current branch instruction is then latched into new target address register 21. As the current address is latched into register 21, the prior contents of register 21 are shifted into old target address register 24. These prior contents of register 21 are the target address of the immediately previous branch instruction. Immediately after instruction counter 20 is incremented the source address (i.e., branch instruction address plus branch instruction length) associated with the current branch instruction is latched into source address register 22.
In order to enter loop mode operations, two conditions must be met: (1) there must be branching to the same location twice in a row; and (2) the address of the current branch instruction must be within a predetermined range of the target address of the immediately previous branch instruction. The comparator 25 is used to determine if the first condition is met by comparing the contents of register 21 with the contents of register 24. The subtractor 26 and zero detect 27 determine if the second condition is met by subtracting the contents of register 24 from the contents of register 22. This difference represents the size of the loop associated with the current branch instruction. The higher order bits of this loop size are tested by zero detect 27 for zeroes. This testing ensures that the loop size is within the predetermined allowable range and that the low-order instruction address bits will be unique. Zero detect 27, source address register 22, comparator 23, subtractor 26 and AND gate 29 can be eliminated if all address bits (i.e., high-order as well as low-order) are stored in associativity array 34.
The predetermined maximum allowable range between the address of the current branch instruction and the target address of the previous instruction is chosen to maximize overall processor performance. Clearly this range is directly related to the depth of the instruction array 33 and associativity array 34 and to the lengths of instructions.
When the two conditions necessary to enter loop mode are met, latch 28 is set by the ouptut of AND gate 29. The output of latch 28 is routed to controls (not shown) which cause the data processing system and the look-aside buffer to exit normal mode operations and enter loop mode operations.
During normal mode operations, instructions to be executed are prefetched from storage 30 into instruction buffers 31. These instructions are then latched into instruction register 32 for decoding and further processing. As these instructions are latched into register 32 they are also fed into instruction array 33. No processor time is lost since array 33 is loaded in parallel with the loading of instruction register 32. In addition, the low-order address bits of each instruction fed into array 33 are fed from instruction counter 20 into associativity array 34. An incrementing pointer 37 addresses the next available row in both instruction array 33 and associativity array 34. In this manner the last K instructions and their addresses are stored in the look-aside buffer (K being the length of instruction array 33 and likewise the maximum number of instructions which can be simultaneously stored in array 33).
Valid bit flags 35 correspond to each address stored within array 34. Flags 35 allow all or some of the instructions stored in the look-aside buffer to be invalidated upon the occurrence of certain conditions or events. For example, all the instructions can be invalidated to prevent them from being interpreted as valid usable entries (i.e., a "hit") when: (1) loop mode is exited, (2) an operation result is stored in storage 30 within the current range of instructions stored in the look-aside buffer and/or (3) virtual to real address mapping is changed. Without flags 35 an instruction may be erroneously executed.
During loop mode operations instructions are not prefetched into buffers 31 and instead the current instruction low-order address bits stored in instruction counter 20 are simultaneously compared with the low-order address bit entries stored in associativity array 34 by comparator 38. If a "hit" or match occurs (i.e., the current instruction is stored in array 33) the current instruction is read out of array 33 directly into register 32 in response to the read signal generated by logic 36. In this fashion storage contention can be reduced by eliminating redundant accesses to storage. Repeated loop instructions are stored in the look-aside buffer during normal mode and read directly out of the look-aside buffer without a storage access during loop mode.
Loop mode is exited and normal mode resumed when the program loop is passed through. This is detected by comparator 23. Comparator 23 resets latch 28 and causes an exit from loop mode and entry of normal mode when the current instruction address is greater than the source address associated with the current (i.e., new) branch instruction. Put another way, loop mode is exited when the source address of the current branch instruction is less than or equal to the current instruction address.
Referring now to FIG. 3, loop mode can be exited upon the occurrence of a "miss". That is, instead of exiting loop mode when the source address of the current branch instruction is less than or equal to the current instruction address as shown in FIG. 2, loop mode is exited when the current instruction address is not stored in the look-aside buffer. This embodiment of the present invention relies on a miss signal generated by comparator 38 to reset latch 28 and thereby effect a return to normal mode operations. This reset technique ensures that loop mode operations continue for as long as the current instruction can be found in array 33.
Referring now to FIG. 4, the reset to normal mode techniques discussed above in conjunction with FIGS. 2 and 3 can be combined. In this embodiment of the present invention, the miss signal output of comparator 38 and the output of comparator 23 are fed to OR gate 39. Thus, loop mode is exited and normal mode resumed when the current instruction is not stored in array 33 or when the current instruction address is greater than or equal to the source address associated with the current branch instruction.
Whereas I have illustrated and described the preferred embodiments of my invention, it is understood that I do not limit myself to the precise constructions disclosed herein. I expressly reserve the right to all changes and modifications coming within the scope of the invention as defined in the appended claims.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US3593306 *||Jul 25, 1969||Jul 13, 1971||Bell Telephone Labor Inc||Apparatus for reducing memory fetches in program loops|
|US3928857 *||Aug 30, 1973||Dec 23, 1975||Ibm||Instruction fetch apparatus with combined look-ahead and look-behind capability|
|US4053948 *||Jun 21, 1976||Oct 11, 1977||Ibm Corporation||Look aside array invalidation mechanism|
|US4068303 *||Mar 22, 1976||Jan 10, 1978||Hitachi, Ltd.||Address translation managing system with translation pair purging|
|US4145738 *||May 31, 1977||Mar 20, 1979||Fujitsu Limited||Plural virtual address space processing system|
|US4245302 *||Oct 10, 1978||Jan 13, 1981||Magnuson Computer Systems, Inc.||Computer and method for executing target instructions|
|US4400769 *||Feb 20, 1980||Aug 23, 1983||Fujitsu Limited||Virtual machine system|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US4755935 *||Jan 27, 1986||Jul 5, 1988||Schlumberger Technology Corporation||Prefetch memory system having next-instruction buffer which stores target tracks of jumps prior to CPU access of instruction|
|US4882701 *||Sep 23, 1988||Nov 21, 1989||Nec Corporation||Lookahead program loop controller with register and memory for storing number of loop times for branch on count instructions|
|US4912635 *||Feb 1, 1988||Mar 27, 1990||Hitachi, Ltd.||System for reexecuting branch instruction without fetching by storing target instruction control information|
|US4937738 *||Aug 23, 1985||Jun 26, 1990||Hitachi, Ltd.||Data processing system which selectively bypasses a cache memory in fetching information based upon bit information of an instruction|
|US4974154 *||Oct 6, 1987||Nov 27, 1990||Mitsubishi Denki Kaisha||Computer with instruction prefetch queue retreat unit|
|US4998197 *||Jul 6, 1988||Mar 5, 1991||Hitachi, Ltd.||Data processor with fast break in program execution by selectively processing either external control signal or external interrupt|
|US5006544 *||Oct 12, 1989||Apr 9, 1991||Glaxo Group Limited||Imidazole derivatives and pharmaceutical use thereof|
|US5113370 *||Dec 23, 1988||May 12, 1992||Hitachi, Ltd.||Instruction buffer control system using buffer partitions and selective instruction replacement for processing large instruction loops|
|US5113515 *||Feb 3, 1989||May 12, 1992||Digital Equipment Corporation||Virtual instruction cache system using length responsive decoded instruction shifting and merging with prefetch buffer outputs to fill instruction buffer|
|US5226138 *||Nov 27, 1990||Jul 6, 1993||Sun Microsystems, Inc.||Method for selectively transferring data instructions to a cache memory|
|US5257360 *||Mar 23, 1990||Oct 26, 1993||Advanced Micro Devices,Inc.||Re-configurable block length cache|
|US5285527 *||Nov 29, 1990||Feb 8, 1994||Northern Telecom Limited||Predictive historical cache memory|
|US5440749 *||Aug 3, 1989||Aug 8, 1995||Nanotronics Corporation||High performance, low cost microprocessor architecture|
|US5524223 *||Jun 12, 1995||Jun 4, 1996||Motorola, Inc.||Instruction accelerator for processing loop instructions with address generator using multiple stored increment values|
|US5530890 *||Jun 7, 1995||Jun 25, 1996||Nanotronics Corporation||High performance, low cost microprocessor|
|US5579493 *||Dec 8, 1994||Nov 26, 1996||Hitachi, Ltd.||System with loop buffer and repeat control circuit having stack for storing control information|
|US5675777 *||May 22, 1995||Oct 7, 1997||Hipercore, Inc.||Architecture for minimal instruction set computing system|
|US5701435 *||May 19, 1993||Dec 23, 1997||Philips Electronics North America Corporation||Instruction cache system for implementing programs having non-sequential instructions and method of implementing same|
|US5838896 *||Dec 30, 1996||Nov 17, 1998||Lg Semicon Co., Ltd.||Central processing unit for preventing program malfunction|
|US6085315 *||Sep 12, 1997||Jul 4, 2000||Siemens Aktiengesellschaft||Data processing device with loop pipeline|
|US6125440 *||May 21, 1998||Sep 26, 2000||Tellabs Operations, Inc.||Storing executing instruction sequence for re-execution upon backward branch to reduce power consuming memory fetch|
|US6321312||Jul 1, 1998||Nov 20, 2001||International Business Machines Corporation||System and method for controlling peripheral device memory access in a data processing system|
|US6505295 *||Feb 17, 1997||Jan 7, 2003||Hitachi, Ltd.||Data processor|
|US6552567||Sep 28, 2001||Apr 22, 2003||Microchip Technology Incorporated||Functional pathway configuration at a system/IC interface|
|US6552625||Jun 1, 2001||Apr 22, 2003||Microchip Technology Inc.||Processor with pulse width modulation generator with fault input prioritization|
|US6601160||Jun 1, 2001||Jul 29, 2003||Microchip Technology Incorporated||Dynamically reconfigurable data space|
|US6604169||Jun 1, 2001||Aug 5, 2003||Microchip Technology Incorporated||Modulo addressing based on absolute offset|
|US6728856||Jun 1, 2001||Apr 27, 2004||Microchip Technology Incorporated||Modified Harvard architecture processor having program memory space mapped to data memory space|
|US6934728||Jun 1, 2001||Aug 23, 2005||Microchip Technology Incorporated||Euclidean distance instructions|
|US6937084||Jun 1, 2001||Aug 30, 2005||Microchip Technology Incorporated||Processor with dual-deadtime pulse width modulation generator|
|US6952711||Jun 1, 2001||Oct 4, 2005||Microchip Technology Incorporated||Maximally negative signed fractional number multiplication|
|US6963965||Nov 15, 2000||Nov 8, 2005||Texas Instruments Incorporated||Instruction-programmable processor with instruction loop cache|
|US6975679||Jun 1, 2001||Dec 13, 2005||Microchip Technology Incorporated||Configuration fuses for setting PWM options|
|US6976158||Jun 1, 2001||Dec 13, 2005||Microchip Technology Incorporated||Repeat instruction with interrupt|
|US6985986||Jun 1, 2001||Jan 10, 2006||Microchip Technology Incorporated||Variable cycle interrupt disabling|
|US7003543||Jun 1, 2001||Feb 21, 2006||Microchip Technology Incorporated||Sticky z bit|
|US7007172||Jun 1, 2001||Feb 28, 2006||Microchip Technology Incorporated||Modified Harvard architecture processor having data memory space mapped to program memory space with erroneous execution protection|
|US7020788||Jun 1, 2001||Mar 28, 2006||Microchip Technology Incorporated||Reduced power option|
|US7080240||Nov 25, 2002||Jul 18, 2006||Hitachi, Ltd.||Data processing apparatus|
|US7093112||Sep 17, 2001||Aug 15, 2006||Infineon Technologies Ag||Method and apparatus for caching short program loops within an instruction FIFO|
|US7233166||Aug 27, 2003||Jun 19, 2007||Intel Corporation||Bus state keepers|
|US7243372||May 23, 2005||Jul 10, 2007||Microchip Technology Incorporated||Modified Harvard architecture processor having data memory space mapped to program memory space with erroneous execution protection|
|US7287148 *||Aug 28, 2003||Oct 23, 2007||Intel Corporation||Unified shared pipeline allowing deactivation of RISC/DSP units for power saving|
|US7302557 *||Dec 1, 2000||Nov 27, 2007||Impact Technologies, Inc.||Method and apparatus for modulo scheduled loop execution in a processor architecture|
|US7318115||Aug 27, 2003||Jan 8, 2008||Intel Corporation||IC memory complex with controller for clusters of memory blocks I/O multiplexed using collar logic|
|US7346760 *||May 16, 2001||Mar 18, 2008||Renesas Technology Corp.||Data processing apparatus of high speed process using memory of low speed and low power consumption|
|US7467178||Jun 1, 2001||Dec 16, 2008||Microchip Technology Incorporated||Dual mode arithmetic saturation processing|
|US7694109||Dec 4, 2007||Apr 6, 2010||Renesas Technology Corp.||Data processing apparatus of high speed process using memory of low speed and low power consumption|
|US7725696||Oct 4, 2007||May 25, 2010||Hwu Wen-Mei W||Method and apparatus for modulo scheduled loop execution in a processor architecture|
|US7822949 *||May 9, 2005||Oct 26, 2010||Panasonic Corporation||Command supply device that supplies a command read out from a main memory to a central processing unit|
|US7966480||Dec 20, 2004||Jun 21, 2011||Microchip Technology Incorporated||Register pointer trap to prevent errors due to an invalid pointer value in a register|
|US7996671||Nov 12, 2004||Aug 9, 2011||Bluerisc Inc.||Security of program executables and microprocessors based on compiler-architecture interaction|
|US8607209||Jan 18, 2005||Dec 10, 2013||Bluerisc Inc.||Energy-focused compiler-assisted branch prediction|
|US9069938||Nov 27, 2012||Jun 30, 2015||Bluerisc, Inc.||Securing microprocessors against information leakage and physical tampering|
|US9235393||Feb 27, 2014||Jan 12, 2016||Iii Holdings 2, Llc||Statically speculative compilation and execution|
|US9244689||Dec 5, 2013||Jan 26, 2016||Iii Holdings 2, Llc||Energy-focused compiler-assisted branch prediction|
|US9411043 *||Nov 26, 2013||Aug 9, 2016||Fujitsu Limited||Radar apparatus and computer-readable storage medium|
|US9569186||Mar 14, 2014||Feb 14, 2017||Iii Holdings 2, Llc||Energy-focused re-compilation of executables and hardware mechanisms based on compiler-architecture interaction and compiler-inserted control|
|US9582650||Nov 21, 2012||Feb 28, 2017||Bluerisc, Inc.||Security of program executables and microprocessors based on compiler-architecture interaction|
|US20020026545 *||May 16, 2001||Feb 28, 2002||Mitsubishi Denki Kabushiki Kaisha||Data processing apparatus of high speed process using memory of low speed and low power consumption|
|US20020073302 *||Sep 17, 2001||Jun 13, 2002||Steffen Sonnekalb||Method and apparatus for caching short program loops within an instruction FIFO|
|US20030074546 *||Nov 25, 2002||Apr 17, 2003||Hitachi, Ltd.||Data processing apparatus|
|US20040039952 *||Aug 27, 2003||Feb 26, 2004||Ruban Kanapathippillai||Method and apparatus for power reduction in a digital signal processor integrated circuit|
|US20040078608 *||Aug 29, 2003||Apr 22, 2004||Ruban Kanapathippillai||Method and apparatus for power reduction in a digital signal processor integrated circuit|
|US20040078612 *||Aug 21, 2003||Apr 22, 2004||Ruban Kanapathippillai||Methods for power reduction in a digital signal processor integrated circuit|
|US20040236896 *||Aug 27, 2003||Nov 25, 2004||Ruban Kanapathippillai||Memory with memory clusters for power reduction in an integrated circuit|
|US20050076194 *||Aug 28, 2003||Apr 7, 2005||Ruban Kanapathippillai||Unified instruction pipeline for power reduction in a digital signal processor integrated circuit|
|US20050120348 *||Nov 16, 2004||Jun 2, 2005||Infineon Technologies Ag||Method of determining information about the processes which run in a program-controlled unit during the execution of a program by the program-controlled unit|
|US20060242394 *||Aug 26, 2005||Oct 26, 2006||Kabushiki Kaisha Toshiba||Processor and processor instruction buffer operating method|
|US20080086621 *||May 9, 2005||Apr 10, 2008||Matsushita Electric Industrial Co., Ltd.||Command Supply Device|
|US20080133887 *||Dec 4, 2007||Jun 5, 2008||Renesas Technology Corp.||Data processing apparatus of high speed process using memory of low speed and low power consumption|
|US20090055589 *||Aug 24, 2007||Feb 26, 2009||Arm Limited||Cache memory system for a data processing apparatus|
|US20140215185 *||Jan 29, 2013||Jul 31, 2014||Atmel Norway||Fetching instructions of a loop routine|
|US20140266855 *||Nov 26, 2013||Sep 18, 2014||Fujitsu Limited||Radar apparatus and computer-readable storage medium|
|EP0840208A2 *||Oct 31, 1997||May 6, 1998||Texas Instruments Incorporated||Improvements in or relating to microprocessors|
|EP0840208A3 *||Oct 31, 1997||Apr 21, 1999||Texas Instruments Incorporated||Improvements in or relating to microprocessors|
|WO1987004543A1 *||Jan 26, 1987||Jul 30, 1987||Schlumberger Technology Corporation||Instruction memory system|
|WO1999060460A2 *||May 21, 1999||Nov 25, 1999||Tellabs Operations, Inc.||Storing instructions in low power shift register buffer for fetching loop instructions|
|WO1999060460A3 *||May 21, 1999||Feb 10, 2000||Tellabs Operations Inc||Storing instructions in low power shift register buffer for fetching loop instructions|
|WO2000055724A1 *||Mar 2, 2000||Sep 21, 2000||Infineon Technologies Ag||Caching of short program loops in an instruction fifo|
|U.S. Classification||712/241, 711/125, 712/207, 712/E09.058|
|International Classification||G06F9/32, G06F9/38|
|Mar 7, 1983||AS||Assignment|
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, ARMON
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST.;ASSIGNOR:GEORGE, STEVEN L.;REEL/FRAME:004106/0596
Effective date: 19830302
|Jan 18, 1990||FPAY||Fee payment|
Year of fee payment: 4
|Jul 12, 1994||REMI||Maintenance fee reminder mailed|
|Aug 25, 1994||FPAY||Fee payment|
Year of fee payment: 8
|Aug 25, 1994||SULP||Surcharge for late payment|
|Jun 23, 1998||REMI||Maintenance fee reminder mailed|
|Nov 29, 1998||LAPS||Lapse for failure to pay maintenance fees|
|Feb 9, 1999||FP||Expired due to failure to pay maintenance fee|
Effective date: 19981202