Method of executing a series of computer code operations that must be completed without interruption by a page fault during execution
US5617558A · kind A · utility
Assignee
Inventor
Key dates
| Filing date | Jun 6, 1995 |
| Grant date | Apr 1, 1997 |
| Priority date | — |
| Expiry date | Jun 6, 2015 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F11/141
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
The time lost in unnecessarily checking for the presence of all memory references required by a special section of code in an operating system before the program is run and which dynamically protects the program requiring the memory reference from crashing if the memory reference is not presently available is substantially reduced. The method assumes that all memory references are available and begins running the special section of code. If a request is made for information not in assigned memory storage, the data processing system interrupts the running of the special section of code and undoes everything the special section of code has done prior to the interrupt. The requested memory reference is then located in storage. The information is retrieved and written into assigned memory. The special section of code is then restarted and supplied the needed information. It has been found that it takes much less time to assume the memory references will succeed and occasionally interrupt, erase and restart, than to make a time-consuming preliminary check for all memory references.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.