Oracle International Corporation

Siebel Systems, Inc.

Nathan Luther Reynolds

Oleksandr Otenko

Joshua Lee Dorr

Mikhail A Dmitriev

Naresh Revanuru

Ola Torudbakken

Adam Messinger

Ballav Bihani

Steven Liu

Patrik Torstensson

Lenny Phan

Scott Oaks

Pallab Bhattacharya

Staffan Larsen

Brian Maulding

Brad Cameron

Mohamed Noureddine Bennani

A system and method for in-person proximity matching that allows a plurality of user electronic devices to identify and match with one another based on a compatibility profile. The matching is done using a near-field communication protocol, such as Bluetooth or Wi-Fi. The invention allows matching of users when they are within the near proximity, which is defined as approximately 1000 meters.

System and method for matching based on proximity

Systems and methods for hot method call graph analysis. An exemplary method can provide a hot method call graph analyzer. The method can receive a generated call graph, the generated call graph comprising a plurality of branches. The method can automatically traverse each branch of the generated call graph. For each traversed branch, the method can generate and store a list of leaf methods of each branch along with a corresponding execution time and number of samples of each leaf method, resulting in plurality of leaf method lists. The method can combine each of the plurality lists of leaf methods in an overall list of leaf methods of the generated call graph, resulting in a complete list of leaf methods of the generated call graph, which can be provided via, for example, a user interface. The systems and method described can additionally perform similar analysis for non-leaf methods.

System and method for hot method call graph analysis

Techniques for managing object pools within computer storage are disclosed. In some embodiments, a runtime environment determines, for a respective object pool allocated in volatile or non-volatile storage of a computing system, whether a new object has been added to the respective object pool within a threshold timeframe. Responsive to determining that a new object has not been added to the respective object pool within the threshold timeframe, the runtime environment removes a subset of one or more objects from the respective object pool. In some embodiments, the runtime environment monitors a set of one or more garbage collection metrics. Responsive to determining that the set of one or more garbage collection metrics have satisfied one or more thresholds, the runtime environment identifies and removes idle objects from at least one object pool.

Heap, garbage collection, and empty-sensitive object pools

De-duplication of immutable data items at runtime may include identifying a set of potentially duplicate immutable data items in use by one or more applications. The applications may access the immutable data items through pointers of respective objects corresponding to the immutable data items. A de-duplication component executing distinctly from the applications may analyze the identified set of potentially duplicate immutable data items to determine two or more that have identical content and may then modify one or more pointers of the corresponding objects so that at least two of the pointers point to a single immutable data item.

De-duplicating immutable data at runtime

Systems and methods are provided for providing parallel muxing between servers in a cluster. One such system can include a cluster of one or more high performance computing systems, each including one or more processors and a high performance memory. The cluster communicates over an InfiniBand network. The system can also include a middleware environment, executing on the cluster, that includes one or more application server instances. The system can further include a plurality of muxers, wherein each application server instance includes at least one muxer. Each muxer can receive information from a plurality of threads to transmit to a different muxer on a different application server instance over the Infiniband network using a plurality of parallel channels.

System and method for parallel multiplexing between servers in a cluster

A computer-controlled method can include determining at least one rarely-used field within a class, creating a shadow structure corresponding to the class, and moving the at least one rarely-used field from the class to the shadow structure. The method can also include adding a shadow reference to the class, the shadow reference corresponding to the shadow structure.

Disposal of rarely used member variables via shadow structures

A system and method for providing a middleware machine or similar platform. In accordance with an embodiment the system (referred to herein in some implementations as 'Exalogic') comprises a combination of high performance hardware, together with an application server or middleware environment, to provide a complete Java EE application server complex which includes a massively parallel in-memory grid, can be provisioned quickly, and can scale on demand. In accordance with an embodiment, the system can be deployed as a full, half, or quarter rack, or other configuration, that provides an application server grid, storage area network, and InfiniBand network, which support the execution of an application server, middleware or other functionality such as, for example, WebLogic Server, JRockit or Hotspot JVM, Oracle Linux or Solaris, and Oracle VM. Additional features of the system can include, e.g. Zero Buffer Copies, Scatter/Gather I/O, T3 Connections, and Lazy Deserialization.

System and method for providing zero buffer copying in a middleware machine environment

Embodiments of the present invention provide techniques, including systems, methods, and computer readable medium, for dynamic atomic bitsets. A dynamic atomic bitset is a data structure that provides a bitset that can grow or shrink in size as required. The dynamic atomic bitset is non-blocking, wait-free, and thread-safe.

Dynamic atomic bitsets

Embodiments of the present invention provide techniques, including systems, methods, and computer readable medium, for dynamic atomic arrays. A dynamic atomic array is a data structure that provides an array that can grow or shrink in size as required. The dynamic atomic array is non-blocking, wait-free, and thread-safe. The dynamic atomic array may be used to provide arrays of any primitive data type as well as complex types, such as objects.

Dynamic atomic arrays

A method, system, and computer program product that convert a real number from a floating point representation to a character string. Mantissa bits are extracted from the floating-point representation of a value into an integer format. The mantissa bits of the integer format may be shifted left by a number of positions that is equal to a base 2 exponent of a first representation of the value. Prior to converting the value, the floating-point representation of the value can be divided by 2, where n is the number of the mantissa bits in the floating-point representation of the value. A set of operations can then be performed to convert a result of the division to a number greater than or equal to 1.0 and less than 10.0. The set of operations may include multiplication operations and/or retrieving a constant from a lookup table.

Growing community of inventors

Mesa, AZ, United States of America

Nathan Luther Reynolds