Patents by Inventor David A. Egolf
David A. Egolf 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).
-
Publication number: 20200069289Abstract: An ultrasound imaging system for imaging a sample has an array of ultrasound transducers, a transmitter for driving the array of ultrasound transducers, a receiver that receives ultrasonic reflections from the sample, and a processor that generates an image of the sample based on a set of sub-image capture events, each sub-image capture event comprising received ultrasonic reflections. For each sub-image capture event, the transmitter transmits a sequence of transmit events from the ultrasound transducers. Each transmit event comprises a plurality of distinct waveforms directed toward separate focal zones on the sample. The sequence of transmit events comprises a sequence of distinct waveforms directed toward each focal zone. The cross-correlation level of the distinct waveforms in each transmit event is low, and the sequence of distinct waveforms is complementary.Type: ApplicationFiled: September 5, 2018Publication date: March 5, 2020Inventors: Roger ZEMP, Tarek KADDOURA, David EGOLF
-
Publication number: 20140137122Abstract: A method is disclosed for reducing peak power usage in a large computer system with multiple nodes by identifying jobs which can be scheduled to run at reduced frequency in order to reduce total power usage during certain time periods. The backfill scheduler of the computer system's operating system performs steps providing for selected jobs on selected nodes of the computer system to be run at reduced frequency such that those jobs are partially processed during previously underutilized holes in the computer system schedule in order to reduce overall peak power during a period of processing.Type: ApplicationFiled: November 13, 2012Publication date: May 15, 2014Inventors: David A. Egolf, Russell W. Guenthner
-
Patent number: 6895529Abstract: A data processing system participating in two-phase transaction processing operations which, when a system failure occurs while one or more transactions are in process, can successfully rebuild “in-doubt” states even when another system failure occurs during an attempt to effect the rebuild. The system includes a file management system having exclusive access to reserved locations in the memory for reading and writing meta-data therein and physical file access logic selectively coupling the memory and the database access application, the physical file access logic incorporating file protections which are controlled by the file management system; such that, in the event of a failure, the local state of the transaction can be faithfully rebuilt after restart by accessing the meta-data.Type: GrantFiled: February 13, 2002Date of Patent: May 17, 2005Assignee: Bull HN Information Systems, Inc.Inventors: David A. Egolf, Eric W. Hardesty
-
Patent number: 6763328Abstract: In an emulation of a multiprocessor Target computer system on a Host computer system, Host virtual memory addresses are mapped and utilized as Target virtual memory addresses. Target virtual memory control tables are setup accordingly. Each Target processor is mapped to a Host thread. When a page fault is detected by the Host operating system, it is checked to see if it belongs to the Target system, and if it does, the executing thread transfers its processor identity to a free thread, and then completes processing the page fault. Upon completion, it marks the processes that had been executing on that thread and processor as available for execution, then blocks until activated. Another thread, upon dispatching that process, wakes up the blocked thread and transfers its processor identity to that thread, which continues to execute the interrupted process.Type: GrantFiled: June 15, 2000Date of Patent: July 13, 2004Assignee: Bull HN Information Systems Inc.Inventors: David A. Egolf, Stefan R. Bohult, Bruce A. Noyes, Chad Farmer
-
Patent number: 6665699Abstract: A processor in a data processing system having multiple cache memories performs cache memory or processor module affinity dispatchin. Processes awaiting dispatch are stored in prioritized queues. Each queue has a priority chain, and a chain for each cache memory or processor module, with each chain containing processes ready for dispatch. The dispatcher checks the queues in priority order, starting with the priority chain for a queue, followed by the chain corresponding to the cache memory or processor module that the process last executed upon, followed by chains corresponding to other cache memories or processor modules.Type: GrantFiled: September 23, 1999Date of Patent: December 16, 2003Assignee: Bull HN Information Systems Inc.Inventors: Jesse D. Hunter, Michel Brown, David A. Egolf, Jon Keil, Michael Meduna
-
Publication number: 20030154423Abstract: A data processing system participating in two-phase transaction processing operations which, when a system failure occurs while one or more transactions are in process, can successfully rebuild “in-doubt” states even when another system failure occurs during an attempt to effect the rebuild. The system includes a file management system having exclusive access to reserved locations in the memory for reading and writing meta-data therein and physical file access logic selectively coupling the memory and the database access application, the physical file access logic incorporating file protections which are controlled by the file management system; such that, in the event of a failure, the local state of the transaction can be faithfully rebuilt after restart by accessing the meta-data.Type: ApplicationFiled: February 13, 2002Publication date: August 14, 2003Applicant: Bull HN Information Systems Inc.Inventors: David A. Egolf, Eric W. Hardesty
-
Patent number: 6484272Abstract: In a NUMA architecture, processors in the same CPU module with a processor opening a spin gate tend to have preferential access to a spin gate in memory when attempting to close the spin gate. This “unfair” memory access to the desired spin gate can result in starvation of processors from other CPU modules. This problem is solved by “balking” or delaying a specified period of time before attempting to close a spin gate whenever either one of the processors in the same CPU module just opened the desired spin gate, or when a processor in another CPU module is spinning trying to close the spin gate. Each processor detects when it is spinning on a spin gate. It then transmits that information to the processors in other CPU modules, allowing them to balk when opening spin gates.Type: GrantFiled: September 30, 1999Date of Patent: November 19, 2002Assignee: Bull HN Information Systems, Inc.Inventors: David A. Egolf, William A. Shelly, Wayne R. Buzby
-
Patent number: 6480973Abstract: In a NUMA architecture, processors in the same CPU module with a processor opening a spin gate tend to have preferential access to a spin gate in memory when attempting to close the spin gate. This “unfair” memory access to the desired spin gate can result in starvation of processors from other CPU modules. This problem is solved by “balking” or delaying a specified period of time before attempting to close a spin gate whenever either one of the processors in the same CPU module just opened the desired spin gate, or when a processor in another CPU module is spinning trying to close the spin gate. Each processor detects when it is spinning on a spin gate. It then transmits that information to the processors in other CPU modules, allowing them to balk when opening spin gates.Type: GrantFiled: September 30, 1999Date of Patent: November 12, 2002Assignee: Bull Information Systems Inc.Inventors: William A. Shelly, David A. Egolf, Wayne R. Buzby
-
Patent number: 6480845Abstract: In an emulation of a multiprocessor Target computer system on a Host computer system, Host virtual memory addresses are mapped and utilized as Target virtual memory addresses. Target virtual memory control tables are setup accordingly. Virtual-to-real address translation of a Target system effective address to a Host system virtual addresses is performed by identifying a working space for the effective address, determining a working space base address for that working space, and then performing a linear translation multiplying the effective address by a constant and adding it to the working space base address to generate the host system virtual address.Type: GrantFiled: June 14, 2000Date of Patent: November 12, 2002Assignee: Bull HN Information Systems Inc.Inventors: David A. Egolf, Stefan R. Bohult, Bruce A. Noyes, Chad Farmer
-
Patent number: 6449613Abstract: A method of addressing mass storage memory in which information is stored in Space Control Pages of physically contiguous disk segments subject to irregularities in the mapping is disclosed. Space Control Pages fall at regular intervals across the address space. An efficient hashing method is disclosed that first hashes record keys across the entire address space to form a hash index. If the hash index falls into one of the Space Control Pages, the key is rehashed across the contiguous hash space following the Space. Control Page utilizing a second hash function. The result of the second hash function is added to the start of the contiguous hash space following the Space Control Page to generate the hash index utilized for those records that initially hashed into a Space Control Page. In all cases the generated hash index is utilized to store and retrieve records in a database or hash file.Type: GrantFiled: December 23, 1999Date of Patent: September 10, 2002Assignee: Bull HN Information Systems Inc.Inventors: Jared A. Egolf, David A. Egolf
-
Patent number: 6446094Abstract: In an emulation of a multiprocessor Target computer system on a Host computer system, Host virtual memory addresses are mapped and utilized as Target virtual memory addresses. Target virtual memory control tables are setup accordingly. Virtual-to-real address translation of a Target system effective address to a Host system virtual addresses is performed by identifying a working space for the effective address, selecting a working space base address data structure entry utilizing the corresponding working space number, determining a working space base address from that selected working space base address data structure entry, and then performing a linear translation multiplying the effective address by a constant and adding it to the working space base address to generate the host system virtual address. A corresponding working space limit entry can be utilized to bounds check the addresses generated.Type: GrantFiled: June 15, 2000Date of Patent: September 3, 2002Assignee: Bull HN Information Systems Inc.Inventors: David A. Egolf, Stefan R. Bohult, Bruce A. Noyes, Chad Farmer
-
Patent number: 6446034Abstract: When emulating a Target architecture on a Host system having a different architecture, virtual to real address translation is typically expensive in terms of computer cycles. The cost can be significantly reduced by utilizing direct page table pointers to short-circuit the address translation. In a system additionally supporting segments framing portions of virtual memory, the direct page table pointers are associated with segment registers and point to the page table entry corresponding to the first location in a segment. Direct page table pointers are invalidated when underlying virtual memory management tables are modified.Type: GrantFiled: December 16, 1998Date of Patent: September 3, 2002Assignee: Bull HN Information Systems Inc.Inventor: David Egolf
-
Patent number: 6446062Abstract: A cache manager of a relational database management system (RDBMS) is able to bypass time consuming search operations through the use of a key memory structure and locate generated code segments within an SQL cache within a minimum of time. The SQL cache contains the generated code segments used to execute SQL statements as well as the structures and program logic used for maintaining the cache. The key memory structure is located in an area of memory utilized by the SQL runtime routines in executing applications. The runtime routines provide an interface between the application and the RDBMS.Type: GrantFiled: December 23, 1999Date of Patent: September 3, 2002Assignee: Bull HN Information Systems Inc.Inventors: Donald P. Levine, Anne Marie Wunderlin, David A. Egolf
-
Patent number: 6438536Abstract: A system and method that enhances the data access performance of a multi-layer relational database manager by expanding the code generation component layer of the database manager to include a number of performance enhancing subroutines designed to execute functions performed by lower component layers substantially faster than if the functions were executed by such lower component layers. Each such subroutine includes logic for establishing the conditions under which the particular subroutine is invoked during the processing of a SQL request. During process of generating code for a specific SQL query, the code generation component layer inserts calls to the different performance enhancing subroutines in place of normally included calls to lower component layers. This results in the insertion of the different performance enhancing subroutines into the generated code.Type: GrantFiled: September 29, 1999Date of Patent: August 20, 2002Assignee: Bull HN Information Systems Inc.Inventors: David S. Edwards, David A. Egolf, William L. Lawrance
-
Publication number: 20020083063Abstract: A dispatcher in a multiprogramming or multitasking operating system in a data processing system selects the next task to be executed by an available processor. Access to shared resources are controlled by locks and queues, where tasks are queued when they find the shared resource locked, and dequeued one by one as the lock is unlocked. When a lock is unlocked, the first task in a FIFO queue is dispatched with a temporary priority at least as high as any in the queue. This first task must retain this temporary urgency until it releases the resource or until its urgency is further increased due to the addition of a higher priority task to the resource queue or a dependent resource queue. This prevents starvation of higher priority tasks waiting in the FIFO queue.Type: ApplicationFiled: December 26, 2000Publication date: June 27, 2002Applicant: Bull HN Information Systems Inc.Inventor: David A. Egolf
-
Patent number: 6360194Abstract: In the emulation of a target system utilizing a multiprocessor (12) host system (10) with a longer word length than the target system, processor, memory, and cache overhead are minimized by utilizing a locked compare-exchange to update fill words in memory. The old contents of a word (48) in memory are loaded (80) into a first register (52). A loop is then entered. The contents of the first register (52) are copied (82) into a second (54). The contents of the second register (54) are then appropriately modified (84), depending on the instruction being emulated. After a lock (90), the two registers are compare-exchanged (86) with the memory word (48), resulting in the modified second register (54) being written to the memory word (48) if the contents of the first register (52) match. Otherwise, the compare-exchange instruction (86) loads the current copy of the word (48) into the first register (52), and the loop repeats.Type: GrantFiled: September 8, 1998Date of Patent: March 19, 2002Assignee: Bull HN Information Systems Inc.Inventor: David A. Egolf
-
Patent number: 6353819Abstract: A system and method that enhances the row retrieval performance of a multi-layer relational database manager by including in the code generation component layer of the database manager a row retrieval performance enhancing subroutine designed to execute functions performed by a lower component layer substantially faster than if the functions were executed by such lower component layer. The subroutine includes logic for establishing the conditions under which the particular subroutine is invoked during the execution of a SQL request. The output code generated to execute a specific SQL query, including calls to the row retrieval subroutine in place of normally included calls to the lower component layer. This enables the generated code to perform lower component layer functions with specialized code designed to increase performance based on the characteristics of the data being retrieved.Type: GrantFiled: September 29, 1999Date of Patent: March 5, 2002Assignee: Bull HN Information Systems Inc.Inventors: David S. Edwards, David A. Egolf, William L. Lawrance
-
Patent number: 6073129Abstract: A host system includes a multicache system configured within the host system's memory which has a plurality of local and central cache systems used for storing information being utilized by a plurality of processes running on the system. Persistent shared memory is used to store control structure information entries required for operating central cache systems for substantially long periods of time in conjunction with the local caches established for the processes. Such entries includes a descriptor value for identifying a directory control structure and individual sets of descriptors for identifying a group of control structures defining those components required for operating the configured central cache systems. The cache directory structure is used for defining the name of each configured central cache system and for providing an index value identifying the particular set of descriptors associated therewith.Type: GrantFiled: December 29, 1997Date of Patent: June 6, 2000Assignee: Bull HN Information Systems Inc.Inventors: Donald P. Levine, David A. Egolf
-
Patent number: 5696969Abstract: Convoys resulting from competing requests for a popular service are detected and dispersed by a scheduling procedure. When a request first enters the procedure, a determination is made as to whether the procedure is currently in the convoy disperse mode. If not, availability of the service is checked, and if it is available, the request is serviced. If the service is not available, a delay is instituted, and availability of the service is checked again. If it is still not available, a wait-for-service count is checked to determine if it exceeds a predetermined value. If not, the present request is sent to a queued wait. If so, the convoy disperse flag is set true, and the request is sent to the queued wait. If the convoy disperse flag was already true when the request was received into the procedure, a different path is taken in which a loop is entered which involves temporarily relinquishing the processor.Type: GrantFiled: March 19, 1996Date of Patent: December 9, 1997Assignee: Bull HN Information Systems Inc.Inventor: David A. Egolf
-
Patent number: 5579501Abstract: A method for addressing mass memory in which information is stored in control intervals of physically contiguous disk segments subject to irregularities in the mapping is disclosed. Such irregularities may include discontinuities at some regular interval, which may or may not be 2", and/or offset from zero with respect to a virtual address employed by a user. Within the method, a unique hashing algorithm is employed to convert a virtual address to a physical address taking into account such irregularities in the mapping. This algorithm is particularly characterized by its use of integer binary arithmetic which results in high speed and complete accuracy. For the special and common condition in which discontinuities appearing at some regular interval of 2", a similar disclosed algorithm may be employed to achieve even greater speed of address transformation.Type: GrantFiled: November 30, 1994Date of Patent: November 26, 1996Assignee: Bull HN Information Systems Inc.Inventors: Arnold S. Lipton, Mariam P. Sanford, David A. Egolf, David W. Wagner, Todd B. Kneisel, Michael L. Giroux