Austin, TX, United States of America

Kelly Larson


Average Co-Inventor Count = 2.0

ph-index = 1

Forward Citations = 2(Granted Patents)


Company Filing History:


Years Active: 2004-2005

Loading Chart...
2 patents (USPTO):Explore Patents

Title: Kelly Larson: Innovator in Cache Coherency Protocols

Introduction

Kelly Larson is a prominent inventor based in Austin, TX (US). She has made significant contributions to the field of computer systems, particularly in the area of cache coherency protocols. With a total of 2 patents, her work has been instrumental in enhancing the performance of scalable symmetric multiple processor systems.

Latest Patents

Kelly Larson's latest patents include a method for evaluating scalable symmetric multiple processor cache coherency protocols and algorithms. This innovative system evaluates cache coherency protocols and algorithms in scalable symmetric multiple processor computer systems. The design incorporates scalable 32-byte or larger cache lines, where one specific byte in the cache line is designated for write and read transactions for each specific 32-bit processor. The method ensures that each 32-bit processor writes and reads to and from the specific byte in the cache line assigned to that processor.

Career Highlights

Kelly Larson is currently employed at Hewlett-Packard Development Company, L.P., where she continues to develop cutting-edge technologies. Her expertise in cache coherency has positioned her as a key player in her field.

Collaborations

One of her notable coworkers is Robert D. Bushey, with whom she collaborates on various projects related to computer systems and protocols.

Conclusion

Kelly Larson's contributions to the field of computer systems through her innovative patents and work at Hewlett-Packard Development Company, L.P. highlight her as a leading figure in technology. Her dedication to improving cache coherency protocols continues to influence advancements in scalable computing systems.

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