Patents by Inventor Gregory Meredith
Gregory Meredith 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: 10665515Abstract: Embodiments herein describe binning and placement techniques for assembling a multi-die device to improve yield when a customer requests a high performance feature from the device. For example, the multi-die device may include multiple dies that are interconnected to form a single device or package. In one embodiment, the multiple dies are the same semiconductor die (e.g., have the same circuit layout) which are disposed on a common interposer or stacked on each other. The multi-die device can then be attached to a printed circuit board (PCB). Although the dies in the multi-die device may each include the same feature (e.g., a PCIe interface, SerDes interface, transmitter, memory interface, etc.), the multi-die device is assembled so that not all of the dies have a feature that satisfies the high performance requested by the customer. That is, at least one of the die includes a lower performance feature.Type: GrantFiled: July 3, 2018Date of Patent: May 26, 2020Assignee: XILINX, INC.Inventors: Matthew H. Klein, Gregory Meredith, Joshua Tan
-
Patent number: 9337138Abstract: An embodiment of an apparatus to reduce supply voltage noise with capacitors of an interposer of a stacked die is disclosed. In this embodiment, an interposer is coupled to a first integrated circuit die using a first plurality of interconnects. A substrate is coupled to the interposer using a second plurality of interconnects. The substrate includes a supply voltage plane and a ground plane, each of which is coupled to the first integrated circuit die using the second plurality of interconnects, the interposer, and the first plurality of interconnects. The interposer includes capacitors coupled in parallel using the supply voltage plane, the ground plane, and the second plurality of interconnects, where capacitance from capacitors of the interposer is provided to the first integrated circuit die using the supply voltage plane and the ground plane of the substrate.Type: GrantFiled: March 9, 2012Date of Patent: May 10, 2016Assignee: XILINX, INC.Inventors: Khaldoon S. Abugharbieh, Gregory Meredith, Christopher P. Wyland, Paul Y. Wu, Henley Liu, Sanjiv Stokes, Yong Wang
-
Patent number: 8556036Abstract: An adjustable tree stand assembly of the present invention is used by hunters and naturalists. The assembly presents a support frame of a generally rectangular configuration having a first support member to be connected to a tree and an arm extending in cantilevered fashion to a housing adaptable to receive a seat and seat frame assembly. The seat and seat frame assembly includes a seat portion, a back support portion and a leg or pin extending from the seat portion to be engaged in the housing. An adjustable shooting rail is connected to and extends from the seat and seat frame assembly. The housing is further connected to a platform for supporting the hunter.Type: GrantFiled: November 12, 2012Date of Patent: October 15, 2013Inventors: Gregory Meredith, Robert Borgstrom
-
Patent number: 8156472Abstract: A reflective process algebra called the ?-calculus facilitates the serialization of processes at the level of the reflective process algebra. The reflective process algebra because of its reflective properties, can be used on computing systems with finite resources. The reflective process calculus can be made to be sensitive to resources, such as memory and bandwidth, hence facilitating its use as a programming language at the machine level. The reflective process calculus causes the dual nature of a computation entity to be exposed. A name can be caused to become a process and a process can be caused to become a name.Type: GrantFiled: March 30, 2004Date of Patent: April 10, 2012Assignee: Microsoft CorporationInventors: L. Gregory Meredith, Allen L. Brown, Jr., David Richter, George Moore
-
Patent number: 7702749Abstract: The joining of Web services is accomplished via a virtual contract through the use of safeties. The joining of Web services heightens the safe interoperability of Web services to create greater functionality than each Web service alone can provide. Web services are joined for interoperability when the type of a port of one Web service is compatible with the type of another port of another Web service.Type: GrantFiled: January 7, 2003Date of Patent: April 20, 2010Assignee: Microsoft CorporationInventors: L. Gregory Meredith, Steve Bjorg, David Richter
-
Patent number: 7685566Abstract: Trees are a common semantic denominator of XML data types and process calculi. This indicates a potential tight intertwining of the syntax and semantics of data and processes. The invention provides this intertwining via a process calculus wherein the data language syntax is a fragment of the programming language syntax.Type: GrantFiled: June 30, 2004Date of Patent: March 23, 2010Assignee: Microsoft CorporationInventors: Allen L. Brown, Jr., Lucius Gregory Meredith, Cosimo Laneve
-
Patent number: 7467206Abstract: A system and method for automating the web service selection based on reputation information, to help negotiate a contractual web service binding between a client and a server. Reputation information may be schematized into behavioral attributes such as web service responsiveness, web service latency, web service uptime, cost data, business solvency and other trustworthiness and business-related data. Some of the reputation data may be empirically determined, and provided by an independent or other trusted auditor. In one implementation, a client queries a search engine, which returns a ranked list of web services, with the ranking based on reputation scores computed for each web service as collected by an auditor. Clients may provide computational data to weigh the attributes separately. A corporate internet can maintain reputation data for web services to act as an auditor, and a web service server can also execute trusted code to act as an auditor.Type: GrantFiled: December 23, 2002Date of Patent: December 16, 2008Assignee: Microsoft CorporationInventors: George Moore, Lucius Gregory Meredith
-
Patent number: 7467371Abstract: A methodology of employing a binding for interfacing a business workflow process executable program to a real world implementation. The binding can be reduced to a programming language. A preferable programming language is XML (Extensible Markup Language). Separation of the business workflow processes and the binding allow for the same business workflow process to be implemented across a variety of different technologies. The binding maps ports and messages to corresponding units of codes and invocations of a particular technology being utilized for the modeling of the business workflow process. The binding provides a user with the ability to structure schedule messages, define the relationship of schedule ports to units of code, define the relationship of schedule actions to invocations, control the flow of data between messages, provide details of schedule conditionals and specify the interaction of the schedule with specific technology behaviors.Type: GrantFiled: April 28, 2000Date of Patent: December 16, 2008Assignee: Microsoft CorporationInventors: Lucius Gregory Meredith, Marc Levy, Brian Beckman, Anthony Andrews, Bimal Mehta, Mitra Kanchan
-
Patent number: 7409671Abstract: A methodology of reducing process algebra to a language that facilitates modeling a business workflow process is provided. A process algebra is reduced to a model for business workflow processes. The model is then reduced to a scheduling programming language to allow users to create models of business process by selecting between features of the model and conventional modeling features. The scheduling programming language can be represented as a graphical user interface program that is convertible to a schedule language written in a programmable language. The present invention provides for explicitly representing parallelism within the business workflow process by separating interdependent transactions from independent transactions. The isolation of certain transactions are relaxed, such that users can define transactional boundaries in order to increase granularity of the transaction at an action level and provide visibility of transactions at intermediate steps.Type: GrantFiled: April 28, 2000Date of Patent: August 5, 2008Assignee: Microsoft CorporationInventors: Lucius Gregory Meredith, Amit Mital, Marc Levy, Brian Beckman, Anthony Andrews
-
Patent number: 7380166Abstract: An error-handling framework is provided for business process transactions. The error-handling framework facilitates coordination of the invocation of exception and compensation handlers in response to errors. The error-handling framework includes support for custom ordering of compensation actions, data flow into and out of compensation actions, and management of the process state visible to compensation actions.Type: GrantFiled: March 30, 2005Date of Patent: May 27, 2008Assignee: Microsoft CorporationInventors: Satish Ramchandra Thatte, Lucius Gregory Meredith, Marc Levy, Bimal Kumar Mehta, Johannes Klein, Anthony Dean Andrews
-
Patent number: 7376663Abstract: A methodology is provided for encoding mobile process calculi in XML. Mobile process calculi (e.g., ?-calculus, Join Calculus, Blue Calculus) are often employed in modeling business processes. The present method provides for encoding a mobile process algebra in XML by providing a mobile process algebra, reducing the process algebra to infix notation, transforming the mobile process algebra from infix notation to prefix notation, and then transforming the prefix notation to a set of tags via structural induction. Annotating tags can then be provided around the basic process algebra constructors. The set of tags represent an XML schema. The XML schema can then be reduced to a programming language. An example of reducing a specific algebra (combinators—a derivative of ?-calculus) to an XML schema is provided. The XML schema is reduced to a programming language ideal for business workflow processes.Type: GrantFiled: November 27, 2002Date of Patent: May 20, 2008Assignee: Microsoft CorporationInventor: Lucius Gregory Meredith
-
Patent number: 7216335Abstract: A program includes expressions written in a process-based language. A process kernel executes sets of operational semantics rules governing the meanings of the expressions in the program. A first expression is parsed. The first expression describes that a process is a choice of two processes. The first process of the two processes expresses that a first query is submitted to a queue, after which the first process continues with a first set of actions. The second process of the two processes expresses that a second query is submitted to the queue, after which the second process continues with a second set of actions. The first expression reduces to a second expression. The second expression describes that a third query is submitted to the queue after which the first process runs in parallel with the second process if the third query is in canonical form.Type: GrantFiled: November 22, 2002Date of Patent: May 8, 2007Assignee: Microsoft CorporationInventors: L. Gregory Meredith, Steve Bjorg, David Richter
-
Patent number: 7184967Abstract: A graphical user interface (GUI) scheduler program is provided for modeling business workflow processes. The GUI scheduler program includes tools to allow a user to create a schedule for business workflow processes based on a set of rules defined by the GUI scheduler program. The rules facilitate deadlock not occurring within the schedule. The program provides tools for creating and defining message flows between entities. Additionally, the program provides tools that allow a user to define a binding between the schedule and components, such as COM components, script components, message queues and other workflow schedules. The scheduler program allows a user to define actions and group actions into transactions using simple GUI scheduling tools. The schedule can then be converted to executable code in a variety of forms such as XML, C, C+ and C++. The executable code can then be converted or interpreted for running the schedule.Type: GrantFiled: March 6, 2001Date of Patent: February 27, 2007Assignee: Microsoft CorporationInventors: Amit Mital, Lucius Gregory Meredith, Marc Levy, Brian C. Beckman, Anthony D. Andrews, Terry J. Myerson
-
Patent number: 7117487Abstract: A program that includes expressions written in a process-based language for representing protocol-based applications as processes is disclosed. The process kernel executes a set of equational laws governing structural equivalence of expressions written in the process-based language. A first expression is parsed. The first expression describes that a query is being executed in parallel with a process. The query has a head, which is empty, and a body, which contains a first name being bound to a second name. The first expression is translated as structurally equivalent to a second expression. The second expression describes that the query is executed in parallel with the process if the query is in canonical form. Each occurrence of the first name in the process is replaceable with the second name.Type: GrantFiled: November 22, 2002Date of Patent: October 3, 2006Assignee: Microsoft CorporationInventors: L. Gregory Meredith, Steve Bjorg, David Richter
-
Patent number: 7055142Abstract: A program that includes expressions written in a process-based language for representing protocol-based applications as processes is disclosed. A process kernel executes the expressions in the program. The process kernel parses an expression to obtain syntactical elements that represent a queue, a set of queue delimiters, a query, a sequence delimiter, and other actions. The process kernel further translates the expression as a process whose first action is submitting the query as another process to the queue and after which the process continues with other actions. The query includes an organization scheme formed from a customizable, tag-based language that contains data and describes data.Type: GrantFiled: November 22, 2002Date of Patent: May 30, 2006Assignee: Microsoft CorporationInventors: L. Gregory Meredith, Steve Bjorg, David Richter
-
Patent number: 6918053Abstract: An error-handling framework is provided for business process transactions. The error-handling framework facilitates coordination of the invocation of exception and compensation handlers in response to errors. The error-handling framework includes support for custom ordering of compensation actions, data flow into and out of compensation actions, and management of the process state visible to compensation actions.Type: GrantFiled: February 28, 2002Date of Patent: July 12, 2005Assignee: Microsoft CorporationInventors: Satish Ramchandra Thatte, Lucius Gregory Meredith, Marc Levy, Bimal Kumar Mehta, Johannes Klein, Anthony Dean Andrews
-
Publication number: 20040122926Abstract: A system and method for automating the web service selection based on reputation information, to help negotiate a contractual web service binding between a client and a server. Reputation information may be schematized into behavioral attributes such as web service responsiveness, web service latency, web service uptime, cost data, business solvency and other trustworthiness and business-related data. Some of the reputation data may be empirically determined, and provided by an independent or other trusted auditor. In one implementation, a client queries a search engine, which returns a ranked list of web services, with the ranking based on reputation scores computed for each web service as collected by an auditor. Clients may provide computational data to weigh the attributes separately. A corporate internet can maintain reputation data for web services to act as an auditor, and a web service server can also execute trusted code to act as an auditor.Type: ApplicationFiled: December 23, 2002Publication date: June 24, 2004Applicant: Microsoft Corporation, Redmond, Washington.Inventors: George Moore, Lucius Gregory Meredith
-
Publication number: 20040064529Abstract: The joining of Web services is accomplished via a virtual contract through the use of safeties. The joining of Web services heightens the safe interoperability of Web services to create greater functionality than each Web service alone can provide. Web services are joined for interoperability when the type of a port of one Web service is compatible with the type of another port of another Web service.Type: ApplicationFiled: January 7, 2003Publication date: April 1, 2004Applicant: Microsoft CorporationInventors: L. Gregory Meredith, Steve Bjorg, David Richter
-
Publication number: 20030212540Abstract: A program that includes expressions written in a process-based language for representing protocol-based applications as processes is disclosed. A process kernel executes the expressions in the program. The process kernel parses an expression to obtain syntactical elements that represent a queue, a set of queue delimiters, a query, a sequence delimiter, and other actions. The process kernel further translates the expression as a process whose first action is submitting the query as another process to the queue and after which the process continues with other actions. The query includes an organization scheme formed from a customizable, tag-based language that contains data and describes data.Type: ApplicationFiled: November 22, 2002Publication date: November 13, 2003Applicant: Microsoft CorporationInventors: L. Gregory Meredith, Steve Bjorg, David Richter
-
Publication number: 20030212672Abstract: A program that includes expressions—written in a process-based language for representing protocol-based applications as processes is disclosed. The process kernel executes a set of equational laws governing structural equivalence of expressions written in the process-based language. A first expression is parsed. The first expression describes that a query is being executed in parallel with a process. The query has a head, which is empty, and a body, which contains a first name being bound to a second name. The first expression is translated as structurally equivalent to a second expression. The second expression describes that the query is executed in parallel with the process if the query is in canonical form. Each occurrence of the first name in the process is replaceable with the second name.Type: ApplicationFiled: November 22, 2002Publication date: November 13, 2003Applicant: Microsoft CorporationInventors: L. Gregory Meredith, Steve Bjorg, David Richter