Patents by Inventor Trey Matteson
Trey Matteson has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 7716450Abstract: A system for transparent local and distributed memory management overcomes the requirement of keeping track of whether a memory space allocated to a new object or a new program or data structure can be reclaimed. An autorelease pool is created at the beginning of a new duty cycle. The autorelease pool retains the newly allocated memory space during the duty cycle. The autorelease pool is automatically disposed of at the end of the duty cycle. As a result of disposing the autorelease pool, the newly allocated memory space is reclaimed (i.e., deallocated). This is useful in distributed networks where different programming conventions on remote and local machines made the memory management task particularly difficult. This is also useful in an object-oriented programming environment.Type: GrantFiled: November 28, 2007Date of Patent: May 11, 2010Assignee: Apple Inc.Inventors: Blaine Garst, Ali Ozer, Bertrand Serlet, Trey Matteson
-
Publication number: 20080072008Abstract: The present invention discloses a system for transparent local and distributed memory management. The invention overcomes the prior art's requirement of keeping track of whether a memory space allocated to a new object or a new program or data structure can be reclaimed. According to the present invention an autorelease pool is created at the beginning of a new duty cycle. The autorelease pool retains the newly allocated memory space during the duty cycle. The autorelease pool is automatically disposed of at the end of the duty cycle. As a result of disposing the autorelease pool, the newly allocated memory space is reclaimed (i.e., deallocated). The present invention is useful in distributed networks where different programming conventions on remote and local machines made the prior art's memory management task particularly difficult. The present invention is also useful in an object-oriented programming environment.Type: ApplicationFiled: November 28, 2007Publication date: March 20, 2008Inventors: Blaine Garst, Ali Ozer, Bertrand Serlet, Trey Matteson
-
Patent number: 7305538Abstract: The present invention discloses a system for transparent local and distributed memory management. The invention overcomes the prior art's requirement of keeping track of whether a memory space allocated to a new object or a new program or data structure can be reclaimed. According to the present invention an autorelease pool is created at the beginning of a new duty cycle. The autorelease pool retains the newly allocated memory space during the duty cycle. The autorelease pool is automatically disposed of at the end of the duty cycle. As a result of disposing the autorelease pool, the newly allocated memory space is reclaimed (i.e., deallocated). The present invention is useful in distributed networks where different programming conventions on remote and local machines made the prior art's memory management task particularly difficult. The present invention is also useful in an object-oriented programming environment.Type: GrantFiled: April 10, 2003Date of Patent: December 4, 2007Assignee: Apple Inc.Inventors: Blaine Garst, Ali Ozer, Bertrand Serlet, Trey Matteson
-
Publication number: 20030196063Abstract: The present invention discloses a system for transparent local and distributed memory management. The invention overcomes the prior art's requirement of keeping track of whether a memory space allocated to a new object or a new program or data structure can be reclaimed. According to the present invention an autorelease pool is created at the beginning of a new duty cycle. The autorelease pool retains the newly allocated memory space during the duty cycle. The autorelease pool is automatically disposed of at the end of the duty cycle. As a result of disposing the autorelease pool, the newly allocated memory space is reclaimed (i.e., deallocated). The present invention is useful in distributed networks where different programming conventions on remote and local machines made the prior art's memory management task particularly difficult. The present invention is also useful in an object-oriented programming environment.Type: ApplicationFiled: April 10, 2003Publication date: October 16, 2003Inventors: Blaine Garst, Ali Ozer, Bertrand Serlet, Trey Matteson
-
Patent number: 6571262Abstract: The present invention discloses a system for transparent local and distributed memory management. The invention overcomes the prior art's requirement of keeping track of whether a memory space allocated to a new object or a new program or data structure can be reclaimed. According to the present invention an autorelease pool is created at the beginning of a new duty cycle. The autorelease pool retains the newly allocated memory space during the duty cycle. The autorelease pool is automatically disposed of at the end of the duty cycle. As a result of disposing the autorelease pool, the newly allocated memory space is reclaimed (i.e., deallocated). The present invention is useful in distributed networks where different programming conventions on remote and local machines made the prior art's memory management task particularly difficult. The present invention is also useful in an object-oriented programming environment.Type: GrantFiled: October 15, 2001Date of Patent: May 27, 2003Assignee: Apple Computer, Inc.Inventors: Blaine Garst, Ali Ozer, Bertrand Serlet, Trey Matteson
-
Publication number: 20020078060Abstract: The present invention discloses a system for transparent local and distributed memory management. The invention overcomes the prior art's requirement of keeping track of whether a memory space allocated to a new object or a new program or data structure can be reclaimed. According to the present invention an autorelease pool is created at the beginning of a new duty cycle. The autorelease pool retains the newly allocated memory space during the duty cycle. The autorelease pool is automatically disposed of at the end of the duty cycle. As a result of disposing the autorelease pool, the newly allocated memory space is reclaimed (i.e., deallocated). The present invention is useful in distributed networks where different programming conventions on remote and local machines made the prior art's memory management task particularly difficult. The present invention is also useful in an object-oriented programming environment.Type: ApplicationFiled: October 15, 2001Publication date: June 20, 2002Applicant: NeXT COMPUTER, INC.Inventors: Blaine Garst, Ali Ozer, Bertrand Serlet, Trey Matteson
-
Patent number: 6304884Abstract: The present invention discloses a system for transparent local and distributed memory management. The invention overcomes the prior art's requirement of keeping track of whether a memory space allocated to a new object or a new program or data structure can be reclaimed. According to the present invention an autorelease pool is created at the beginning of a new duty cycle. The autorelease pool retains the newly allocated memory space during the duty cycle. The autorelease pool is automatically disposed of at the end of the duty cycle. As a result of disposing the autorelease pool, the newly allocated memory space is reclaimed (i.e., deallocated). The present invention is useful in distributed networks where different programming conventions on remote and local machines made the prior art's memory management task particularly difficult. The present invention is also useful in an object-oriented programming environment.Type: GrantFiled: February 14, 2000Date of Patent: October 16, 2001Assignee: NeXT Software, Inc.Inventors: Blaine Garst, Ali Ozer, Bertrand Serlet, Trey Matteson
-
Patent number: 6026415Abstract: The present invention discloses a system for transparent local and distributed memory management. The invention overcomes the prior art's requirement of keeping track of whether a memory space allocated to a new object or a new program or data structure can be reclaimed. According to the present invention an autorelease pool is created at the beginning of a new duty cycle. The autorelease pool retains the newly allocated memory space during the duty cycle. The autorelease pool is automatically disposed of at the end of the duty cycle. As a result of disposing the autorelease pool, the newly allocated memory space is reclaimed (i.e., deallocated). The present invention is useful in distributed networks where different programming conventions on remote and local machines made the prior art's memory management task particularly difficult. The present invention is also useful in an object-oriented programming environment.Type: GrantFiled: November 11, 1997Date of Patent: February 15, 2000Assignee: NeXT Software, Inc.Inventors: Blaine Garst, Ali Ozer, Bertrand Serlet, Trey Matteson
-
Patent number: 5687370Abstract: The present invention discloses a system for transparent local and distributed memory management. The invention overcomes the prior art's requirement of keeping track of whether a memory space allocated to a new object or a new program or data structure can be reclaimed. According to the present invention an autorelease pool is created at the beginning of a new duty cycle. The autorelease pool retains the newly allocated memory space during the duty cycle. The autorelease pool is automatically disposed of at the end of the duty cycle. As a result of disposing the autorelease pool the newly allocated memory space is reclaimed (i.e., deallocated). The present invention is useful in distributed networks where different programming conventions on remote and local machines made the prior art's memory management task particularly difficult. The present invention is also useful in an object-oriented programming environment.Type: GrantFiled: January 31, 1995Date of Patent: November 11, 1997Assignee: NeXT Software, Inc.Inventors: Blaine Garst, Ali Ozer, Bertrand Serlet, Trey Matteson
-
Patent number: 5446896Abstract: A method and apparatus for providing inter-program communication, and in particular, the sharing of algorithms among programs. A "services server" scans programs stored in the mass storage of a computer system and generates a data structure containing attribute information of each service provided by the programs stored in mass storage. This data structure includes an attribute name, the "sendType" of the attribute and the "returnTypes" of the attribute. A sendType is the required format of data provided to the service provider as an input to the service algorithm. The returnType is the format of data that is the result of applying the service algorithm to the input data. SendTypes and returnTypes are ASCII, RTF, TIFF, PICT, etc. When a service requestor is activated, the service requestor scans the services server data structure and generates its own local database of available services with which it can provide the appropriate data format.Type: GrantFiled: November 14, 1994Date of Patent: August 29, 1995Assignee: Next, Inc.Inventors: Paul Hegarty, Trey Matteson
-
Patent number: 5423039Abstract: A system for implementing a wait cursor at a system level. An event driver accepts user driven events, such as keyboard operations or mouse actions, time stamps them and provides them to a window server. The window server provides the event to an event queue of an associated program. This event is referred to as the "lastEventSent". The time stamp associated with that event remains with the event through each stage of execution. Each time a program completes execution of an event, the program notifies the window server of the time stamp of the event. This event is referred to as the "lastEventConsumed". The time stamp of the lastEventSent is compared to the time stamp of the lastEventConsumed. If the time stamp of the lastEventSent is not equal to the time stamp of the lastEventConsumed, the time stamp of the lastEventSent is compared to the currentTime. If the difference between the time stamp of the lastEventSent and the currentTime exceeds a threshold value, a wait cursor is implemented.Type: GrantFiled: July 26, 1993Date of Patent: June 6, 1995Inventor: Trey Matteson