Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Bacon, NY
Charles Bacon, Brooklyn, NY US
| Patent application number | Description | Published |
|---|---|---|
| 20110039143 | RAMPED BATTERY CONTACT SYSTEMS AND METHODS - The present disclosure relates to ramped battery contacts for a battery pack that support multiple engagement methods to devices, such as terminals, recharging stations, and the like. The battery pack can make a connection with a terminal one way and with a recharging station with another. Advantageously, the multiple engagement methods allow for different connectors for the different applications associated with the terminal and the recharging station. In an exemplary embodiment, the ramped battery contacts enable a terminal to connect to a battery pack through pogo-pin contacts to prevent disconnections in a rugged environment. The same ramped battery contacts can connect to a recharging station with leaf spring contacts through a swiping action that makes insertion and removal of the battery pack in the recharger quicker and easier. | 02-17-2011 |
David F. Bacon, Sleepy Hollow, NY US
| Patent application number | Description | Published |
|---|---|---|
| 20090049282 | SYSTEM AND METHOD FOR MANAGING DATA - A method of performing data and pointer compression includes, in a buffer which is formed between a processor and a level one cache and stores plural tags and full-word values associated with the tags, when the buffer is presented with an address, breaking the address into a line number which indexes a set of the full-word values, and a tag which is used as a key to determine whether a value in the set of full-word values includes a value associated with the presented address, if a tag in the presented address matches a tag in the buffer, returning a full-word value in the buffer which is associated with the tag, and storing the returned full-word value in a destination register of an instruction which originated the presented address, and if a tag in the presented address does not match a tag in the buffer, generating a fault and branching control to a pre-defined handler. | 02-19-2009 |
David Francis Bacon, Sleepy Hollow, NY US
| Patent application number | Description | Published |
|---|---|---|
| 20100198885 | METHOD AND SYSTEM FOR EXECUTING A TASK AND MEDIUM STORING A PROGRAM THEREFOR - A method of executing a task includes executing, by using a processor, a first task including a low-frequency task in which garbage is collected using a garbage collector, initializing a second task including a high-frequency task by constructing an instance of a class that implements a standard runnable thread interface, and creating a data structure for supporting communication between the second task and lower priority threads, the data structure being accessible by a thread running in a garbage-collected heap in the first task to communicate data between the high-frequency task and the low-frequency task, validating the second task to ensure that the second task is executable without synchronizing with the first task, instantiating the second task to create a class for executing the second task; and after the instantiating the second task, executing the second task, the garbage collector being preemptable by the second task. | 08-05-2010 |
| 20100262636 | GARBAGE COLLECTOR WITH EAGER READ BARRIER - A garbage collection system that needs to meet real-time requirements uses an eager read barrier that performs a forwarding operation as soon as a quantity is loaded. The barrier maintains a to-space invariant by including a forwarding pointer in the header of objects to be moved or accessed that normally points to the object itself. However, if the object has been moved, the forwarding pointer points to the new object location. The eager read barrier maintains the registers and stack cells such that the registers and stack cells always point into to-space. Barrier-sinking and common sub-expression elimination are used to minimize the overhead associated with the read barrier. | 10-14-2010 |
David Francis Bacon, New York, NY US
| Patent application number | Description | Published |
|---|---|---|
| 20080235309 | Concurrent Collection of Cyclic Garbage in Reference Counting Systems - The present invention provides techniques that allow concurrent collection of cyclic garbage on reference counting systems. In general, candidate objects are found that may be part of cyclic garbage. Each candidate object has a reference count. Two tests are performed to determine if concurrent operations have affected the reference counts of the candidate objects. If concurrent operations have not affected the reference counts, the candidate objects are collected as garbage. Additionally, during garbage collection, the decrements to reference counts are delayed so that increments occur before decrements and so that decrements are held a predetermined time before being applied. This prevents decrementing a reference and collecting a cycle as garbage right before a reference is added to an object in the cycle | 09-25-2008 |
| 20100100575 | Lock Deferral for Real-Time Garbage Collection - Techniques are disclosed for schedule management. By way of example, a method for managing performance of tasks of a thread associated with a processor comprises the following steps. A request to execute a task of a first task type within the thread is received. A determination is made whether the processor is currently executing a critical section of a task of a second task type within the thread. When it is determined that the processor is not executing a critical section of the second task type within the thread, the task of the first task type is executed within the thread. When it is determined that the processor is executing a critical section of the first task type within the thread, a determination is made whether the request for execution of the task of the first task type within the thread is deferrable based on a prior execution of one or more units of the first task type. The first task type may be an overhead task type such as a garbage collection task type, and the second task type may be an application task type. | 04-22-2010 |
| 20100107168 | Scheduling for Real-Time Garbage Collection - Techniques are disclosed for schedule management. By way of example, a method for managing performance of tasks in threads associated with at least one processor comprises the following steps. One or more units of a first task type are executed. A count of the one or more units of the first task type executed is maintained. The count represents one or more credits accumulated by the processor for executing the one or more units of a first task type. One or more units of a second task type are executed. During execution of the one or more units of a second task type, a request to execute at least one further unit of the first task type is received. The amount of credits in the count is checked. When it is determined that there is sufficient credit in the count, the request to execute the at least one further unit of the first task type is forgone, and execution of the one or more units of the second task type continues. When it is determined that there is insufficient credit in the count, the at least one further unit of the first task type is executed. The first task type may be an overhead task type such as a garbage collection task type, and the second task type may be an application task type. | 04-29-2010 |
David Francis Bacon, Yorktown Heights, NY US
| Patent application number | Description | Published |
|---|---|---|
| 20090300086 | SCHEDULING AND PERFORMING GARBAGE COLLECTION IN A REAL-TIME SYSTEM WITH GUARANTEED SPACE BOUNDS - A method for performing garbage collection for a real-time application uses a memory for determining an amount of memory required to run the garbage collection process and waits until the determined amount of memory is available, then allocates memory space for the application by segmenting the memory space into a number of pages of a predetermined size. A mutator is used for assuring that only non-null, unmarked objects are placed into a write buffer. A hybrid collector is used for removing the dead objects and defragmenting the memory space. | 12-03-2009 |