Gracie
Andrew L. Gracie, Hamilton BM
Patent application number | Description | Published |
---|---|---|
20110283727 | REFRIGERATOR HAVING A CONDIMENT DOOR AND COMPARTMENT - A household refrigerator having three compartments: a freezer compartment, a refrigerator compartment, and a condiment compartment. Each compartment is accessed via its own door. In an illustrative embodiment, the refrigerator compartment is above the freezer compartment and the condiment compartment is adjacent the refrigerator compartment on the side of the refrigerator. The condiment compartment preferably includes movable shelves inside the condiment compartment as well as on the door to the condiment compartment. One or more electric fans are provided to circulate cold air from the refrigerator compartment into the condiment compartment. The fans are preferably controlled by a thermostat. The refrigerator is preferably designed so that the condiment compartment may be mounted on either the left or right side of the refrigerator compartment. | 11-24-2011 |
Charles R. Gracie, Kanata CA
Patent application number | Description | Published |
---|---|---|
20110246543 | Write Barrier Elision for Reference Arrays - A computer-implemented process for write barrier elision during program execution receives a request to overwrite a reference, determines whether garbage collection is active and responsive to a determination that garbage collection is active, determines whether a reference object has been scanned. Responsive to a determination that the reference object has not been scanned set a mark bit for the reference object in a modified mark map, the reference object is scanned and a scan bit is set for the reference object in the modified mark map. | 10-06-2011 |
20120158801 | DETERMINING WHETHER A JAVA OBJECT HAS BEEN SCAN-MISSED BY A GARBAGE COLLECTOR SCAN - A Java object is scan-missed during the mark phase of a garbage collection cycle. A list of any unscanned objects, comprising all objects of a particular object type, is created during a sweep phase of the garbage collection cycle. After the garbage collection cycle is completed, and the application resumes, for every PUTFIELD/GETFIELD operation on the object type that is part of a specific parent object, a comparison is made with the relevant information in the unscanned objects list. A scan-miss is identified by determining whether the current object being referenced by the application is a part of the unscanned object list that has been created during the sweep phase of the garbage collection cycle. | 06-21-2012 |
20120166498 | GARBAGE COLLECTION IN A MULTIPLE VIRTUAL MACHINE ENVIRONMENT - Garbage collection processes are automatically tuned on a system comprising a plurality of virtual machines running on a physical processing device with multiple physical processors. Tuning is implemented for each garbage collection process, by updating a load variable to reflect that a new garbage collection process has started, the load variable having a value that is based at least in part on a number of garbage collection processes that are currently running on the system. Tuning further comprises creating a number of garbage collection threads based at least in part on the current value of the load variable and/or number of processors, where the garbage collection threads are used to perform at least a portion of at least one phase of the new garbage collection process. Tuning further comprises re-updating the load variable to reflect completion of the new garbage collection process. | 06-28-2012 |
20140009314 | EFFICIENT STRING HASH COMPUTATION - A method for efficiently computing a hash value for a string is disclosed. In one embodiment, such a method includes receiving an original string comprising multiple characters. The method computes an original hash value for the original string. The method produces an updated string by performing at least one of the following updates on the original string: adding leading/trailing characters to the original string; removing leading/trailing characters from the original string, and modifying characters of the original string while preserving the length of the original string. The method then computes an updated hash value for the updated string by performing at least one operation on the original hash value, wherein the at least one operation takes into account the updates that were made to the original string. A corresponding apparatus and computer program product are also disclosed. | 01-09-2014 |
20140143516 | OUT-OF-MEMORY AVOIDANCE IN DYNAMIC VIRTUAL MACHINE MEMORY ADJUSTMENT - An unused free memory shortage relative to an adjusted heap maximum size associated with a memory heap of application memory is detected. The adjusted heap maximum size is set to a heap size smaller than a maximum heap allocation size. An increase to the adjusted heap maximum size that resolves the unused free memory shortage is calculated. The adjusted heap maximum size is increased by the calculated increase to the adjusted heap maximum size. | 05-22-2014 |
20140208055 | OUT-OF-MEMORY AVOIDANCE IN DYNAMIC VIRTUAL MACHINE MEMORY ADJUSTMENT - An unused free memory shortage relative to an adjusted heap maximum size associated with a memory heap of application memory is detected. The adjusted heap maximum size is set to a heap size smaller than a maximum heap allocation size. An increase to the adjusted heap maximum size that resolves the unused free memory shortage is calculated. The adjusted heap maximum size is increased by the calculated increase to the adjusted heap maximum size. | 07-24-2014 |
Charles R. Gracie, Ontario CA
Patent application number | Description | Published |
---|---|---|
20150127623 | ALLOCATION AWARE HEAP FRAGMENTATION METRICS - An illustrative embodiment of a computer-implemented method for estimating heap fragmentation in real time, models a runtime view of free heap memory, models a runtime view of heap allocation patterns for the heap memory and takes a snapshot of the heap memory. A batch allocator simulator is executed at a predetermined event and a remaining amount of memory unused in the simulation is identified as fragmented memory. | 05-07-2015 |
Charles Robert Gracie, Kanata CA
Patent application number | Description | Published |
---|---|---|
20140012829 | EFFICIENT STRING HASH COMPUTATION - A method for efficiently computing a hash value for a string is disclosed. In one embodiment, such a method includes receiving an original string comprising multiple characters. The method computes an original hash value for the original string. The method produces an updated string by performing at least one of the following updates on the original string: adding leading/trailing characters to the original string; removing leading/trailing characters from the original string, and modifying characters of the original string while preserving the length of the original string. The method then computes an updated hash value for the updated string by performing at least one operation on the original hash value, wherein the at least one operation takes into account the updates that were made to the original string. A corresponding apparatus and computer program product are also disclosed. | 01-09-2014 |
Kenneth Gracie, Ottawa CA
Patent application number | Description | Published |
---|---|---|
20090249165 | Event Cleanup Processing For Improving The Performance Of Sequence-Based Decoders - The invention relates to improving the performance of sequence-based soft-output decoders using event cleanup processing, wherein combinations of potential error events are evaluated using an error detection code (EDC) to select events that produce a modified set of decisions that has no EDC detectable errors. The event cleanup method and associated event cleanup decoder enable to significantly improve the error rate performance of sequence-based decoders and/or significantly improve decoding efficiency compared to other known error cleanup methods. | 10-01-2009 |
Matthew Kenneth Gracie, Alexandria, VA US
Patent application number | Description | Published |
---|---|---|
20110066463 | System and Method for Conducting an Optimized Customer Identification Program - A computer-implemented method of compiling a customer information set that complies with regulatory criteria is provided. The method comprises providing an overall question set having a plurality of questions and determining from the overall question set a basic question set, the basic question set including at least one basic question. The method further comprises associating an expected answer with at least one question of the basic question set and providing criteria for modifying the basic question set based on receiving an answer that differs from the expected answer. The method still further comprises optimizing an interactive customer survey with a customer using the overall question set, the basic question set, the expected answer and the criteria for modifying the basic question set. | 03-17-2011 |
Rhonda Gracie, Davie, FL US
Patent application number | Description | Published |
---|---|---|
20090071070 | Fertilization grate and trough system - Disclosed is a fertilization system that finds particular use within a paved surface. The invention allows the root structure of a plant or tree to be hydrated and fertilized by way of an expansible and configurable trough and grate assembly. The trough includes a number of different components that fit together with a tongue and groove interconnection. The trough includes drainage apertures that allow water to run through the grate and into an associated fertilization pit. | 03-19-2009 |