International Business Machines Corporation

Matthew Edward Aubertine

Gerard M Salem

Craig R Selinger

Michael Herasimtschuk

Harold J Broker

Michael A Granato

Ronald P Checca

Kianoush Beyzavi

David A Haeussler

Michael J Jurkovic

Rajat Tiwary

Paul R Zehr

A method, system, and computer program product for timing the execution of code to facilitate the debugging of a Korn shell script. A user specifies the starting point and stopping point of a block of code by placing a time-code function at the beginning and end of the block of code. Furthermore, the user specifies a threshold value within the time-code function that corresponds to a maximum amount of time allotted for execution. The user defines a label variable to identify the output. When the block of code is executed, the time-code function calculates the time of execution and outputs the results. If the code contains an error that causes the execution time to exceed the threshold value, the time-code function halts the execution of the block of code and an error message is displayed. The error message then assists the user in debugging the block of code.

Method and system for timing code execution in a korn shell script

A method and system for minimizing the cycle time when compiling a program in a computer system is disclosed. The program includes a plurality of directories and each of the directories includes a code file. The method and system comprises the steps of providing a master array of directories of the program, wherein the master array lists the dependencies of the directories; providing a code change to the program to provide an updated program; providing associated dependency changes to the master array to provide an updated master array; and compiling the updated program utilizing the updated master array wherein the code files of the directories are compiled in an ordered manner based upon the dependencies of the plurality of directories. Through the use of the method and system in accordance with the present invention, compile cycle time for large programs is significantly reduced. A second advantage is that since the dependencies are updated substantially simultaneously with code changes, there are minimal dependency violations and therefore few deadlocks.

Method and system for minimizing the cycle time when compiling a program in a processing system

A method and system for optimizing the use of a plurality of processors when compiling a program in a computer system is disclosed. The method and system comprises providing a list of directories and a list of processors. The method and system further includes determining when a directory is available. The method and system includes assigning a directory to a next available processor in an ordered manner to allow the next available processor to compile at least one file within the directory. Finally, the method and system includes ensuring that the maximum number of directories can be processed by assigning a processor thereto. Through the use of the method and system in accordance with the present invention, compile cycle time for large programs is significantly reduced. Accordingly, the dependencies are updated simultaneously with the code changes, thereby allowing for the compiling of the large program with minimal dependency violations.

Method and system for optimizing the use of processors when compiling a program

A method is provided to assign component I/O (input/output, the interface area between levels of physical packaging) pins for all components at each level of the computer system. In a hierarchical, top-down design methodology, the I/O pins for each computer system component are assigned to nets (a net is an interconnection of pins on a level of packaging, or between levels of packaging) based on wire length, electrical limits and timing. Parameters that are considered are net priority (the importance of this net to the system, relative to other nets in the system), location of physical components, location of physical component I/Os at all computer system levels of physical packaging hierarchy, and I/O pin characteristics. An iterative method is used to assign and reassign I/O pins at each level based on timing. As I/Os are reassigned at each lower component level, new assignments are made at all higher levels of the system packaging hierarchy based on the changed parameters at the lower level. I/Os assignment by this method for a computer system package design reduces the occurance of any critical nets failing length, electrical or timing constraints due to poor I/O assignments. The method has built in checks to avoid being trapped in an NP complete situation (a form of endless loop).

Method of I/O pin assignment in a hierarchial packaging system

Growing community of inventors

Austin, TX, United States of America

Matthew Edward Aubertine