Abstract: An instance of universally shared generic code is generated. A runtime parameter enables the size of a stack frame on which local data can be stored to be determined. Dynamically sized locals can be stored on a stack enabling precise garbage collection reporting. One frame of the stack is allocated for each code segment to simplify GC reporting. A reporting region in the frame memory region comprises a count of locals and a location at which the local is found in the stack.

Abstract: Multiple different type hierarchies can communicate in a high performance and seamless manner by sharing a GC and interface dispatch logic. A runtime environment can support multiple independent type hierarchies, each type hierarchy defined by the module which defines the root of a type graph and some other helper functionality. Code that uses the dispatch logic has to follow certain rules in order to maintain GC and type safety. Different types in disjoint type graphs can behave as if they were one type for cross type graph communication purposes.

Abstract: Multiple different type hierarchies can communicate in a high performance and seamless manner by sharing a GC and interface dispatch logic. A runtime environment can support multiple independent type hierarchies, each type hierarchy defined by the module which defines the root of a type graph and some other helper functionality. Code that uses the dispatch logic has to follow certain rules in order to maintain GC and type safety. Different types in disjoint type graphs can behave as if they were one type for cross type graph communication purposes.

Abstract: An instance of universally shared generic code is generated. A runtime parameter enables the size of a stack frame on which local data can be stored to be determined. Dynamically sized locals can be stored on a stack enabling precise garbage collection reporting. One frame of the stack is allocated for each code segment to simplify GC reporting. A reporting region in the frame memory region comprises a count of locals and a location at which the local is found in the stack.

Abstract: A program entity that generates code but that does not perturb global state is identified. Code produced by the identified program entity can be assigned an identifier and cached the first time it is executed. Subsequent executions of the program entity can eliminate generation of the code and/or translation of the generated code into native binary code. The runtime generated code and native binary code can be cached in a machine-wide cache, or can be added to the metadata of the assembly generated from the source code of the program entity.

Abstract: Architecture that facilitates performance enhancement in message-based computing across a performance-based interface. When a request from a source is transmitted across the interface to a destination, a filter component in communication with the destination dynamically allows only one or more relevant responses from the destination to transition the interface to the source. This mechanism achieves an even tighter filtering of events while at the same time giving developers more flexibility over the events they choose to register, thereby enhancing the performance of message-based computing architectures by reducing unnecessary computation.

Abstract: Architecture that facilitates performance enhancement in message-based computing across a performance-based interface. When a request from a source is transmitted across the interface to a destination, a filter component in communication with the destination dynamically allows only one or more relevant responses from the destination to transition the interface to the source. This mechanism achieves an even tighter filtering of events while at the same time giving developers more flexibility over the events they choose to register, thereby enhancing the performance of message-based computing architectures by reducing unnecessary computation.

Abstract: A program entity that generates code but that does not perturb global state is identified. Code produced by the identified program entity can be assigned an identifier and cached the first time it is executed. Subsequent executions of the program entity can eliminate generation of the code and/or translation of the generated code into native binary code. The runtime generated code and native binary code can be cached in a machine-wide cache, or can be added to the metadata of the assembly generated from the source code of the program entity.

Abstract: Architecture that facilitates performance enhancement in message-based computing across a performance-based interface. When a request from a source is transmitted across the interface to a destination, a filter component in communication with the destination dynamically allows only one or more relevant responses from the destination to transition the interface to the source. This mechanism achieves an even tighter filtering of events while at the same time giving developers more flexibility over the events they choose to register, thereby enhancing the performance of message-based computing architectures by reducing unnecessary computation.