Patents by Inventor Mark A. Check
Mark A. Check 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: 20100241900Abstract: A system to determine fault tolerance in an integrated circuit may include a programmable logic device carried by the integrated circuit. The system may also include a configurable memory carried by the programmable logic device to control the function and/or connection of a portion of the programmable logic device. The system may further include user logic carried by said programmable logic device and in communication with a user and/or the configurable memory. The user logic may identify corrupted data in the configurable memory based upon changing user requirements.Type: ApplicationFiled: March 17, 2009Publication date: September 23, 2010Inventors: Mark A. Check, Andrew R. Ranck, Robert Brett Tremaine
-
Patent number: 7739545Abstract: In a computer system with multiple chips connected via a connection module with high speed elastic interface buses that support bus repair is enhanced by use of a spare net. Support is provided to ensure that the spare net can be tested in the same way that every normal bus net can be tested at all supported environments. It ensure that the system controller can find out what connections are bad and how to apply the controls to repair them for all tests and in the field for the customer.Type: GrantFiled: September 13, 2006Date of Patent: June 15, 2010Assignee: International Business Machines CorporationInventors: Mark A. Check, Jonathan Y. Chen, Thomas G. Foote, Timothy J. Slegel
-
Patent number: 7725894Abstract: A method is provided for recording a list of facilities available to a program executing on an information processing system. In such method a storage location and a length of data are defined for recording the list of facilities by a program being executed on the information processing system. An instruction is issued by the program for determining the available facilities and recording the list of available facilities in accordance with the defined storage location and data length. A processor executes the instruction to determine the available facilities and record the list of facilities in accordance with the defined storage location and defined data length. The recorded list of facilities can then be read by the first program.Type: GrantFiled: September 15, 2006Date of Patent: May 25, 2010Assignee: International Business Machines CorporationInventors: Mark A. Check, John R. Ehrman, Mark S. Farrell, Mike S. Fulton, Charles W. Gainey, Dan F. Greiner, Damian L. Osisek, Peter J. Relson
-
Patent number: 7617410Abstract: A system, method and computer program product for synchronizing adjustment of a time of day (TOD) clock for a computer system having multiple CPUs, each CPU having an associated physical clock providing a time base for executing operations that is stepping to a common oscillator, and an associated logical TOD clock. The method includes detecting propagation of a carry at a pre-determined bit position of the physical clock associated with a CPU in the computer system; and, updating, in response to the detecting of the pre-determined bit position carry, a TOD-clock offset value (d) to be added to a physical clock value (Tr) value to obtain a logical TOD clock value (Tb) for use by a CPU in the system. In this manner, each CPU computes a new logical TOD clock value in synchronization—the new logical TOD clock value taking effect simultaneously for the multiple CPUs.Type: GrantFiled: September 15, 2006Date of Patent: November 10, 2009Assignee: International Business Machines CorporationInventors: Mark A. Check, Ronald M. Smith, Sr.
-
Publication number: 20090259875Abstract: Two forms of TOD Clock instructions are provided, Store Clock and Store Clock Fast. Execution of the Store Clock Fast instruction may produce a time of day (TOD) result that is exactly the same as a previous TOD result, however execution of Store Clock Fast instructions while the clock is running always produce unique TOD results.Type: ApplicationFiled: June 22, 2009Publication date: October 15, 2009Applicant: International Business Machines CorporationInventors: Mark A. Check, Mark S. Farrell, Dan F. Greiner, James H. Mulder, Damian L. Osisek, Robert R. Rogers, Timothy J. Slegel, Ronald M. Smith, SR.
-
Publication number: 20090213735Abstract: A system to improve data packet routing in a data processing device may include a plurality of functional modules, and communication buses connecting the functional modules. The system may also include a flow control mechanism in which command packets that traverse the communication buses are each assigned their own channel with their own pool of credits. The system may further include a switch to route data packets on the communication buses from one of the functional modules to any other of the functional modules based upon the credits. In addition, any of the functional modules without credits to send the data packets on a particular channel may send a message to have the switch perform a route test.Type: ApplicationFiled: February 25, 2008Publication date: August 27, 2009Inventors: Mark A. Check, Michael Grassi, Scot H. Rider, Gabriel M. Tarr
-
Publication number: 20090204734Abstract: The exemplary embodiment of the present invention provides a storage buffer management scheme for I/O store buffers. Specifically, the storage buffer management system as described within the exemplary embodiment of the present invention is configured to comprise storage buffers that have the capability to efficiently support 128 byte or 256 byte I/O data transmission lines. The presently implemented storage buffer management scheme enables for a limited number of store buffers to be associated with a fixed number of storage state machines (i.e., queue positions) and thereafter the allowing for the matched pairs to be allocated in order to achieve maximum store throughput for varying combinations of store sizes of 128 and 256 bytes.Type: ApplicationFiled: February 13, 2008Publication date: August 13, 2009Applicant: International Business Machines CorporationInventors: Gary E. Strait, Mark A. Check, Hong Deng, Diana L. Orf
-
Publication number: 20080082878Abstract: In a computer system with multiple chips connected via a connection module with high speed elastic interface buses that support bus repair is enhanced by use of a spare net. Support is provided to ensure that the spare net can be tested in the same way that every normal bus net can be tested at all supported environments. It ensure that the system controller can find out what connections are bad and how to apply the controls to repair them for all tests and in the field for the customer.Type: ApplicationFiled: September 13, 2006Publication date: April 3, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Mark A. Check, Jonathan Y. Chen, Thomas G. Foote, Timothy J. Slegel
-
Publication number: 20080072097Abstract: A system, method and computer program product for synchronizing adjustment of a time of day (TOD) clock for a computer system having multiple CPUs, each CPU having an associated physical clock providing a time base for executing operations that is stepping to a common oscillator, and an associated logical TOD clock. The method includes detecting propagation of a carry at a pre-determined bit position of the physical clock associated with a CPU in the computer system; and, updating, in response to the detecting of the pre-determined bit position carry, a TOD-clock offset value (d) to be added to a physical clock value (Tr) value to obtain a logical TOD clock value (Tb) for use by a CPU in the system. In this manner, each CPU computes a new logical TOD clock value in synchronization—the new logical TOD clock value taking effect simultaneously for the multiple CPUs.Type: ApplicationFiled: September 15, 2006Publication date: March 20, 2008Applicant: International Business Machines CorporationInventors: Mark A. Check, Ronald M. Smith
-
Publication number: 20080071502Abstract: A method is provided for obtaining time-of-day (“TOD”) clock records on an information processing system. In accordance with such method, a first instruction is issued for recording a TOD clock value. In response to issuing the first instruction, a truncated version of a first current TOD clock value is obtained and recorded as a first TOD clock record, the first TOD clock value being a first current TOD clock value produced by a TOD clock running continuously on the information processing system. Thereafter, a second instruction is issued. In response to issuing the second instruction, a truncated version of a second current TOD clock value is obtained and recorded as a second TOD clock record, the second current TOD clock value being produced by the TOD clock, and the second TOD clock record being permitted to have the same value as the first TOD clock record.Type: ApplicationFiled: September 15, 2006Publication date: March 20, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Mark A. Check, Mark S. Farrell, Dan F. Greiner, James H. Mulder, Damian L. Osisek, Robert R. Rogers, Timothy J. Slegel, Ronald M. Smith, Peter G. Sutton
-
Publication number: 20080072224Abstract: A method is provided for recording a list of facilities available to a program executing on an information processing system. In such method a storage location and a length of data are defined for recording the list of facilities by a program being executed on the information processing system. An instruction is issued by the program for determining the available facilities and recording the list of available facilities in accordance with the defined storage location and data length. A processor executes the instruction to determine the available facilities and record the list of facilities in accordance with the defined storage location and defined data length. The recorded list of facilities can then be read by the first program.Type: ApplicationFiled: September 15, 2006Publication date: March 20, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Mark A. Check, John R. Ehrman, Mark S. Farrell, Mike S. Fulton, Charles W. Gainey, Dan F. Greiner, Damian L. Osisek, Peter J. Relson
-
Publication number: 20080065834Abstract: A computer system with the means to identify based on the instruction being decoded that the operand data that this instruction will access by its nature will not have locality of access and should be installed in the cache in such a way that each successive line brought into the data cache that hits the same congruence class should be placed in the same set as to not disturb the locality of the data that resided in the cache prior to the execution of the instruction that accessed the data that will not have locality of access.Type: ApplicationFiled: September 13, 2006Publication date: March 13, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Mark A. Check, Jennifer A. Navarro, Charles F. Webb
-
Publication number: 20070233918Abstract: A communications bus for a digital device includes a credit-based flow control mechanism, in which a sending component maintains a local record of its credits. Credits are returned to the sender by pulsing a single-bit credit return line. A separate mechanism provides a count of available credits from the receiver, the separate mechanism not necessarily being current. The local record is compared to the count of credits from the separate mechanism over a pre-determined time interval, failure of the two values to agree at any time during the interval indicating a probable credit discrepancy. A credit discrepancy is confirmed, preferably by suspending certain bus activity for a sufficiently long period to account for any delay in propagating credit value changes, and re-comparing the values.Type: ApplicationFiled: June 11, 2007Publication date: October 4, 2007Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Mark Check, Bernard Drerup, Michael Grassi
-
Publication number: 20070067545Abstract: A communications bus for a digital device includes a credit-based flow control mechanism, in which a sending component maintains a local record of its credits. Credits are returned to the sender by pulsing a single-bit credit return line. A separate mechanism provides a count of available credits from the receiver, the separate mechanism not necessarily being current. The local record is compared to the count of credits from the separate mechanism over a pre-determined time interval, failure of the two values to agree at any time during the interval indicating a probable credit discrepancy. A credit discrepancy is confirmed, preferably by suspending certain bus activity for a sufficiently long period to account for any delay in propagating credit value changes, and re-comparing the values.Type: ApplicationFiled: October 27, 2006Publication date: March 22, 2007Applicant: International Business Machines CorporationInventors: Mark Check, Bernard Drerup, Michael Grassi
-
Patent number: 7167968Abstract: A method of pre-aligning data for storage during instruction execution improves performance by eliminating the cycles otherwise required for data alignment. The method can convert data between ASCII and Packed Decimal format, and between Unicode Basic Latin and Packed Decimal format. Conversion to Packed Decimal format is needed for decimal hardware in a microprocessor designed to generate decimal results. Converting from Packed Decimal to ASCII and Unicode Basic Latin is necessary to report Decimal Arithmetic results in a required format for the application program. To further improve performance, all available write ports in the fixed point unit (FXU) are utilized to reduce the number of cycles necessary to store results. To prevent data fetching of the unused destination data from slowing down instruction execution, the destination locations are tested for storage access exceptions, but the data for these operands are not actually fetched.Type: GrantFiled: April 29, 2004Date of Patent: January 23, 2007Assignee: International Business Machines CorporationInventors: Fadi Y. Busaba, Steven R. Carlough, Mark A. Check, Christopher A. Krygowski, John G. Rell, Jr., Frank Tanzi
-
Patent number: 7103754Abstract: A computer architecture that provides the definition of a 20 bit signed displacement value used to form the operand storage address.Type: GrantFiled: March 28, 2003Date of Patent: September 5, 2006Assignee: International Business Machines CorporationInventors: Mark A. Check, Brian B. Moore, Timothy J. Slegel
-
Publication number: 20060195680Abstract: A computer machine instruction is fetched and executed, the machine instruction having a signed field value wherein the signed field value comprises contiguous bit positions 1-N consisting of a contiguous most significant value contiguous with a contiguous embedded sign field, the embedded sign field contiguous with a contiguous least significant value. Preferably, the sign field is one bit, the contiguous most significant value comprises bit position N and the least significant value comprises bit position 1 wherein N is the least significant bit of the most significant value.Type: ApplicationFiled: April 18, 2006Publication date: August 31, 2006Applicant: International Business Machines CorporationInventors: Mark Check, Brian Moore, Timothy Slegel
-
Publication number: 20060179182Abstract: A control mechanism for data bus communications employs channels to which bus transactions are assigned, each channel having independent flow control. The control mechanism enforces an ordering algorithm among channels, whereby at least some transactions may pass other transactions. Channel attributes are programmable to vary the ordering conditions. Preferably, each channel is allocated its own programmable buffer area. The control mechanism independently determines, for each channel, whether buffer space is available and enforces flow control independently for each channel accordingly. Flow control is preferably credit-based, credits representing buffer space or some other capacity of a receiver to receive data. Preferably, the flow control mechanism comprises a central interconnect module controlling internal communications of an integrated circuit chip.Type: ApplicationFiled: January 31, 2005Publication date: August 10, 2006Applicant: International Business Machines CorporationInventors: Sundeep Chadha, Mark Check, Bernard Drerup, Michael Grassi
-
Patent number: 7089408Abstract: A system and method to re-fetch operand data lost for instructions with operands greater than eight bytes in length due to line invalidation due to storage update from a single or plurality of processors in a multiprocessor computer system using microprocessors that perform out of order operand fetch with respect to sequential program order in which it is not possible or desirable to kill the execution of the instruction when the storage access rules require that it appear that the operand data is accessed in program execution order.Type: GrantFiled: May 12, 2003Date of Patent: August 8, 2006Assignee: International Business Machines CorporationInventors: Mark A. Check, Jennifer Navarro, Chung-Lung K. Shum
-
Publication number: 20060174158Abstract: An integrated circuit chip includes multiple functional components and a central interconnect (CI) module. Each functional component communicates with the CI module via a respective internal bus sharing a common architecture which does not dictate any particular data alignment. The chip architecture defines an alignment mechanism within the CI module, which performs any required alignment of transmitted data. Alignment mechanism design parameters can be varied to accommodate different alignment domains of different functional components. Preferably, the common bus architecture supports multiple internal bus widths, the CI module performing any required bus width conversion. Preferably, for certain transactions not containing a data address, correct alignment is obtained by placing restrictions on transaction size and boundaries, and duplicating certain data on different alignment boundaries.Type: ApplicationFiled: January 31, 2005Publication date: August 3, 2006Applicant: International Business Machines CorporationInventors: Mark Check, Bernard Drerup, Michael Grassi