Sun Microsystems, Inc.

International Business Machines Corporation

Sun Micosystems, Inc.

Parcplace Systems

David M Ungar

Mario I Wolczko

James R Kraemer

Robert R Friedlander

Harold Leon Ossher

Antero K P Taivalsaari

Mark N Wegman

Ole Agesen

Sandeep Gopisetty

Samuel Scott Adams

Heiko Hary Ludwig

John Kenyon Gerken, Iii

Nathalie Baracaldo Angel

Peter B Kessler

Bernd J W Mathiske

Douglas Neil Kimelman

Kristen A McIntyre

Steffen Grarup

David C Schwartz

Allan M Schiffman

Phillip M Yelland

L Peter Deutsch

Franklin R Jackson

One embodiment provides a method comprising receiving a request to release a utility holder detachably mounted to a surface mount. The utility holder maintains a utility payload. A set of rotatable holding brackets is coupled to the surface mount in a pivotable fashion to engage the holding brackets with the utility holder in order to mount the utility holder to the surface mount. The method further comprises, in response to receiving the request, powering on a drone attached to the utility holder, and releasing the utility holder from the surface mount by actuating rotation of the holding brackets to disengage the holding brackets from the utility holder, enabling the drone to transport the utility holder from the surface mount to a desired location.

Drone-based smoke detector

A computer system includes processors that execute instructions stored on storage media to sort data using a data gravity well membrane. When executed, the program instructions: convert raw data into a first logical address that describes metadata about a first payload data; compare the first logical address to a second logical address for a second payload data to derive a Hamming distance between the first and second logical addresses; create a data vector for the second payload data that includes the Hamming distance between the first and second logical addresses; sort data vectors into specific data gravity wells on a data gravity wells membrane according to the Hamming distance stored in the data vector; incorporate a context object and a non-contextual data object into the data vector for the second payload data; and sort the second payload data into specific data gravity wells on the data gravity wells membrane.

Population of context-based data gravity wells

A processor-implemented method, system, and/or computer program product generates and implements intuitively comfortable frames of task appropriate frames of reference for multiple dimensions of context constraints for related sets of objects within an integrated development environment (IDE). One or more processors identify a hierarchical set of context constraints for an object, and depict the hierarchical set of context constraints for the object on an IDE using a visual metaphor selected by a user. The processor(s) receive a zoom-in input for a first context constraint in the hierarchical set of context constraints, and place the IDE in mention mode, such that use of the hierarchical set of context constraints against the object is disabled. In response to the IDE being placed in mention mode, the processor(s) display detail of the first context constraint on the IDE, and receive changes to the first context constraint to create a modified first context constraint.

Intuitive frames of task appropriate frames of reference for multiple dimensions of context for related sets of objects within an IDE

A method, system, and/or computer program product optimizes execution of a computation. Multiple slots, each of which is a container for information, are defined. A coordinate tuple is defined for each of the multiple slots. The coordinate tuple describes a position of a slot along multiple dimensions in a slot space. The multiple dimensions describe roles for executing a software object, and each of the multiple dimensions has a same level of primacy such that no dimension has primacy over another dimension in the slot space. Multiple method slots are populated with software method objects that address different contexts and purposes as defined by coordinate tuples of the multiple method slots. Software method objects are retrieved from coordinate tuples in the slot space that match a defined context and purpose of a particular computation, which is propagated to a processor that is executing a particular software method object.

Symmetrical dimensions in context-oriented programming to optimize software object execution

A method, system, and/or computer program product associates new contextual state information about a changed data structure with a beneficial target data. Event data, which describes an event that modifies a data structure, is incorporated into the data structure to create a changed data structure state. New contextual state information, which describes the changed data structure state, is generated and transmitted to multiple beneficial target data stores, wherein applying the new contextual state information to a particular beneficial target data affects an activity that utilizes the particular beneficial target data.

Contextual state of changed data structures

A method and/or system sorts data into data gravity wells on a data gravity wells membrane. A hashing logic executes instructions to convert raw data into a first logical address and first payload data, wherein the first logical address describes metadata about the first payload data. A hardware XOR unit compares the first logical address to a second logical address to derive a Hamming distance between the first and second logical addresses, wherein the second logical address is for a second payload data. A hardware data vector generator creates a data vector for the second payload data, wherein the data vector comprises the Hamming distance between the first and second logical addresses. A hardware data vector sorter then sorts data vectors into specific hardware data gravity wells on a data gravity wells membrane according to the Hamming distance stored in the data vector.

A system comprises a hashing logic, which executes instructions to convert raw data into a first logical address and payload data, where the first logical address describes metadata about the payload data. A hardware translation unit executes instructions to translate the first logical address into a first physical address on a storage device. A hardware load/storage unit stores the first logical address and the payload data at the first physical address on the storage device. A hardware exclusive OR (XOR) unit compares two logical address vectors to derive a Hamming distance between the two logical address vectors. A hardware retrieval unit retrieves other payload data that is stored at a second physical address whose second logical address is within a predefined Hamming distance from the first logical address, thus allowing payload data from the two logical addresses to be grouped/associated with one another.

Stored data analysis

A method (and system) includes providing a memory including a plurality of named locations each holding a value and introducing at least one freshener. The at least one freshener chooses one of the plurality of named locations and re-computes its value.

Inconsistency robustness in scalable OLAP cubes

A modular parser architecture and methods related thereto make use of a number of miniparsers. Each miniparser is capable of receiving input and generating an output dependent thereon. In one embodiment, a lexer or a miniparser capable of lexical analysis receives certain code and provides an abstract syntax tree. Each miniparser performs operations on a set of syntactical constructs to produce a corresponding output syntax tree, which in turn may become an input syntax tree for a next miniparser which may operate on a different set of syntactical constructs.

Modular parser architecture with mini parsers

One embodiment of the present invention provides a system that facilitates implementing multi-mode specification-driven disassembler. During operation, the disassembler receives a machine-code version of a computer program. In order to disassemble a specific machine-code instruction from this machine-code version, the system compares the machine-code instruction against a set of instruction templates for assembly code instructions to identify a set of matching templates. Next, the system selects a matching template from the set of matching templates based on the state of a mode variable, which indicates a specificity mode for the disassembler. The system then disassembles the machine-code instruction using the operand fields defined by the matching template to produce a corresponding assembly code instruction.

Multi-mode specification-driven disassembler

Modern programming languages have stimulated work on systems that dynamically compile or optimize frequently executed portions of programs. In practice, such systems typically rely on ad hoc heuristics. For example, a system may optimize (or compile) some code once its execution count exceeds a given threshold. An analytical model has been developed that expresses performance of such a system. In one embodiment, the model is based on a bytecode frequency histogram, which indicates (for a given program) how many bytecodes run for how many times. It predicts that the optimal compilation threshold will occur where the hazard rate falls through the reciprocal of the break-even point, the number of times a compiled bytecode must be executed to recoup its compilation time. Based on the insight provided by the model, a dynamic compilation control technique has been developed.

Dynamic compilation control

The present invention varies the highlight color of a highlighted display area such that the salience of the highlighted display area remains constant to a user as the highlighted display area varies. A perceptual highlight color is determined based upon the total amount of highlighted display area and the background color of the non-highlighted display area and applied to text selected to be highlighted by a user as well as to text already highlighted on the display. In other embodiments, the perceptual highlight color can be based upon the total amount of highlighted display area and the text color of the text in the highlighted display area, and the total amount of the highlighted display area, the background color of the non-highlighted display area, and the text color.

Perceptual-based color selection for text highlighting

Methods and apparatus for enabling an efficient generational scavenging garbage collection to be performed on a managed memory area are disclosed. According to one aspect of the present invention, a method for reclaiming memory space uses a managed memory area that includes a first area and a second area. The first area is arranged to store recently allocated objects, while the second area being arranged to store older objects. The method includes determining when a first section of the first area in which new objects are to be allocated is substantially filled. When it is determined that the first section is substantially filled, a garbage collection is performed on a second section of the first. After the garbage collection, the second section is set to support new object allocation such that new objects are allocated in the second section, while the first section is reset such that it is no longer arranged to support new object allocation. In one embodiment, performing the garbage collection on the second section includes copying a live object from the second section into the second area.

Method and apparatus for increasing scavenging garbage collection effectiveness

A method and apparatus for testing processes in a computer system are described. In a software process, there exist many test points in the execution of the process where stress testing may be applied. The process is executed with stress testing applied at selected test points and test intervals. The selected test points are based on prime numbers and varied for successive execution iterations. An efficient distribution of evaluated test points is achieved, and all possible test points are ultimately evaluated within a small number of execution iterations. In one embodiment, the total number of test points is first determined. A first execution run is evaluated at selected test points that correspond to prime numbers greater than the square root of the total number of test points. Subsequent execution iterations are then performed evaluating test points at selected test intervals, where the test intervals for respective execution iterations correspond to prime numbers less than or equal to the square root of the total number of test points. The prime numbers for the selected test intervals are chosen in decreasing order, for example.

Method and apparatus for testing a process in a computer system

A method and apparatus for finding bugs related to garbage collection in a virtual machine. For each possible garbage collection point in a stream of execution, a compiler in the virtual machine provides a map that specifies live pointer locations in the stack. In addition, the map identifies those locations in the stack that contain other forms of live data, such as integers. All other locations are considered &ldquo;dead,&rdquo; i.e., no longer in use or never used. At each garbage collection point, &ldquo;dead&rdquo; locations in the stack are overwritten with an invalid pointer value. Because of the overwriting process, any bug in the compiler that causes a live pointer to be omitted from the map also causes the omitted pointer to be overwritten with the invalid pointer value. Regardless of whether garbage collection is actually performed at the garbage collection point where the pointer was omitted from the compiler-generated map, subsequent execution steps that reference the omitted pointer trigger an invalid pointer error. The invalid pointer error may be trapped and identified as a compiler bug related to map generation in the garbage collection process.

Growing community of inventors

Mountain View, CA, United States of America

David M Ungar