Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Burka
Peter Burka, Ottawa CA
| Patent application number | Description | Published |
|---|---|---|
| 20090144281 | SPECULATIVE COMPUTATION LOCK COARSENING THROUGH THE USE OF LOCALIZED LOCK RESERVATION - A computer-implementable method, system and computer-usable medium. One or more objects among a plurality of objects can be processed utilizing a data-processing apparatus/system. One or more lock reservations can be applied among a group of lock reservations over a multiple sequential lock operations with respect the particular object. Thereafter, the lock reservation can be cancelled with respect to the last monitor exit operation in order to eliminate lock operations where traditional lock coarsening cannot be applied. | 06-04-2009 |
Peter W. Burka, Ottawa CA
| Patent application number | Description | Published |
|---|---|---|
| 20090064094 | LOCK RESERVATION USING COOPERATIVE MULTITHREADING AND LIGHTWEIGHT SINGLE READER RESERVED LOCKS - A method for lock reservation using cooperative multithreading is provided. The method includes analyzing code containing async points to support cooperative multithreading. The method also includes identifying a class of code as a candidate for reservation via determining locking properties within the code as a function of locations of async points within the code, and generating reserving code that reserves the shared object when code performing the reservation is considered hot code. The method further includes performing runtime monitoring of reservation performance to detect a contention level for the shared object, and removing the reservation when the runtime monitoring determines that a low level of contention exists. A method for lightweight single reader reserved locks is also provided, including identifying a candidate for reservation containing a read-only locking sequence, conditionally marling the sequence, and generating code using an artificial dependency to control execution order of out-of-line code. | 03-05-2009 |
| 20090146811 | METHOD AND APPARATUS FOR PREVENTING WATER DAMAGE TO ARTICLES - The present invention is directed to a method and apparatus for preventing water damage to non-washable articles in a washing machine. A method in accordance with an embodiment of the present invention includes: providing an article with a radio frequency identification (RFID) tag identifying the article as being non-washable; preventing the article from being washed in a washing machine by: scanning the washing machine using an RFID reader; and generating an alarm upon detection of a predetermined code emitted by the RFID tag. | 06-11-2009 |
| 20110209130 | SOFTWARE OBJECT LOCK MANAGEMENT USING OBSERVATIONS - Embodiments include a method comprising loading a software class containing class information for a lock state. The method includes allocating an instance of a software object derived from the software class, wherein the allocating includes allocating of a lock word as part of the instance of the software object. The lock word defines whether the object is locked by a thread of multiple threads. The method includes observing activity relative to the instance of the software object. The method also includes, responsive to observing the activity relative to the instance of the software object that indicates that the lock state of the instance of the object is non-locking, removing the lock word from the instance of the object. | 08-25-2011 |
Peter Wiebe Burka, Ottawa CA
| Patent application number | Description | Published |
|---|---|---|
| 20090158264 | CONFIGURING A SHARED LIBRARY TO ACCOMMODATE RELOCATABLE DATA IN A PERVASIVE DEVICE - A method, system, architecture and apparatus for generating a shared library for a pervasive device target platform which can accommodate relocatable data. A tool chain in furtherance of this purpose can be arranged in accordance with the present invention to include a compiler programmed to compile source code into a compiled object and a linker programmed to link the compiled object into a linked object using a relocatable data segment. In this regard, in a preferred aspect of the invention a linker configuration file can be included for use in the linker which specifies the use of the relocatable data segment in lieu of a position independent data segment. The tool chain further can be arranged to include a relocation data extraction tool programmed to extract relocation data from the linked object and to dispose the relocation data in a relocation data file configured for disposition in a pervasive device. | 06-18-2009 |
| 20100138819 | TYPE MERGING TECHNIQUE TO REDUCE CLASS LOADING DURING JAVA VERFICATION - An apparatus, process, and computer program product to merge types in an object-oriented program is disclosed herein. In one embodiment, a process may include analyzing a method within an object-oriented program to identify merge candidates. These merge candidates may then be recorded in a merge candidate list. The process may further include identifying at least two code paths in the method that merge into a single code path and that operate on different types. The types in these code paths may then be merged to a nearest common superclass listed in the merge candidate list. In selected embodiments, the types may be merged to the java.lang.Object class in the event the merge candidate list is empty. | 06-03-2010 |
Peter Wiebe Burka US
| Patent application number | Description | Published |
|---|---|---|
| 20120136906 | FIXUP CACHE TOOL FOR OBJECT MEMORY COMPACTION IN AN INFORMATION HANDLING SYSTEM - An operating system or virtual machine of an information handling system (IHS) initializes a garbage collector to provide object memory compaction during application execution. The operating system or virtual machine performs move and fixup management within heap or object memory stores. The garbage collector identifies holes or unused portions of heap memory and moves one or more objects during compaction operations. After the garbage collector moves the object, a fixup cache tool fixes up the object pointers within the object. The fixup cache tool maintains a fixup cache that includes pointer information corresponding to the objects that the garbage collector moves. The fixup cache tool employs the pointer information within the fixup cache to update or otherwise fixup the objects within the heap that the garbage collector moves during compaction operations. The fixup cache may provide predictive pointer update information during fixup operations for each object move within the heap. | 05-31-2012 |