Dr. Pierce graduated from the Oklahoma State University Center for Health Sciences College of Osteopathic Medicine in 2004. He works in Tulsa, OK and specializes in Psychiatry. Dr. Pierce is affiliated with Shadow Mountain Behavioral Health System.
Name / Title
Company / Classification
Phones & Addresses
Aaron Pierce Principal
Mach. 3 Delivery Repair Services
100 S Beth Cir, Anaheim, CA 92806
Us Patents
Erasure Coding And Replication In Storage Clusters
Don BAKER - Austin CA, US Paul R.M. CARPENTIER - Boechout, BE Andrew KLAGER - Austin TX, US Aaron PIERCE - Austin TX, US Jonathan RING - Austin TX, US Russell TURPIN - Austin TX, US David YOAKLEY - Austin TX, US
Assignee:
CARINGO, INC. - Austin TX
International Classification:
H03M 13/05 G06F 11/10
US Classification:
714763, 714E11034
Abstract:
A cluster receives a request to store an object using replication or erasure coding. The cluster writes the object using erasure coding. A manifest is written that includes an indication of erasure coding and a unique identifier for each segment. The cluster returns a unique identifier of the manifest. The cluster receives a request from a client that includes a unique identifier. The cluster determines whether the object has been stored using replication or erasure coding. If using erasure coding, the method reads a manifest. The method identifies segments within the cluster using unique segment identifiers of the manifest. Using these unique segment identifiers, the method reconstructs the object. A persistent storage area of another disk is scanned to find a unique identifier of a failed disk. If using erasure coding, a missing segment previously stored on the disk is identified. The method locates other segments. Missing segments are regenerated.
Erasure Coding And Replication In Storage Clusters
- Austin TX, US Paul R.M. CARPENTIER - Boechout, BE Andrew KLAGER - Austin TX, US Aaron PIERCE - Austin TX, US Jonathan RING - Austin TX, US Russell TURPIN - Austin TX, US David YOAKLEY - Austin TX, US
A cluster receives a request to store an object using replication or erasure coding. The cluster writes the object using erasure coding. A manifest is written that includes an indication of erasure coding and a unique identifier for each segment. The cluster returns a unique identifier of the manifest. The cluster receives a request from a client that includes a unique identifier. The cluster determines whether the object has been stored using replication or erasure coding. If using erasure coding, the method reads a manifest. The method identifies segments within the cluster using unique segment identifiers of the manifest. Using these unique segment identifiers, the method reconstructs the object. A persistent storage area of another disk is scanned to find a unique identifier of a failed disk. If using erasure coding, a missing segment previously stored on the disk is identified. The method locates other segments. Missing segments are regenerated.
Erasure Coding And Replication In Storage Clusters
- Austin TX, US Paul R.M. CARPENTIER - Boechout, BE Andrew KLAGER - Austin TX, US Aaron PIERCE - Austin TX, US Jonathan RING - Austin TX, US Russell TURPIN - Austin TX, US David YOAKLEY - Austin TX, US
International Classification:
G06F 11/10 G06F 3/06 H04L 29/08
Abstract:
A cluster receives a request to store an object using replication or erasure coding. The cluster writes the object using erasure coding. A manifest is written that includes an indication of erasure coding and a unique identifier for each segment. The cluster returns a unique identifier of the manifest. The cluster receives a request from a client that includes a unique identifier. The cluster determines whether the object has been stored using replication or erasure coding. If using erasure coding, the method reads a manifest. The method identifies segments within the cluster using unique segment identifiers of the manifest. Using these unique segment identifiers, the method reconstructs the object. A persistent storage area of another disk is scanned to find a unique identifier of a failed disk. If using erasure coding, a missing segment previously stored on the disk is identified. The method locates other segments. Missing segments are regenerated.
Erasure Coding And Replication In Storage Clusters
- Austin TX, US Paul R.M. CARPENTIER - Boechout, BE Andrew KLAGER - Austin TX, US Aaron PIERCE - Austin TX, US Jonathan RING - Austin TX, US Russell TURPIN - Austin TX, US David YOAKLEY - Austin TX, US
International Classification:
H03M 13/05 H03M 13/25 G06F 11/10
US Classification:
714769
Abstract:
A cluster receives a request to store an object using replication or erasure coding. The cluster writes the object using erasure coding. A manifest is written that includes an indication of erasure coding and a unique identifier for each segment. The cluster returns a unique identifier of the manifest. The cluster receives a request from a client that includes a unique identifier. The cluster determines whether the object has been stored using replication or erasure coding. If using erasure coding, the method reads a manifest. The method identifies segments within the cluster using unique segment identifiers of the manifest. Using these unique segment identifiers, the method reconstructs the object. A persistent storage area of another disk is scanned to find a unique identifier of a failed disk. If using erasure coding, a missing segment previously stored on the disk is identified. The method locates other segments. Missing segments are regenerated.
Monte Gardens Elementary School Concord CA 1981-1986, Sequoia Middle School Pleasant Hill CA 1986-1987, Cavitt Junior High School Granite Bay CA 1987-1989