Sun Microsystems, Inc.

Oracle America, Inc.

Linkedin Corporation

Motorola Corporation

Yahoo! Inc.

Swee Boon Lim

Sanjay R Radia

Thomas K Wong

Peter B Kessler

Michael J Wookey

Panagiotis Tsirigotis

Ken M Cavanaugh

Anita Jindal

Robert J Goedman

Jean Chouanard

Michael W Patrick

David M Brownell

Whei-Ling Chang

Graham Hamilton

Alan Michael Snyder

Christian J Callsen

Douglas Alan Young

Ganesan Venkatasubramanian

Rohit Chandra

Andrew Feng

Raymond Paul Stata

Dwight F Hare

Michael L Powell

Evgeniy Makeev

Li-Wen Chen

Scott Banachowski

Jacob Y Levy

Jeffrey D Nisewanger

Jens Pillgram-Larsen

Peter Vanderbilt

Dustin Kwong

Jarek Rudzinski

Sanjay Gurudatt Nadkarni

Robert Gittins

Rohit Garg

Benjamin Lerner

Donald J Kretsch

Jeffrey Budzinski

Wesley E Mitchell

Ashish Singhai

Paul McDill Hobbs

Devendra R Jaisinghani

Techniques for managing software dependencies are described. For example, a dependency specification that pertains to a first product is accessed. The product may be a collection of artifacts and may provide a software functionality. A determination may be made, based on the dependency specification, that the first product has a dependency on a second product. Metadata pertaining to the second product may be accessed. A valid version of the second product may be identified based on the metadata. The valid version may be usable at build time of the first product.

Systems and methods for software dependency management

Methods and apparatus for executing an application are disclosed. In accordance with one embodiment, a request is received. One or more of a plurality of module types are instantiated such that a plurality of module objects are generated. A query plan linking the plurality of module objects is executed such that a response to the request is generated. The response is then returned.

Composition model for cloud-hosted serving applications

A system and method are provided for sticky routing of a user's service requests and connections to a distributed service hosted by multiple data centers. Sticky routing data are generated when a user first connects, to include member ID, preferred data center, a user bucket associated with one data center, a generation of the bucket, a generation of the user's sticky routing data, and timing information identifying a time of issue and/or a time of expiration of the routing data. A user bucket is either online (accepts new users; their requests are routed to the associated data center), offline (not accepting new users; existing users are expelled and must join a different bucket), or closed (not accepting new users; existing users' requests continue to be routed to the associated data center). All of a user's requests, from all devices, are thus routed to one data center, based on member ID.

Sticky routing

In a computer communication network, affinity between a client and server is established dynamically. The client desiring affinity sends a request to establish affinity to an available server. The server can then respond by sending the client a redirect to an elected server, with which the client already has affinity. If there is no such elected server, the server establishes affinity between itself and the client.

Method and system for managing client-server affinity

In one embodiment, a method and apparatus for collaborative data redundancy for configuration management database is disclosed. The method includes requesting, by a server of a configuration tracking system, an agent of the configuration tracking system to retrieve asset data when a copy of the asset data located in the server becomes corrupted, retrieving by the agent the requested asset data from one or more assets, and transferring by the agent the asset data to the server without utilizing data redundancy services performed outside of the configuration tracking system. Other embodiments are also disclosed.

Collaborative data redundancy for configuration tracking systems

In one embodiment, an apparatus for directory-based web service distribution is disclosed. The apparatus includes a directory and a request client to initiate a request for a web service, the request client including an application middleware having invocation framework with embedded distribution logic to distribute the request to a destination pod, the destination pod to compute a subset of a state associated with the web service, wherein the distribution logic to distribute the request based on a lookup value extracted from the request and submitted to the directory to determine the destination pod. Other embodiments are also disclosed.

Web service invocation framework with integrated directory-based distributor

A method involving enqueuing, according to a policy associated with an offering, a document in a queue for delivery to a first document endpoint; transmitting the document to the first document endpoint; retaining a copy of the document and marking the copy to indicate transmission of the document; and upon receipt of an indication, unmarking the copy of the document using the processor; and transmitting the copy to a second document endpoint.

Dynamic sending policies and client-side disaster recovery mechanism for messaging communication

A quality of service policy for one or more documents for transmission from the local storage to one or more end points for said documents through a communication system is retrieved from a remote registry associated with an offering, and said documents are enqueued according to said quality of service policy. In some cases, the registry may be co-hosted with at least one of the document end points. The quality of service policy may be derived from a transport policy for said one or more documents, and may even be such as to not specify a quality of service for delivery of some or all of the documents. In some cases, XML documents may be used to set forth the quality of service policies.

Method and system for dynamically changing quality of service for message communication

Methods and systems for effecting cleanup and other policies for queues and similar data stores, which policies account for preferences of consumers of the data so stored. Queuing policies for local storage of one or more documents for transmission from the local storage to one or more end points for said documents are retrieved from a remote registry. Upon such retrieval, the documents are enqueued according to the queuing policies, unless, prior to such enqueuing the queues into which the documents are to be placed require creation or clean-up, for example according to one or more queue quota policies. In some cases, the documents are queued according to associated qualities of service to be accorded to delivery of said documents. Such qualities of service may be specified in the queuing policy.

Dynamic quota policy for queuing mechanism

A system and method provides dynamic and static type support for multiple definitions of individual types in a distributed object environment. Fully scoped object names incorporating prefixes are used to distinguish objects. The fully scoped names are used for both dynamic type determination through an interface repository and for statically compiled types in client and server stub routines. In the interface repository, a prefix naming context is provided for each root interface definition language context, allowing multiple definitions for objects with the same interface definition language object name, where each such definition resides in a separate prefix naming context. In one embodiment, the prefix naming contexts are defined by prefix interface definition objects. In another embodiment, the fully scoped object names are embedded by an interface definition language compiler in stub and skeleton code routines. RRS.

Method and system for type identification for multiple object interfaces in a distributed object environment

A system and method are provided for recovering from the failure of a mirrored boot device (e.g., disk drive). One method is implemented for a computer system that mirrors two (or more) boot devices. If one of the devices fails, a set of compensating activities is performed, which may include removing the failed device from the list of devices from which the system may boot, deleting mirror state data from the device and removing the failed device from the mirroring scheme. After the failed device is repaired or replaced, a set of reintegrating activities is performed, which may include including the device in the mirroring scheme, restoring mirror state data to the device and adding the device to the list of boot devices. Even if the system includes only two mirrored boot devices and one of them fails, it can continue operation and can reboot successfully without using stale data.

Method and apparatus for recovering from failure of a mirrored boot device

Data structures, methods and devices for reducing computing overhead by utilizing different invocation paths for same process and different process invocations in a distributed client/server based computing system are disclosed. In one aspect of the invention, calls to a servant that do not share the same process as the requesting client are routed through a transport layer, and calls to servants that do share the same process as the requesting client are passed directly to the servant, thereby bypassing the transport layer. In another aspect of the invention, distinct remote and local method tables are provided to facilitate intelligent routing of requests. In still another aspect of the invention, the appropriate method table for an object reference is intelligently selected based upon the location of the identified object.

Method and apparatus for improving the performance of object invocation

A covert channel is established between a network service and one or more service monitors in a service group. The covert channel minimizes overhead by providing an indication of the status of the service through use of operating system utilities rather than conventional remote procedure calls (RPCs) or posting methods. The covert channel relies on one or more communication files established and updated by the service and having attributes which are in proportion to the workload of the service. By monitoring these attributes, the service monitor is able to determine the status of the service, including its workload and availability, without incurring costly operational overhead.

Method to monitor and control server applications using low cost covert channels

Data structures, methods, and devices for facilitating servant invocation in a distributed client-server based object oriented operating system are disclosed. In one aspect of the invention, descriptor data structures, which contain a typecode indicator, a marshaling function identifier, and an unmarshaling function identifier, are used to enable modules of application code to be shared between different objects, thereby facilitating servant invocation by increasing the amount of commonized code in the operating system. In another aspect of the invention, a server invocation object is used in the execution of a method call. In still another aspect of the invention, a commonized code base is used to process typecode interpreted and compiled calls to a server process.

Transport independent invocation and servant interfaces that permit both typecode interpreted and compiled marshaling

Growing community of inventors

Cupertino, CA, United States of America

Swee Boon Lim