Tidalscale, Inc.

Packeteer, Inc.

Hewlett Packard Enterprise Development LP

Earthtrax, Inc.

Vita Systems, Inc.

Mark Hill

Isaac Robert Nassi

David P Reed

Kleoni Ioannidou

Michael Berman

Brian Moffet

I-Chun Fang

Jeffrey Paul Radick

Keith R Reynolds

Anne Cesa Klein

Bryan Kerry Devlin

Guy G Riddle

Brett D Galloway

Keith Reynolds

Frederick Chun Bong Wong

Robert L Packer

Weng-Chin Yung

Robert E Purvy

Jeffrey G Ichnowski

David Tze-Si Wu

James Wei-Ching Kao

Handling frequently accessed pages is disclosed. An indication is received of a stalling event caused by a requested portion of memory being inaccessible. It is determined that the requested portion of memory is a frequently updated portion of memory. The stalling event is handled based at least in part on the determination that the requested portion of memory is a frequently updated portion of memory.

Handling frequently accessed pages

Entanglement of pages and threads is disclosed. An indication is received of a stalling event caused by a requested portion of memory being inaccessible. It is determined that the requested portion of memory is an entangled portion of memory that is entangled with a physical node in a plurality of physical nodes. A type of the entangled portion of memory is determined. The stalling event is handled based at least in part on the determined type of the entangled portion of memory.

Entanglement of pages and guest threads

Dynamic scheduling is disclosed. A plurality of physical nodes is included in a computer system. Each node includes a plurality of processors. Each processor includes a plurality of hyperthreads. In response to receiving an indication of an event occurring, a search is performed for a queue in a set of queues on which to place a virtual processor that had been waiting on the event. Queues in the set of queues correspond to hyperthreads in a physical node in the plurality of physical nodes. The queues in the set of queues are visited according to a predetermined traversal order.

Scheduling resuming of ready to run virtual processors in a distributed system

Hierarchical stalling strategies are disclosed. An indication is received of a stalling event caused by a requested resource being inaccessible. In response to receiving the indication of the stalling event, a set of cost functions usable to determine how to handle the stalling event is selected based at least in part on a type of the stalling event. The stalling event is handled based at least in part on an evaluation of the set of cost functions selected based at least in part on the type of the stalling event.

Hierarchical stalling strategies for handling stalling events in a virtualized environment

Associating working sets and threads is disclosed. An indication of a stalling event is received. In response to receiving the indication of the stalling event, a state of a processor associated with the stalling event is saved. At least one of an identifier of a guest thread running in the processor and a guest physical address referenced by the processor is obtained from the saved processor state.

Associating working sets and threads

Dynamic scheduling of virtual processors in a distributed system

A method and system for controlling network traffic with different tags within the same connection by applying policies for each tag are disclosed. A method is disclosed in which incoming traffic is received. A traffic class is assigned to the traffic class. Outgoing traffic is controlled based on the assigned policy for the incoming traffic.

Method and system for controlling network traffic within the same connection with different packet tags by varying the policies applied to a connection

Methods, apparatuses and systems directed to an auction optimization system that assists users in determining one or more parameters associated with a planned auction. In one embodiment, the auction optimization system computes a predicted final auction price for a given item based on historical auction data associated with the same or similar items. In other embodiments, the auction optimization system is operative to compute suggestions for various auction parameters, such as starting price, start time, duration, and reserve price. In certain embodiments, the auction optimization system uses novel data gathering techniques that minimize the load on on-line auction facilities and gather data in a manner consistent with the use policies associated with on-line auction facilities.

Auction optimization system

Methods, apparatuses and systems directed to the identification of a set of auctions which are similar, or relevant, to a contemplated or model auction. In one embodiment, the similar auction identification system uses a model auction, including keywords and other information contained in a data structure that characterize attributes of the auction, as input data to identify a set of auctions that are similar or analytically relevant to the model auction. In one implementation, the resulting set of identified auctions allows a user to efficiently analyze the auctions in assessing the starting parameters of a contemplated auction, or for assessing the latest bid price in a currently pending auction. In one implementation, the set of identified auctions can be used as an input to an auction optimization system that, for example, computes a set of suggested auction parameters for a contemplated auction, and/or computes one or more predicted behavioral attributes for a contemplated auction.

Method and system for similar auction identification

Methods, apparatuses and systems facilitating enhanced classification of network traffic that extends beyond analysis of explicitly presented packet attributes and holistically analyzes data flows, and in some implementations, related data flows against known application behavior patterns to classify the data flows. Implementations of the present invention facilitate the classification of encrypted or compressed network traffic, or where the higher layer information in the data flows are formatted according to a non-public or proprietary protocol.

Heuristic behavior pattern matching of data flows in enhanced network traffic classification

Growing community of inventors

Los Altos, CA, United States of America

Mark Hill