Patents by Inventor Michael Carnevale

Michael Carnevale 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).

  • Publication number: 20240177115
    Abstract: A method for implementing software-defined community clouds includes receiving, from a first requestor, a first access request requesting access to a first project of a plurality of projects. Each project includes project data governed by a compliance regime that enforces compliance requirements. The method includes, for each compliance requirement, determining that the first access request satisfies the compliance requirement. The method includes, based on determining that the first access request satisfies compliance requirements, granting the first requestor access to the first project. The method includes receiving, from a second requestor, a second access request requesting access to a second project and determining that the second access request fails to satisfy one of the one of the compliance requirements. The method also includes, based on determining that the second access request fails to satisfy one of the compliance requirements, denying the second requestor access to the second project.
    Type: Application
    Filed: November 28, 2022
    Publication date: May 30, 2024
    Applicant: Google LLC
    Inventors: Christopher William Johnson, Jason Edward Callaway, Anthony Michael Carnevale, Timothy Matthew Dierks, Omkhar Arasaratnam
  • Patent number: 11508464
    Abstract: Platform for care coordination and planning. Integration of care planning tool, frontend applications, and customer support platform to assist in trust administration for beneficiaries who may have disabilities. The platform may be used to provide planning, concierge, and fiduciary services.
    Type: Grant
    Filed: June 22, 2020
    Date of Patent: November 22, 2022
    Assignee: HOPE PORTAL SERVICES, INC.
    Inventors: Joshua A. Fishkind, Michael Carnevale
  • Publication number: 20140244404
    Abstract: A method of automated negotiation is provided. The method is implemented using at least one computer, and includes receiving, from a seller, an ask price for an item and a accept price for the item. The method also includes storing the ask price for the item and the accept price for the item in a memory element provided by the at least one computer. The method also includes providing the ask price for the item to a buyer and receiving, from the buyer, an offer price and a max price. The method also includes storing the offer price for the item and the max price for the item in the memory element. The method also includes calculating a final transaction price using the at least one computer and assessing a penalty to the buyer based at least on the offer price.
    Type: Application
    Filed: February 27, 2013
    Publication date: August 28, 2014
    Applicant: Paycollective Inc.
    Inventors: Joshua Manson, Constantine Nicolaidis, Michael Carnevale
  • Publication number: 20070174556
    Abstract: In a first aspect, a first method of reducing reissue latency of a command received in a command processing pipeline from one of a plurality of units coupled to a bus is provided. The first method includes the steps of (1) from a first unit coupled to the bus, receiving a first command on the bus requiring access to a cacheline; (2) determining a state of the cacheline required by the first command by accessing cacheline state information stored in each of the plurality of units; (3) determining whether a second command received on the bus requires access to the cacheline before the state of the cacheline is returned to the first unit; and (4) if so, storing the second command in a buffer. Numerous other aspects are provided.
    Type: Application
    Filed: January 26, 2006
    Publication date: July 26, 2007
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Jeffrey Brown, Michael Carnevale, Charles Johns, David Krolak, Thuong Truong
  • Publication number: 20060200723
    Abstract: A method and apparatus are provided for implementing enhanced vertical ECC storage in a dynamic random access memory. A dynamic random access memory (DRAM) is split into a plurality of groups. Each group resides inside a DRAM row address strobe (RAS) page so that multiple locations inside a group can be accessed without incurring an additional RAS access penalty. Each group is logically split into a plurality of segments for storing data with at least one segment for storing ECC for the data segments. For a write operation, data are written in a data segment and then ECC for the data are written in an ECC segment. For a read operation, ECC are read from an ECC segment, then data are read from the data segment.
    Type: Application
    Filed: March 3, 2005
    Publication date: September 7, 2006
    Applicant: International Business Machines Corporation
    Inventors: Michael Carnevale, Steven Herndon, Daniel Moertl
  • Publication number: 20060059273
    Abstract: The present invention provides for sending an envelope and replying to an envelope. A transmitter is configured to send an envelope. A receiver is coupled to the transmitter, wherein the receiver is configured to receive the envelope and generate a reply envelope. A send buffer is coupled to the transmitter. A receive buffer is coupled to the receiver. A retry timer is coupled to the transmitter, wherein the retry timer is configured to reset upon the receipt of a reply envelope correlated to the transmit envelope. The transmitter is configured to retransmit an envelope if the transmitter does not receive a corresponding reply envelope within a selected time period as determined by the retry timer. This leads to a decrease in the total number of envelopes, transmitted from both the transmitter and the receiver.
    Type: Application
    Filed: September 16, 2004
    Publication date: March 16, 2006
    Inventors: Michael Carnevale, Scott Clark, David Hill, Charles Johns, Thomas Pokrandt, Jeffrey Ruedinger, Dorothy Thelen
  • Publication number: 20050083956
    Abstract: A method, apparatus, system, and signal-bearing medium that in an embodiment determine whether a current number of buffers allocated to a queue pair is less than a maximum number of buffers for the queue pair, decide whether a current number of buffers allocated to an operation type is less than a maximum number of buffers for the operation, and allocate a buffer to the queue pair if the queue pair requests the buffer for an operation having the operation type and the determining and the deciding are true. In this way, too much buffer space is prevented from being assigned to particular operation and to a particular queue pair.
    Type: Application
    Filed: October 16, 2003
    Publication date: April 21, 2005
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Michael Carnevale, Daniel Moertl, Timothy Schimke