Leonberg, Germany

Markus Nosse


Average Co-Inventor Count = 5.0

ph-index = 1

Forward Citations = 2(Granted Patents)


Company Filing History:


Years Active: 2011

where 'Filed Patents' based on already Granted Patents

1 patent (USPTO):

Title: Innovations of Markus Nosse

Introduction

Markus Nosse is a notable inventor based in Leonberg, Germany. He has made significant contributions to the field of computer languages, particularly in memory management. His innovative approach has led to the development of a unique patent that enhances the efficiency of automated memory management systems.

Latest Patents

Markus Nosse holds a patent titled "Cache bounded reference counting." This invention addresses the challenges associated with memory management in computer languages. The patent describes a method where a reference to an object is fetched, and the cache hardware is queried to determine the validity of the reference. If the reference is valid and meets specific criteria, the associated object is locked for updates, and the reference counter is decremented. This process allows for efficient memory management by enabling the release and reuse of storage memory when appropriate.

Career Highlights

Markus Nosse is currently employed at International Business Machines Corporation (IBM). His work at IBM has allowed him to collaborate with other talented professionals in the field. His contributions have been instrumental in advancing the company's technological capabilities.

Collaborations

Some of Markus Nosse's coworkers include Eberhard Pasch and Hans-Werner Tast. Their collaborative efforts have fostered an environment of innovation and creativity within their projects.

Conclusion

Markus Nosse's work in the realm of computer languages and memory management showcases his inventive spirit and dedication to technological advancement. His patent on cache bounded reference counting is a testament to his innovative contributions to the field.

This text is generated by artificial intelligence and may not be accurate.
Please report any incorrect information to support@idiyas.com
Loading…