Dana M Henriksen, 62790 E 400 N, Lindon, UT 84042

6567873, May 20, 2003

Feb 29, 2000

09/516271

Dana M. Henriksen - Lindon UT

Novell, Inc. - Provo UT

G06F 1314

710240, 709104

A method and apparatus for improving multi-processor performance where the various processors are competing for spinlock acquisition is described. If a spinlock testing processor fails to acquire the spinlock, it re-tries for access after a small wait interval has passed. If the spinlock is still locked, the testing processor retries with an additional increase in the wait interval. Subsequent re-tries progressively increases the wait interval until a maximum wait interval is reached. At this point, the wait interval is reset back to an initial small wait interval and the procedure is repeated until the processor gains access to the spinlock.

6591397, Jul 8, 2003

Sep 28, 2001

09/966032

Dana M. Henriksen - Lindon UT

Novell, Inc. - Provo UT

G06F 1100

714807, 714799

A checksum generator includes at least one adding circuit for processing a segment of a given message. Associated with the adding circuit is a register for temporarily holding the partial sum that is being calculated by the adding circuit. The register is configured to hold a partial sum that is larger than the message segments being added by the adding circuit. The partial sums can thus expand into the register, eliminating the creation of a carry bit that must be added back in during each add cycle. After the last message segment has been processed, the adding circuit preferably adds the high order portion of the register to the low order portion and adds back any carry bit generated thereby to produce a checksum value that may be loaded into the given message.

7447875, Nov 4, 2008

Nov 26, 2003

10/724269

Dana Henriksen - Lindon UT, US

Novell, Inc. - Provo UT

G06F 9/30

712202, 710 54

A method and system for managing global queues is provided. In one example, a method for implementing a global queue is provided. The queue has a head pointer, a tail pointer, and zero or more elements. The method comprises one or more functions for managing the queue, such as an “add to end” function, an “add to front” function, an “empty queue” function, a “remove from front” function, a “remove specific” function and/or a “lock queue” function. In some examples, the method enables an element to be added to the queue even when the queue is in a locked state.

2007022, Sep 20, 2007

Nov 2, 2006

11/555824

Richard Duane Jones - Elk Ridge UT, US
Dana M. Henriksen - Lindon UT, US

NOVELL, INC. - Provo UT

G06F 7/00

707101

Data partitioned onto two or more storage devices is presented to a user as if the data resided on a single storage area. Data is divided between the storage areas based on policies. Data on the primary storage can utilize frequent back up or other storage management to ensure the accuracy of the data. The data on the secondary storage can employ other data management than the data management for the primary storage. The subdirectory structure is replicated in each area so a data file can be located in either physical area. This allows data files to migrate between the storage areas based on policy.

6324670, Nov 27, 2001

Mar 24, 1999

9/275201

Dana M. Henriksen - Lindon UT

Novell, Inc. - Provo UT

G06F 1100
G06F 1110
H03M 1300

714807

A checksum generator includes at least one adding circuit for processing a segment of a given message. Associated with the adding circuit is a register for temporarily holding the partial sum that is being calculated by the adding circuit. The register is configured to hold a partial sum that is larger than the message segments being added by the adding circuit. The partial sums can thus expand into the register, eliminating the creation of a carry bit that must be added back in during each add cycle. After the last message segment has been processed, the adding circuit preferably adds the high order portion of the register to the low order portion and adds back any carry bit generated thereby to produce a checksum value that may be loaded into the given message.

2020002, Jan 23, 2020

Jul 23, 2018

16/042409

- San Jose CA, US
Ryan Michael Okelberry - Provo UT, US
Dana Marlow Henriksen - Lindon UT, US
Mel J. Oyler - Pleasant Grove UT, US
Hoi-Tauw Jozef Chou - Dublin CA, US
Kevin Wayne Kingdon - Hayward CA, US

G06F 11/10
G06F 11/07
G06F 3/06

A disclosed method is performed at a fault-tolerant object-based storage system including M data storage entities, each is configured to store data on an object-basis. The method includes obtaining a request to store N copies of a data object and in response, storing the N copies of the data object across the M data storage entities, where the N copies are distributed across the M data storage entities. The method additionally includes generating a first parity object for a first subset of M copies of the N copies of the data object, where the first parity object is stored on a first parity storage entity separate from the M data storage entities. The method also includes generating a manifest linking the first parity object with one or more other subsets of M copies of the N copies of the data object.

2019026, Aug 29, 2019

Jun 25, 2018

16/017697

- San Jose CA, US
Dana Henriksen - Lindon UT, US
Mel J. Oyler - Pleasant Grove UT, US
Hoi-Tauw Jozef Chou - Dublin CA, US
Kevin Wayne Kingdon - Hayward CA, US

G06F 3/06
G06F 11/30
G11B 20/12

Various implementations of hard disk track management method, device, and system disclosed herein enable improvements of file system write bandwidth. In various implementations, a method is performed at a disk storage including a file controller controlling a disk drive with a disk platter that is divided into multiple regions including a fast region. In various implementations, the method includes receiving a write request associated with data to be written to the disk drive and in response, determining a disk utilization of the disk drive. In various implementations, the method further includes placing the disk drive in a surge mode to write the data to the fast region upon determining that the disk utilization is above a first threshold, and placing the disk drive in a non-surge mode to write the data to other regions of the multiple regions upon determining that the disk utilization is below a second threshold.

2017031, Nov 2, 2017

Jul 12, 2016

15/207895

- San Jose CA, US
Dana Marlow Henriksen - Lindon UT, US
Mel J. Oyler - Pleasant Grove UT, US
Kevin Wayne Kingdon - Hayward CA, US

G06F 11/10
G06F 3/06
G06F 3/06
G06F 3/06

Various implementations disclosed herein provide fault-tolerant enterprise object storage system that can store small objects. In various implementations, the fault-tolerant enterprise object storage system writes a small object into an aggregate object that is distributed across a plurality of storage entities. In some implementations, the small object is at least an order of magnitude smaller than the aggregate object, and the small object is within the same order of magnitude of a block unit addressable within each of the storage entities. In some implementations, based on the small object, the storage system updates the parity data associated with the aggregate object in response to writing the small object into the aggregate object. In various implementations, the storage system updates a processed data end offset indicator that indicates that the parity data for the aggregate object includes valid data up to and including the small object.