John W Peacock

US Patent:

6919826, Jul 19, 2005

Filed:

Dec 19, 2003

Appl. No.:

10/741120

Inventors:

John K. Peacock - Menlo Park CA, US

Assignee:

Sun Microsystems, Inc. - Santa Clara CA

International Classification:

H03M007/34

US Classification:

341 51, 341107

Abstract:

Systems and methods consistent with embodiments of the present invention provide for efficient and compact encoding. In an exemplary method for associating a codeward with a symbol in a file, the frequency of occurrence of the symbols in the file is determined. Next, a threshold is determined. Explicit codewords are assigned to symbols with greater then the threshold. The remaining symbols are ordered in sequence and implicit codewords are assigned to all of remaining symbols. Finally, an encoding table associating the codeword for each symbol is generated.

US Patent:

7075538, Jul 11, 2006

Filed:

Aug 30, 2002

Appl. No.:

10/233271

Inventors:

John Kent Peacock - Menlo Park CA, US

Assignee:

Sun Microsystems, Inc. - Santa Clara CA

International Classification:

G06T 11/20

US Classification:

345441, 345470, 709203

Abstract:

The present invention provides methods and apparatus for a computer network system to provide compact and efficient representations of graphics commands on drawing/displaying lines, circles, etc. The methods and apparatus exploit the redundancies and/or relations of the information in drawing/displaying lines, circles, etc. and allow for fewer bytes and faster transmission rate (e. g. , more graphics primitives per second) to a client tier (e. g. , to a thin client appliance and/or a display on the desktop appliance). For example, one embodiment of the present invention uses commands that take advantage of the structure of spans created by drawing commands to send a base fill command, followed by fills whose locations and size are expressed as deltas with respect to each previous fill in the list. The deltas may comprise a difference between two commands, a difference between a command and another difference, a difference between two differences, and/or a plurality of differences. The differences and/or deltas may be determined by any number of relationships, such as additions and/or subtractions.

US Patent:

7532642, May 12, 2009

Filed:

Mar 11, 2004

Appl. No.:

10/797989

Inventors:

John Kent Peacock - Menlo Park CA, US

Assignee:

Sun Microsystems, Inc. - Santa Clara CA

International Classification:

H04J 3/16

US Classification:

370468, 370477, 370252

Abstract:

A first data communication device (e. g. , a thin client) receives data from a second communication device (e. g. , a server or central computer) over a network. The first data communication device detects an actual bandwidth associated with receiving data from the second data communication device. Based on an actual detected bandwidth associated with receiving the data, the first data communication device generates a bandwidth metric identifying a proposed data rate for transmitting future data from the second communication device to the first data communication device. The first communication device transmits the bandwidth metric to the second data communication device for future data transmissions. Based on use of this technique, the second communication device transmits at or near a maximum possible bandwidth supported by a network link supporting transmission of data to the first data communication device.

US Patent:

7269136, Sep 11, 2007

Filed:

Aug 30, 2002

Appl. No.:

10/232995

Inventors:

John Kent Peacock - Menlo Park CA, US

Assignee:

Sun Microsystems, Inc. - Santa Clara CA

International Classification:

G06F 15/16

US Classification:

370229, 709203

Abstract:

The present invention manages memory buffers in a computer network system. In one embodiment, a managing system on a thin client unit modifies an amount of central processing unit (CPU) resource on the thin client unit that is granted to a server application (e. g. , a X server application). The modification is based on a function of how many network information packets are in a packet queue of the thin client unit. By dropping the amount of CPU resource granted lower and lower as the queue gets more and more full, the server application reduces the rate at which it sends commands, thus giving the thin client unit the opportunity to catch up in processing the commands already in the queue. When the number of packets in the queue passes a high critical threshold, the granted CPU resource is dropped to zero, effectively shutting off the server application. Accordingly, the above embodiment makes sure that the thin client unit is kept as busy as possible because the throttling of the granted CPU resource occurs only when there is an overabundance of work waiting to be done, and the embodiment avoids packet queue overflow by slowing down and eventually stopping the flow of packets from the server application to the thin client unit.

US Patent:

20130080842, Mar 28, 2013

Filed:

Sep 23, 2011

Appl. No.:

13/242932

Inventors:

John Kent Peacock - Menlo Park CA, US

Assignee:

ORACLE INTERNATIONAL CORPORATION - Redwood City CA

International Classification:

G06F 11/07

US Classification:

714 48, 714E11024

Abstract:

In one embodiment, an apparatus for avoiding packet losses is provided. The apparatus includes a first communication device that is configured to receive packets of data over a network from a second communication device and to store information indicative of a sliding window that corresponds to a predetermined number of packets of data. The first communication device is further configured to determine a number of lost packets of data from within the sliding window in response to receiving the packet of data and to determine a maximum value from the sliding window. The maximum value corresponding to a maximum number of lost packets of data for a number of sliding windows. The first communication device is further configured to control the second communication device to adjust a bandwidth rate at which the packets of data are transmitted over the network based on at least the maximum value.

US Patent:

20130265335, Oct 10, 2013

Filed:

Apr 9, 2012

Appl. No.:

13/442438

Inventors:

John Kent Peacock - Menlo Park CA, US

Assignee:

ORACLE INTERNATIONAL CORPORATION - Redwood City CA

International Classification:

G09G 5/32

US Classification:

345684

Abstract:

An apparatus including a first computer for detecting a scrolling event is provided. The first computer is configured to store a destination array including pixels corresponding to a present set of data for a second computer and to store a source array including pixels corresponding to an expected set of data for a display on the second computer after a scrolling event. The first computer is configured to determine hash values of pixel pairs for the pixels of the destination array and to determine hash values of pixel pairs for the pixels of the source array. The first computer is configured to determine a final scroll offset between the pixels in the destination array and the source array based on the hash values. The first computer is configured to transmit pixels indicative of the expected set of data to the second computer based on the final scroll offset for display.

US Patent:

58332065, Nov 10, 1998

Filed:

Mar 5, 1997

Appl. No.:

8/811590

Inventors:

John Leonard Peacock - Fremont CA

Assignee:

Ericsson, Inc. - Research Triangle Park NC

International Classification:

F16M 1126

US Classification:

248677

Abstract:

A support foot for a telecommunications switching cabinet companies a generally planar base member and a support member extending upward from the base member to support the cabinet. The base member includes a plurality of arcuate slots to receive anchor bolts which secure the support foot to the floor. The anchor bolts can be located anywhere within the arcuate slots so that embedded rebar in the floor can be easily avoided.

US Patent:

20170236217, Aug 17, 2017

Filed:

Apr 27, 2016

Appl. No.:

15/140150

Inventors:

- SAN MATEO CA, US
BRIAN ALEXANDER PURVILLE - SAN FRANCISCO CA, US
MICHAEL (XIAOZHENG) YE - FOSTER CITY CA, US
JOHN EDWARD PEACOCK - REDWOOD CITY CA, US

International Classification:

G06Q 40/00
G06Q 30/04

Abstract:

Systems, apparatuses, and methods for establishing a revenue arrangement mechanism for creating and handling revenue arrangements designed to allocate revenue according to accounting rules and procedures for managing revenue. These aspects of a revenue arrangement enable a business to more flexibly and accurately manage and recognize revenue in a manner that complies with applicable accounting regulations and rules. In some embodiments, the methods and systems may be implemented as part of a business data processing platform that is used in conjunction with ERP, eCommerce, and/or CRM data as part of a multi-tenant system for providing order management and order processing services to one or more businesses. Such a platform may also be responsible for accessing and processing revenue, profit, inventory, sales, and other data in order to generate financial metrics that characterize the business(es) and their operations.