Ann Arbor, MI, United States of America

John Kloosterman


Average Co-Inventor Count = 6.0

ph-index = 1


Company Filing History:


Years Active: 2020

Loading Chart...
1 patent (USPTO):Explore Patents

Title: John Kloosterman: Innovator in Dynamic Storage Allocation

Introduction

John Kloosterman is an accomplished inventor based in Ann Arbor, Michigan. He has made significant contributions to the field of computer engineering, particularly in the area of dynamic storage allocation for processing thread groups. His innovative approach has the potential to enhance the efficiency of computing systems.

Latest Patents

Kloosterman holds a patent for a technique titled "Dynamically allocating storage elements to provide registers for processing thread groups." This patent describes a method for managing storage elements to ensure that each thread group has access to the necessary registers for executing program code. The technique involves capacity management circuitry that reserves storage elements and preloads operand values into designated registers, optimizing the execution process.

Career Highlights

Kloosterman is affiliated with the University of Michigan, where he continues to advance research in computer systems. His work focuses on improving the performance of multi-threaded applications through innovative storage management techniques. His contributions have been recognized within the academic community and beyond.

Collaborations

Kloosterman has collaborated with notable colleagues, including Jonathan Beaumont and Davoud Anoushe Jamshidi. These partnerships have fostered a collaborative environment that encourages the exchange of ideas and the development of cutting-edge technologies.

Conclusion

John Kloosterman's work in dynamic storage allocation represents a significant advancement in the field of computer engineering. His innovative patent and collaborations with esteemed colleagues highlight his commitment to enhancing computing efficiency.

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