公开(公告)号：ES2079355T3

公开(公告)日：1996-01-16

申请号：ES88307158

申请日：1988-08-03

Applicant: IBM

Inventor： LEVINE FRANK ELIOT ,  MOHAN CHANDRASEKARAN

IPC: G06F12/00 ,  G06F17/30

Abstract: A database system in a data processing system has an index tree structure with a root node having reference keys to nodes in the next lower level and so on until bottom nodes having keys referencing the database records. Multiple users may access the database concurrently. Transactions in which the tree structure is to be modified (for example removal of a record) are performed by traversing the tree to the appropriate bottom node and setting an indication of pendency of the modification. At the same time other accesses to the database, through nodes at which no tree structure modifications are to take place, can continue. When the structure modification has been performed, a log record of it is made to prevent undoing the modification in the event of a system failure, and database access through all the bottom nodes then continues.

公开(公告)号：AU7370087A

公开(公告)日：1987-12-17

申请号：AU7370087

申请日：1987-06-01

Applicant: IBM

Inventor： HEATH ALLEN WEBSTER ,  LEVINE FRANK ELIOT ,  PRAVITZ WAYNE LEITH

IPC: B41J5/30 ,  B41J21/00 ,  B41J29/40 ,  G06F3/12 ,  G06F17/21 ,  B42C1/00

公开(公告)号：GB2501434A

公开(公告)日：2013-10-23

申请号：GB201313798

申请日：2012-01-05

Applicant: IBM

Inventor： SIEGWART DAVID KEVIN ,  LEVINE FRANK ELIOT ,  PINEDA ENIO MANUEL

IPC: G06F11/34

Abstract: An activity recording system for a concurrent software environment executing software threads in a computer system, the activity recording system comprising: a thread state indicator for recording an indication of a synchronisation state of a software thread in which the software thread ceases to execute in a processor of the computer system, the indication being associated with an identification of the software thread; a time profiler for identifying a processor of the computer system being idle and recording an indication that the processor is idle; a dispatch monitor for identifying the dispatch of the software thread to the processor and, responsive to the indication that the processor is idle and the indication of a synchronisation state of the software thread, generating a record attributing the idleness of the processor to the software thread and the indicated synchronisation state.

公开(公告)号：GB2493609A

公开(公告)日：2013-02-13

申请号：GB201212738

申请日：2011-05-11

Applicant: IBM

Inventor： LEVINE FRANK ELIOT ,  KUIPER KEAN ,  PINEDA ENIO MANUEL

IPC: G06F9/50

Abstract: A process generates a sample based on an event. The process identifies, with a dispatch monitor, a next dispatched monitored thread that is dispatched by a current processor. The process sets a processor affinity of the next dispatched monitored thread such that the next dispatched monitored thread runs only on the current processor without being able to migrate to a different processor. The process also retrieves, with a sampled thread that runs on the current processor, a next dispatched monitored thread call stack after the processor affinity of the next dispatched monitored thread has been set to the processor. The process restores the processor affinity of the next dispatched monitored thread after the next dispatched monitored thread call stack has been obtained.

公开(公告)号：AT375556T

公开(公告)日：2007-10-15

申请号：AT01305865

申请日：2001-07-06

Applicant: IBM

Inventor： HUSSAIN RIAZ Y ,  JOHN CHESTER CHARLES ,  LEVINE FRANK ELIOT ,  RICHARDSON CHRISTOPHER MICHAEL

IPC: G06F11/34 ,  G06F11/32 ,  G06F11/36

Abstract: An apparatus and method for cataloging symbolic data for use in performance analysis of computer programs is provided. The apparatus and method stores symbolic data for loaded modules during or shortly after a performance trace and utilizes the stored symbolic data when performing a performance analysis at a later time. A merged symbol file is generated for a computer program, or application, under trace. The merged symbol file contains information useful in performing symbolic resolution of address information in trace files for each instance of a module. During post processing of the trace information generated by a performance trace of a computer program, symbolic information stored in the merged symbol file is compared to the trace information stored in the trace file. The correct symbolic information in the merged symbol file for loaded modules is identified based a number of validating criteria. The correct symbolic information for the loaded modules may then be stored as an indexed database that is used to resolve address information into corresponding symbolic information when providing the trace information to a display for use by a user.

公开(公告)号：DE10050684B4

公开(公告)日：2005-12-01

申请号：DE10050684

申请日：2000-10-13

Applicant: IBM

Inventor： BERRY ROBERT FRANCIS ,  LEVINE FRANK ELIOT ,  URQUHART ROBERT J

IPC: G06F9/44 ,  G06F9/445 ,  G06F11/00 ,  G06F11/34 ,  G06F17/30

Abstract: A method and system for profiling a program using periodic trace sampling is provided. During the execution of the program, sample-based profiling of the executing program is performed-for a predetermined period, a profiler performs trace processing for the program, after which the profiler pauses and does not perform trace processing for a predetermined period. The periods controlling the profiler may be selected by a user, and the periods may be measured by temporal or non-temporal metrics. The profiler cycles through these periods, during which selected events are processed to generate a profile of the execution flows within the program. For each sample period, a tree data structure is generated in which nodes of the tree data structure represent the routines of the program that execute during the sample period, as may be indicated by entry and exit events caused by the execution of the routines. When the execution of the program is complete, the tree data structures from each sample period are merged into a resulting tree data structure.

公开(公告)号：DE3854667D1

公开(公告)日：1995-12-14

申请号：DE3854667

申请日：1988-08-03

Applicant: IBM

Inventor： LEVINE FRANK ELIOT ,  MOHAN CHANDRASEKARAN

IPC: G06F12/00 ,  G06F17/30

Abstract: A database system in a data processing system has an index tree structure with a root node having reference keys to nodes in the next lower level and so on until bottom nodes having keys referencing the database records. Multiple users may access the database concurrently. Transactions in which the tree structure is to be modified (for example removal of a record) are performed by traversing the tree to the appropriate bottom node and setting an indication of pendency of the modification. At the same time other accesses to the database, through nodes at which no tree structure modifications are to take place, can continue. When the structure modification has been performed, a log record of it is made to prevent undoing the modification in the event of a system failure, and database access through all the bottom nodes then continues.

公开(公告)号：MX169516B

公开(公告)日：1993-07-09

申请号：MX685287

申请日：1987-06-10

Applicant: IBM

Inventor： HEATH ALLEN WEBSTER ,  LEVINE FRANK ELIOT ,  PRAVITZ WAYNE LEITH

IPC: B41J5/30 ,  B41J21/00 ,  B41J29/40 ,  G06F3/12 ,  G06F17/21 ,  G06K15/02

公开(公告)号：AU596185B2

公开(公告)日：1990-04-26

申请号：AU7370087

申请日：1987-06-01

Applicant: IBM

Inventor： HEATH ALLEN WEBSTER ,  LEVINE FRANK ELIOT ,  PRAVITZ WAYNE LEITH

IPC: B41J5/30 ,  B41J21/00 ,  B41J29/40 ,  G06F3/12 ,  G06F17/21 ,  B42C1/00

公开(公告)号：GB2211967A

公开(公告)日：1989-07-12

申请号：GB8822419

申请日：1988-09-23

Applicant: IBM

Inventor： LEVINE FRANK ELIOT ,  MOHAN CHANDRASEKARAN

IPC: G06F12/00 ,  G06F17/30

Abstract: A data base system on a computer uses an index tree containing record keys which reference associated records in the data base. The tree, which comprises a root node extending through intermediate nodes to leaf nodes, provides concurrent accesses to a plurality of users. When changes are to be made to the key structure, action has to be taken to prevent users, other than the user making the change, from corrupting the data or receiving corrupted data. To do this, when one user is inserting or deleting a key and its associated record, all accesses to a node being traversed by this user and the immediately traversed mode are limited to read accesses by other users. At the leaf node, all accesses by others to the key and record being added or deleted are prevented together with accesses to the next successively located record key and its associated record. After the deletion or insertion, the access limitations are removed.