Patents by Inventor Danny R. Sutherland
Danny R. Sutherland has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 6832301Abstract: In a computing system having swappable and non-swappable address spaces, wherein the computing system includes an operating system that includes a Real Storage Manager (RSM), a Systems Resource Manager (SRM) and a Region Control Task (RCT), a method for recovering swappable fixed non-preferred memory is provided which includes receiving a request from the operating system to configure an area of real memory to create an intercepted swappable address space, wherein the intercepted swappable address space includes a flagged fixed frame element identified for configuration, examining the intercepted swappable address space so as to determine if the intercepted swappable address space will remain swappable, requesting the SRM to coordinate the swapping process, quiescing the intercepted address space, generating a first return code responsive to the intercepted swappable address space remaining swappable, communicating the first return code to the RCT so as to cause the RCT to respond to the first return code, inType: GrantFiled: September 11, 2001Date of Patent: December 14, 2004Assignee: International Business Machines CorporationInventors: Roman A. Bobak, Charles E. Mari, Harris Morgenstern, Jim H. Mulder, Robert R. Rogers, Danny R. Sutherland, Peter B. Yocom
-
Patent number: 6829693Abstract: In a computing system implementing a virtual memory system having real memory storage frames for storing virtual pages of data and an auxiliary storage system comprising auxiliary storage slots for storing copies of corresponding virtual pages provided in real storage frames, a system and method for freeing auxiliary storage slots to enable further copying of pages thereto.Type: GrantFiled: February 28, 2001Date of Patent: December 7, 2004Assignee: International Business Machines CorporationInventors: Greg A. Dyck, Harris M. Morgenstern, Danny R. Sutherland, Wendy L. Wang
-
Patent number: 6807588Abstract: A sectioned ordered queue in an information handling system comprises a plurality of queue sections arranged in order from a first queue section to a last queue section. Each queue section contains one or more queue entries that correspond to available ranges of real storage locations and are arranged in order from a first queue entry to a last queue entry. Each queue section and each queue entry in the queue sections having a weight factor defined for it. Each queue entry has an effective weight factor formed by combining the weight factor defined for the queue section with the weight factor defined for the queue entry. A new entry is added to the last queue section to indicate a newly available corresponding storage location, and one or more queue entries are deleted from the first section of the queue to indicate that the corresponding storage locations are no longer available.Type: GrantFiled: February 27, 2002Date of Patent: October 19, 2004Assignee: International Business Machines CorporationInventors: Tri M. Hoang, Tracy D. Butler, Danny R. Sutherland, David B. Emmes, Mariama Ndoye, Elpida Tzortzatos
-
Patent number: 6622229Abstract: An exemplary embodiment of the invention is a virtual memory structure having a first virtual memory space and a virtual page frame table space. The first virtual memory space includes at least one private area and at least one common area. The virtual page frame table space is separate from the first virtual memory space. The virtual page frame table space includes at least one page frame table entry representing a frame of real memory.Type: GrantFiled: February 28, 2001Date of Patent: September 16, 2003Assignee: International Business Machines CorporationInventors: Harris M. Morgenstern, Greg A. Dyck, Danny R. Sutherland
-
Publication number: 20030163644Abstract: A sectioned ordered queue in an information handling system comprises a plurality of queue sections arranged in order from a first queue section to a last queue section. Each queue section contains one or more queue entries that correspond to available ranges of real storage locations and are arranged in order from a first queue entry to a last queue entry. Each queue section and each queue entry in the queue sections having a weight factor defined for it. Each queue entry has an effective weight factor formed by combining the weight factor defined for the queue section with the weight factor defined for the queue entry. A new entry is added to the last queue section to indicate a newly available corresponding storage location, and one or more queue entries are deleted from the first section of the queue to indicate that the corresponding storage locations are no longer available.Type: ApplicationFiled: February 27, 2002Publication date: August 28, 2003Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Tri M. Hoang, Tracy D. Butler, Danny R. Sutherland, David B. Emmes, Mariama Ndoye, Elpida Tzortzatos
-
Patent number: 6574706Abstract: In a computing system implementing a virtual memory system having real memory storage frames for storing virtual pages of data and an auxiliary storage system comprising auxiliary storage slots for storing copies of corresponding virtual pages, wherein I/O mechanisms are employed for effectuating transfer of data between auxiliary and real storage, a system and method for managing storage of unvirtualized dataset pages destined for auxiliary storage in a manner so to avoid I/O operations when assigning or moving VIO dataset data. The system and method is used to allow faster access to VIO data set pages by allowing that data to be kept in real storage.Type: GrantFiled: February 28, 2001Date of Patent: June 3, 2003Assignee: International Business Machines CorporationInventors: Danny R. Sutherland, Elpida Tzortzatos, Peter B. Yocom
-
Patent number: 6574718Abstract: A system and method for eliminating excessive spin conditions on systems implementing a LRU algorithm. This is achieved by limiting the amount of time a LRU task is allowed to run in any one invocation. If this time limit is exceeded before the LRU task has completed its processing, the LRU task will reschedule itself to run after a short time interval, record which frames have been processed so far, release its serialization resources, and exit to open a window of enablement. During this window, other processes that were spinning for the serialization resources can have a chance to run. When the LRU task runs again it will re-obtain the serialization resources and continue processing frames that were not previously processed. The above process will be repeated until all the appropriate frames in the system are in LRU order.Type: GrantFiled: February 28, 2001Date of Patent: June 3, 2003Assignee: International Business Machines CorporationInventors: Danny R. Sutherland, Elpida Tzortzatos, Peter B. Yocum
-
Publication number: 20030051189Abstract: In a computing system having swappable and non-swappable address spaces, wherein the computing system includes an operating system that includes a Real Storage Manager (RSM), a Systems Resource Manager (SRM) and a Region Control Task (RCT), a method for recovering swappable fixed non-preferred memory is provided which includes receiving a request from the operating system to configure an area of real memory to create an intercepted swappable address space, wherein the intercepted swappable address space includes a flagged fixed frame element identified for configuration, examining the intercepted swappable address space so as to determine if the intercepted swappable address space will remain swappable, requesting the SRM to coordinate the swapping process, quiescing the intercepted address space, generating a first return code responsive to the intercepted swappable address space remaining swappable, communicating the first return code to the RCT so as to cause the RCT to respond to the first return code, inType: ApplicationFiled: September 11, 2001Publication date: March 13, 2003Inventors: Roman A. Bobak, Charles E. Mari, Harris Morgenstern, Jim H. Mulder, Robert R. Rogers, Danny R. Sutherland, Peter B. Yocom
-
Publication number: 20020120808Abstract: In a computing system implementing a virtual memory system having real memory storage frames for storing virtual pages of data and an auxiliary storage system comprising auxiliary storage slots for storing copies of corresponding virtual pages provided in real storage frames, a system and method for freeing auxiliary storage slots to enable further copying of pages thereto.Type: ApplicationFiled: February 28, 2001Publication date: August 29, 2002Inventors: Greg A. Dyck, Harris M. Morgenstern, Danny R. Sutherland, Wendy L. Wang
-
Publication number: 20020120807Abstract: In a computing system implementing a virtual memory system having real memory storage frames for storing virtual pages of data and an auxiliary storage system comprising auxiliary storage slots for storing copies of corresponding virtual pages, wherein I/O mechanisms are employed for effectuating transfer of data between auxiliary and real storage, a system and method for managing storage of unvirtualized dataset pages destined for auxiliary storage in a manner so to avoid I/O operations when assigning or moving VIO dataset data. The system and method is used to allow faster access to VIO data set pages by allowing that data to be kept in real storage.Type: ApplicationFiled: February 28, 2001Publication date: August 29, 2002Inventors: Danny R. Sutherland, Elpida Tzortzatos, Peter B. Yocom
-
Publication number: 20020120821Abstract: A system and method for eliminating excessive spin conditions on systems implementing a LRU algorithm. This is achieved by limiting the amount of time a LRU task is allowed to run in any one invocation. If this time limit is exceeded before the LRU task has completed its processing, the LRU task will reschedule itself to run after a short time interval, record which frames have been processed so far, release its serialization resources, and exit to open a window of enablement. During this window, other processes that were spinning for the serialization resources can have a chance to run. When the LRU task runs again it will re-obtain the serialization resources and continue processing frames that were not previously processed. The above process will be repeated until all the appropriate frames in the system are in LRU order.Type: ApplicationFiled: February 28, 2001Publication date: August 29, 2002Inventors: Danny R. Sutherland, Elpida Tzortzatos, Peter B. Yocom
-
Publication number: 20020120827Abstract: An exemplary embodiment of the invention is a virtual memory structure having a first virtual memory space and a virtual page frame table space. The first virtual memory space includes at least one private area and at least one common area. The virtual page frame table space is separate from the first virtual memory space. The virtual page frame table space includes at least one page frame table entry representing a frame of real memory.Type: ApplicationFiled: February 28, 2001Publication date: August 29, 2002Applicant: International Business Machines CorporationInventors: Harris M. Morgenstern, Greg A. Dyck, Danny R. Sutherland
-
Patent number: 5628023Abstract: A virtual storage computer system having token controlled storage protection. The computer system includes a processor, a real storage, and a virtual storage containing a user space and a system space. A virtual storage area in the user space provides a protected view of one or more pages of memory located in the real storage. A virtual storage area in the system space provides a token-accessible view of the corresponding pages of memory. To protect the pages of memory, a user program first requests that token controlled protection be provided via the virtual address in the user space and that a corresponding user token be returned by the processor. The user program stores the user token for later use when accessing the protected pages. When the user program requests access to the protected pages, the processor matches the user token with a system token to obtain a token-accessible view in the system space of the protected pages.Type: GrantFiled: December 27, 1994Date of Patent: May 6, 1997Assignee: International Business Machines CorporationInventors: Barbara J. Bryant, Glen E. Garrison, Danny R. Sutherland, Kenneth G. Rubsam
-
Patent number: 5479631Abstract: A data processing system includes central storage where access to data is by central storage addresses. Instructions normally include a logical or virtual address which is translated to a real central storage address using dynamic address translation (DAT) with or without an access register (AR) translation mechanism. When in AR mode, and with DAT on, addressing of instructions or data in central storage can be effected by specifying real central storage addresses and eliminate the DAT and AR translating process.Type: GrantFiled: January 23, 1995Date of Patent: December 26, 1995Assignee: International Business Machines CorporationInventors: David C. Manners, Eugene S. Schulze, Danny R. Sutherland
-
Patent number: 5394539Abstract: A data processing system, having virtual addressing capability, has a real storage manager to associate virtual storage locations with real storage by accessing page tables to determine the locations of "backed" virtual storage pages in central, expanded, or auxiliary storage. The real storage manager accepts requests to copy ranges of virtual storage from one virtual storage range to another, and, in so doing, uses the page tables to effectively perform the copying by reassigning backed pages from the source range to the target range. Having been reassigned to the target range, the backed pages are artificially aged by increasing the unreferenced interval count (UIC), so that the backed pages in the target range will be likely candidates for page stealing.Type: GrantFiled: July 15, 1994Date of Patent: February 28, 1995Assignee: International Business Machines CorporationInventors: Deborah E. Neuhard, Jeffrey M. Nick, Danny R. Sutherland