Abstract: Provided are techniques for parsing source code file into a plurality of functions; generating a ranking corresponding to each of the plurality of functions based upon an order of occurrence in the source code file; generating a weight score corresponding to each of the plurality of functions based upon a weighing factor and the occurrence of a condition corresponding to each of the plurality of functions; and generating an object code file such that the plurality of functions are ordered in the object code file based upon the corresponding rankings and weight scores such during a startup of execution of the object code file a startup time is minimized with respect to an object code file not generated in accordance with the claimed method.

Abstract: An I/O request to store a file in a file-system is received. A determination is made whether the size of the file does not exceed a threshold size. Exceeding the threshold results in storing at least a portion of the file in a block of the file-system devoid of sub-blocks. A determination is made whether the size of the file does not exceed a size of unallocated space within a single block in the file-system. The single block includes a set of sub-blocks. Responsive to the size of the file not exceeding the threshold size and the size of unallocated space within the single block, the file is stored, at an address, in a first subset of the set of the sub-blocks of the single block. The address identifies the single block and a position of a sub-block in the subset.

Abstract: Provided are techniques for parsing source code file into a plurality of functions generating a ranking corresponding to each of the plurality of functions based upon an order of occurrence in the source code file; generating a weight score corresponding to each of the plurality of functions based upon a weighing factor and the occurrence of a condition corresponding to each of the plurality of functions; and generating an object code file such that the plurality of functions are ordered in the object code file based upon the corresponding rankings and weight scores such during a startup of execution of the object code file a startup time is minimized with respect to an object code file not generated in accordance with the claimed method.

Abstract: A computer identifies a relationship among a subset of a set of data blocks, a basis of the relationship forming a context shared by the subset of data blocks. The computer selects a code data structure from a set of code data structures using the context. The context is associated with the code data structure, and the code data structure includes a set of codes. The computer computes, for a first data block in the subset of data blocks, a first code corresponding to a content of the first data block. The computer determines whether the first code matches a stored code in the code data structure. The computer replaces, responsive to the first code matching the stored code, the first data block with a reference to an instance of the first data block. The computer causes the reference to be stored in a target data processing system.

Abstract: Illustrative embodiments include a method, system, and computer program product for estimating boot-time memory requirement of a data processing system. A data processing system identifies, using system configuration information associated with the data processing system, a set of components needed for booting up the data processing system. The data processing system determines a dependency of a component identified in the set of components, the component including a memory estimator program. The data processing system determines an ancestry of the component identified in the set of components. The data processing system receives, using the memory estimator program of the component, a boot-time memory requirement of the component. The data processing system calculates a total boot-time memory requirement. The data processing system determines whether an amount of real memory of the data processing system satisfies the total boot-time memory requirement.

Abstract: Provided are techniques for the tracing of computer processes and, more specifically, to techniques that enable a work unit to be traced across multiple processing components. A data structure is created and associated with a work unit. The first time a unit of work is processed a tracing context is retrieved form a pool and associated with the data structure. As the unit of work is passed from component to component, the data structure is passed so that each component has access and is able to augment the same tracing context associated with the unit of work.

Abstract: Provided are techniques for parsing source code file into a plurality of functions; generating a ranking corresponding to each of the plurality of functions based upon an order of occurrence in the source code file; generating a weight score corresponding to each of the plurality of functions based upon a weighing factor and the occurrence of a condition corresponding to each of the plurality of functions; and generating an object code file such that the plurality of functions are ordered in the object code file based upon the corresponding rankings and weight scores such during a startup of execution of the object code file a startup time is minimized with respect to an object code file not generated in accordance with the claimed method.

Abstract: Provided are techniques for the tracing of computer processes and, more specifically, to techniques that enable a work unit to be traced across multiple processing components. A data structure is created and associated with a work unit. The first time a unit of work is processed a tracing context is retrieved form a pool and associated with the data structure. As the unit of work is passed from component to component, the data structure is passed so that each component has access and is able to augment the same tracing context associated with the unit of work.

Abstract: A method, computer program product and computer system for coordinating data collection from a component of a data processing system is disclosed. The component registers with a dispatcher, wherein the component is a computer resource of the data processing system and is configured to accept at least one query, and the registration comprising data types handled by the at least one component, wherein the dispatcher is allocated computer resources of the data processing system. The component receives from the dispatcher a notification to perform the query against specified data structures, wherein the query comprises an action. The component, responsive to receiving notification, determines whether data structures of a data type specified in the query are handled. The data processing system runs the query to determine whether the query is satisfied. The data processing system executes the action.

Abstract: A method, system, and computer program product for fast cancellation of an I/O request in a data processing system are provided in the illustrative embodiments. A first component in a stack comprising a plurality of components determines whether a memory buffer associated with the I/O request is valid, the memory buffer being an addressable area in a memory in the data processing system. The first component, responsive to the memory buffer being valid, creates a first request data structure corresponding to the I/O request, wherein the first request data structure includes a reference to the memory buffer. The first component passes the first request data structure to a second component in the stack.

Abstract: A computer identifies a relationship among a subset of a set of data blocks, a basis of the relationship forming a context shared by the subset of data blocks. The computer selects a code data structure from a set of code data structures using the context. The context is associated with the code data structure, and the code data structure includes a set of codes. The computer computes, for a first data block in the subset of data blocks, a first code corresponding to a content of the first data block. The computer determines whether the first code matches a stored code in the code data structure. The computer replaces, responsive to the first code matching the stored code, the first data block with a reference to an instance of the first data block. The computer causes the reference to be stored in a target data processing system.

Abstract: Provided are techniques for the tracing of computer processes and, more specifically, to techniques that enable a work unit to be traced across multiple processing components. A data structure is created and associated with a work unit. The first time a unit of work is processed a tracing context is retrieved form a pool and associated with the data structure. As the unit of work is passed from component to component, the data structure is passed so that each component has access and is able to augment the same tracing context associated with the unit of work.

Abstract: Provided are techniques for parsing source code file into a plurality of functions; generating a ranking corresponding to each of the plurality of functions based upon an order of occurrence in the source code file; generating a weight score corresponding to each of the plurality of functions based upon a weighing factor and the occurrence of a condition corresponding to each of the plurality of functions; and generating an object code file such that the plurality of functions are ordered in the object code file based upon the corresponding rankings and weight scores such during a startup of execution of the object code file a startup time is minimized with respect to an object code file not generated in accordance with the claimed method.

Abstract: An I/O request to store a file in a file-system is received. A determination is made whether the size of the file does not exceed a threshold size. Exceeding the threshold results in storing at least a portion of the file in a block of the file-system devoid of sub-blocks. A determination is made whether the size of the file does not exceed a size of unallocated space within a single block in the file-system. The single block includes a set of sub-blocks. Responsive to the size of the file not exceeding the threshold size and the size of unallocated space within the single block, the file is stored, at an address, in a first subset of the set of the sub-blocks of the single block. The address identifies the single block and a position of a sub-block in the subset.

Abstract: Provided are techniques for the tracing of computer processes and, more specifically, to techniques that enable a work unit to be traced across multiple processing components. A data structure is created and associated with a work unit. The first time a unit of work is processed a tracing context is retrieved form a pool and associated with the data structure. As the unit of work is passed from component to component, the data structure is passed so that each component has access and is able to augment the same tracing context associated with the unit of work.

Abstract: A method, computer program product and computer system for coordinating data collection from a component of a data processing system is disclosed. The component registers with a dispatcher, wherein the component is a computer resource of the data processing system and is configured to accept at least one query, and the registration comprising data types handled by the at least one component, wherein the dispatcher is allocated computer resources of the data processing system. The component receives from the dispatcher a notification to perform the query against specified data structures, wherein the query comprises an action. The component, responsive to receiving notification, determines whether data structures of a data type specified in the query are handled. The data processing system runs the query to determine whether the query is satisfied. The data processing system executes the action.

Abstract: A system and method for passing data between a first device driver and a second device driver. Data to be provided to the second device driver is identified in the first device driver. A data exchange interface within a kernel space is invoked by the first device driver. The data exchange interface initializes a physical to Direct Memory Access (DMA) address translation table for the child device based on an identifier of a direct memory access window. The data is provided to the data exchange interface. The data exchange interface, in the kernel space, writes the data to a data structure maintained and used by the second device driver.

Abstract: A system and method for extending the use of the cross-memory descriptor in a server partition environment such that it may be used to describe another partition's memory, e.g., a client partition's memory (referred to hereafter as a “remote” memory), are provided. With the system and method, when an operating system in a logically partitioned computing system is initialized, operating system kernel services are invoked that examine a device tree of the computing system and generate an extended cross-memory descriptor that describes the local memory of another logical partition, which is a remote memory to the present logical partition. When an access to a remote memory is required to perform an operation, the operating system of the server partition uses the stored extended cross-memory descriptor to perform the remote memory access.