Abstract: A computer system, method, and computer readable product are provided for event-based serverless computing with tiered latency. In various embodiments, computer-executable instructions are received along with an indication of an event whose occurrence triggers execution of those instructions within a container on a serverless computing platform. Additionally, the instructions come with an indication of an acceptable amount of latency between the event occurring and the instructions being executed. Multiple different actions may be made to execute the instructions based on that indicated latency.

Abstract: A system and method are provided for communicating information in a data structure between applications. According to the method, a description of a data structure is sent from a first application to a second application, and there is received from the second application an identification of at least one portion of the data structure that is requested by the second application. The first application marshals a subset of the data structure consisting of the at least one portion that was identified, and there is sent from the first application to the second application the marshalled subset of the data structure.

Abstract: Predicting program performance on hardware devices, in one aspect, may comprise obtaining a set of existing applications and observed performance on a target hardware device. The set of existing applications are run on one or more general purpose computer processors and application features are extracted from the existing application. A machine learning technique is employed to train a predictive model based on the extracted application features and the observed performance for predicting application performance on the target hardware device.

Abstract: A computer system, method, and computer readable product are provided for event-based serverless computing with tiered latency. In various embodiments, computer-executable instructions are received along with an indication of an event whose occurrence triggers execution of those instructions within a container on a serverless computing platform. Additionally, the instructions come with an indication of an acceptable amount of latency between the event occurring and the instructions being executed. Multiple different actions may be made to execute the instructions based on that indicated latency.

Abstract: Predicting program performance on hardware devices, in one aspect, may comprise obtaining a set of existing applications and observed performance on a target hardware device. The set of existing applications are run on one or more general purpose computer processors and application features are extracted from the existing application. A machine learning technique is employed to train a predictive model based on the extracted application features and the observed performance for predicting application performance on the target hardware device.

Abstract: Predicting program performance on hardware devices, in one aspect, may comprise obtaining a set of existing applications and observed performance on a target hardware device. The set of existing applications are run on one or more general purpose computer processors and application features are extracted from the existing application. A machine learning technique is employed to train a predictive model based on the extracted application features and the observed performance for predicting application performance on the target hardware device.

Abstract: A system and method are provided for communicating information in a data structure between applications. According to the method, a description of a data structure is sent from a first application to a second application, and there is received from the second application an identification of at least one portion of the data structure that is requested by the second application. The first application marshals a subset of the data structure consisting of the at least one portion that was identified, and there is sent from the first application to the second application the marshalled subset of the data structure.

Abstract: A system and method are provided for communicating information in a data structure between applications. According to the method, a description of a data structure is sent from a first application to a second application, and there is received from the second application an identification of at least one portion of the data structure that is requested by the second application. The first application marshals a subset of the data structure consisting of the at least one portion that was identified, and there is sent from the first application to the second application the marshalled subset of the data structure.

Abstract: Predicting program performance on hardware devices, in one aspect, may comprise obtaining a set of existing applications and observed performance on a target hardware device. The set of existing applications are run on one or more general purpose computer processors and application features are extracted from the existing application. A machine learning technique is employed to train a predictive model based on the extracted application features and the observed performance for predicting application performance on the target hardware device.

Abstract: The present invention provides a programming model based on a relational view of the heap which defines identity declaratively, obviating the need for equals( ) and hashcode( ) methods. Each element in the heap (called a tuple) belongs to a relation type and relates an immutable identity to mutable state. The model entails a stricter contract: identity never changes during an execution. Objects, values, and singletons arise as special cases of tuples.

Abstract: A computer readable storage medium for associating a phase with an activation of a computer program that supports garbage collection include: a plurality of stacks, each stack including at least one stack frame that includes an activation count; and a processor with logic for performing steps of: zeroing the activation count whenever the program creates a new stack frame and after garbage collection is performed; determining whether an interval has transpired during program execution; examining each stack frame's content and incrementing the activation count for each frame of the stacks once the interval has transpired; detecting the phase whose activation count is non-zero and associating the phase with the activation; and ensuring that when the phase ends, an action is immediately performed.

Abstract: A computer readable storage medium for associating a phase with an activation of a computer program that supports garbage collection include: a plurality of stacks, each stack including at least one stack frame that includes an activation count; and a processor with logic for performing steps of: zeroing the activation count whenever the program creates a new stack frame and after garbage collection is performed; determining whether an interval has transpired during program execution; examining each stack frame's content and incrementing the activation count for each frame of the stacks once the interval has transpired; detecting the phase whose activation count is non-zero and associating the phase with the activation; and ensuring that when the phase ends, an action is immediately performed.

Abstract: A system for associating a phase with an activation of a computer program that supports garbage collection include: a plurality of stacks, each stack including at least one stack frame that includes an activation count; and a processor with logic for performing steps of: zeroing the activation count whenever the program creates a new stack frame and after garbage collection is performed; determining whether an interval has transpired during program execution; examining each stack frame's content and incrementing the activation count for each frame of the stacks once the interval has transpired; detecting the phase whose activation count is non-zero and associating the phase with the activation; and ensuring that when the phase ends, an action is immediately performed. Detecting phases in a running computer program, creates an activation count associated with each stack frame.

Abstract: A system and method are provided for communicating information in a data structure between applications. According to the method, a description of a data structure is sent from a first application to a second application, and there is received from the second application an identification of at least one portion of the data structure that is requested by the second application. The first application marshals a subset of the data structure consisting of the at least one portion that was identified, and there is sent from the first application to the second application the marshalled subset of the data structure.

Abstract: The present invention provides a programming model based on a relational view of the heap which defines identity declaratively, obviating the need for equals( ) and hashcode( ) methods. Each element in the heap (called a tuple) belongs to a relation type and relates an immutable identity to mutable state. The model entails a stricter contract: identity never changes during an execution. Objects, values, and singletons arise as special cases of tuples.

Abstract: A system for associating a phase with an activation of a computer program that supports garbage collection include: a plurality of stacks, each stack including at least one stack frame that includes an activation count; and a processor with logic for performing steps of: zeroing the activation count whenever the program creates a new stack frame and after garbage collection is performed; determining whether an interval has transpired during program execution; examining each stack frame's content and incrementing the activation count for each frame of the stacks once the interval has transpired; detecting the phase whose activation count is non-zero and associating the phase with the activation; and ensuring that when the phase ends, an action is immediately performed. detecting phases in a running computer program, creates an activation count associated with each stack frame.

Abstract: A system and method for detecting phases in a running computer program, creates an activation count associated with each stack frame. The activation count is zeroed whenever a new frame is created in a stack and incremented for each frame encountered during periodic intervals. A phase is detected with an activation whose activation count is non-zero.

Abstract: A method for implementing an object model for an object-oriented programming language. Also contemplated is a method whereby some object state is materialized directly in those objects deemed likely to use such a state, but is externalized for those objects deemed unlikely to use the state.

Abstract: A system and method for characterizing runtime behavior of a computer program executing in an execution environment, the method comprising: identifying one or more instances of yield points in a program to be executed, each yield point indicating a potential sampling operation during program execution; during program execution, in response to an identified yield point instance, ascertaining a state of the execution environment for indicating whether a sampling operation is to be performed; and, when the state of the execution environment indicates a sampling operation, recording relevant information for characterizing behavior of the execution environment. Relevant information for characterizing program behavior includes frequencies of methods executed in the program, and calling context associated with methods called by the program.

Abstract: A sampling-based system and method for adaptively optimizing a computer program executing in an execution environment that comprises one or more compiler devices for providing various levels of program optimization. The system comprises a runtime measurements sub-system for monitoring execution of the computer program to be optimized, the monitoring including obtaining raw profile data samples and characterizing the raw profile data; a controller device for receiving the characterized raw profile data from the runtime measurements sub-system and analyzing the data for determining whether a level of program optimization for the executing program is to be performed by a compiler device, the controller generating a compilation plan in accordance with a determined level of optimization; and, a recompilation sub-system for receiving a compilation plan from the controller and invoking a compiler device for performing the level of program optimization of the executing program in accordance with the compilation plan.