Oracle America, Inc.

Sun Microsystems, Inc.

Oracle International Corporation

Darrin Paul Johnson

Eric Christopher Saxe

Kais Belgaied

Anders D Persson

Cesar A C Marcondes

William H Moore

Sunay Tripathi

Bart Smaalders

Erik Nordmark

Bruce W Curtis

Sherry Qianhong Moore

Sean McGrath

Damien Farnham

Darren J Reed

Tabriz I Holtz

Jeffrey S Bonwick

Hsiao-Keng Jerry Chu

Jonathan Chew

Jonathan I Schwartz

Fintan Ryan

George Wilson

Randall S Fishel

Nicolas G Droux

James Prescott Hughes

Samita Chakrabarti

Eric T Cheng

Rajagopal Kunhappan

Kishore Kumar Pusukuri

Bhargava K Yenduri

Konstantin Ananyev

Mark C Powers

Vladimir Kotal

William D Holler

Brian Ruthven

Christopher Beal

A method for performing a deferred system dump includes storing a preservation list referencing physical memory addresses allocated to pages by an initial operating system executing on a computer system. The method further includes identifying a subset of the pages that are at least partially allocated below a first physical memory address, relocating the subset to new physical memory addresses above the first physical memory address, and updating the preservation list with the new physical memory addresses. The method further includes transferring control of the computer system from the initial operating system to a subsequent operating system. The subsequent operating system accesses the preservation list to identify preserved pages. The method further includes assigning each of the preserved pages to an address segment in an address space of the subsequent operating system, storing a subset of the preserved pages, and freeing the preserved pages.

Method and system for deferring system dump

In general, the invention relates to a non-transitory computer readable medium comprising instructions, which when executed by a processor perform a method. The method includes obtaining lock overhead times for a plurality of threads, generating a set of thread groups, wherein each of the plurality of threads is assigned to one of the plurality of thread groups based on the lock overhead times, allocating at least one core of a multi-core system to each of the plurality of thread groups, and assigning a time-quantum for each of the plurality of thread groups, wherein the time-quantum for each of the plurality of thread groups corresponds to an amount of time that threads in each of the plurality of thread groups can execute on the at least one allocated core.

Method and apparatus for efficient scheduling of multithreaded programs

In general, embodiments of the invention relates to a method for conveying hardware resources from a host (OS) executing on a computer system. The method includes obtaining host hardware information by the host OS, wherein the host hardware information specifies a plurality of physical hardware components of the computer system, sending the host hardware information to a guest OS executing within the host OS, generating, by the guest OS, a resource request using the host hardware information, sending, by the guest OS, the resource request to the host OS, and in response to receiving the resource request, allocating, by the host OS, guest hardware resources, where the guest hardware resources include at least one of the physical hardware components in the resource request.

Guest-initiated resource allocation request based on comparison of host hardware information and projected workload requirement

A system and method for routing packets. The method includes receiving a first packet from an intermediate network by a first network interface card (NIC) operatively connected to a host, where the first packet originates from a first remote network, where the first NIC is operatively connected to the intermediate network, and where the first packet, the intermediate network, and the first NIC use a first network protocol. The method further includes classifying, by the first NIC, the first packet based on the first remote network, sending the first packet to a first receive ring in the first NIC, sending the first packet from the first receive ring to a first non-global container, and converting the first packet, using a first converter located in the first non-global container, to obtain a first converted packet, where the first converted packet and the first remote network use a second network protocol.

N-way routing packets across an intermediate network

A system for dispatching a thread to a resource obtains a thread and utilization data for all resources. The system determines if there is a thread-resource affinity. The system uses thread-resource affinity to identify a resource and a timestamp for when the thread last completed executing on the resource. The system determines if the resource qualifies under a dispatch policy. The system uses utilization data to determine a timestamp for when the resource last transitioned to a not powered state. When the second timestamp precedes the first timestamp, the system dispatches the thread to the resource and generates a power management event. The system determines if the power management event satisfies a throttle policy. The system discards the power management event when throttle policy is unsatisfied and determines whether to adjust the current power state of the resource based on the power management event when throttle policy is satisfied.

Method and system for event-based management of hardware resources using a power state of the hardware resources

A method for transferring execution to a subsequent operating system. The method includes rebooting a computer system. Rebooting the computer system includes initializing an in-kernel boot loader. The in-kernel boot loader executes in a kernel of an initial operating system. Rebooting the computer system further includes populating, by the in-kernel boot loader, an initialization data structure using system data gathered during the execution of the initial operating system, loading, by the in-kernel boot loader, the subsequent operating system, and transferring control of the computer system from the initial operating system to the subsequent operating system. The subsequent operating system accesses the initialization data structure to identify available hardware. The method further includes executing the subsequent operating system on the available hardware of the computer system.

Method and system for providing information to a subsequent operating system

A system for self-tuning hardware resources includes a processor, a hardware resource, an operating system (OS), a metric monitoring unit (MMU), and a configuration engine (CE). The OS determines: the hardware resource; a metric for monitoring the hardware resource; a hardware resource management policy for the hardware resource; and a primary and secondary sub-ranges for the metric. The OS sends a hardware resource management policy directive to the CE. The MMU monitors the hardware resource to obtain data for the metric. The CE receives the hardware resource management policy directive, determines the primary and secondary sub-ranges from the hardware resource management policy directive, obtains data for the metric from the MMU. When data is outside the primary sub-range and inside the secondary sub-range, the CE determines and executes a hardware resource optimization routine to bring hardware resource utilization into compliance with the primary sub-range.

Method and system for self-tuning of hardware resources

In general, the invention relates to a method for sending a packet from an application to a destination. The method includes opening a network connection between the application and the destination, tuning at least one layer in a network stack, based on application information associated with the application, to obtain a tuned network stack, wherein the network stack is associated with the network connection, receiving the packet from the application, processing the packet using the tuned network stack to obtain a processed packet, and sending the processed packet to the destination, wherein the processed packet is received by the destination.

Method and system for network stack tuning

In general, the invention relates to a method for processing packets. The method includes receiving a first packet by a network interface card (NIC) connected to a host, classifying the first packet using a classifier, sending the first packet to a receive ring based on a classification of the first packet by the classifier, and sending the first packet from the receive ring to a first virtual network interface card (VNIC) located on the host. The method further includes determining, using a first policy associated with the first VNIC, whether to process the first packet using offload hardware. When the first packet is to be processed using the offload hardware, the method includes sending the first packet to the offload hardware, receiving a first processed packet from the offload hardware by the first VNIC and sending the first processed packet from the first VNIC to a first packet destination.

Method and system for onloading network services

A method for configuring a network on a host includes obtaining a first virtual network stack and a second virtual network stack on the host, configuring a first transport layer implementation on the first virtual network stack, configuring a second transport layer implementation on the second virtual network stack, receiving a packet by the host, sending a packet to the first virtual network stack, and processing the packet using the first transport layer implementation.

Network stack instance architecture with selection of transport layers

In general the invention relates to a system. The system includes processors each having a processing state. The system further includes a dispatcher operatively connected to the plurality of processors and configured to: receive a first thread to dispatch, select one of the processors to dispatch the thread to based on the processing state the processors and a power management policy, and dispatch the thread to the selected one of the plurality of processors.

Method and system for power-management aware dispatcher

A device, system, and method are directed towards managing threads in a computer system with one or more processing units, each processing unit having a corresponding hardware resource. Threads are characterized based on their use or requirements for access to the hardware resource. The threads are distributed among the processing units in a configuration that leaves at least one processing unit with threads that have an aggregate zero or low usage of the hardware resource. Power may be reduced or turned off to the instances of the hardware resource that have zero or low usage. Distribution may be based on one or more of a number of specifications or factors, such as user power management specifications, power usage, performance, and other factors.

Hardware utilization-aware thread management in multithreaded computer systems

A computer readable medium having software instructions that, when executed, perform a method for preserving data stored in a file system with a plurality of files. The method involves determining whether storage capacity of the file system has reached a threshold level, wherein the threshold level is stored in at least one of a plurality of size-reducing policies, obtaining a criterion from the at least one size-reducing policy, identifying a subset of the plurality of files that match the criterion, accessing metadata of each of the identified subset of files, wherein the metadata of each of the identified subset of files comprises at least one option for reducing a size of the file, and performing a size-reducing action to reduce a size of each of the identified subset of files based on the option for reducing the size of each of the identified subset of files and the criterion.

Method and system for attribute encapsulated data resolution and transcoding

Techniques for isolating software regressions are provided. In one approach, QTrace is used to generate DTrace scripts to gather timing information of one or more portions of source code during a test of particular version of a program. Based on results of one or more tests of multiple versions of a program, a regression is identified with respect to a particular portion of source code. It is determined that the particular portion of source code was changed during an intermediate version of the program (i.e., between two tests). The intermediate version and/or the particular portion of source code are identified as being a potential source of the regression.

Determining causes of software regressions based on regression and delta information

A computer readable storage medium including executable instructions for heuristics-based task scheduling. Instructions include receiving a first event notification associated with a first event, where the first event is determined from the first event notification. Instructions further include determining whether a predicate for an action is satisfied by the first event, where the action predicate, the action, and an action parameter are associated with a task object in a task pool. Instructions further include obtaining the action parameter when the action predicate is satisfied by the first event, where a priority is assigned using a heuristics policy to the task object based on the action parameter. Instructions further include inserting the task object into a task queue using the assigned priority. The action associated with the task object is performed by an execution thread. The performance of the action is a second event associated with a second event notification.

Growing community of inventors

Mountain View, CA, United States of America

Darrin Paul Johnson