Patents by Inventor Matteo Maria Andreozzi
Matteo Maria Andreozzi 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: 20220374154Abstract: Examples of the present disclosure relate to an apparatus comprising interface circuitry to receive memory access commands directed to a memory device, each memory access command specifying a memory address to be accessed. The apparatus comprises scheduler circuitry to store a representation of a plurality of states accessible to the memory device and, based on the representation, determine an order for the received memory access commands. The apparatus comprises dispatch circuitry to receive the received memory access commands from the scheduler circuitry and issue the received memory access commands, in the determined order, to be performed by the memory device.Type: ApplicationFiled: September 1, 2020Publication date: November 24, 2022Inventors: Michael Andrew CAMPBELL, Matteo Maria ANDREOZZI, Lorenzo BIAGINI, Giovanni STEA, Ankit MEHTA
-
Patent number: 11455268Abstract: The present disclosure relates generally to electronic interconnects including one or more switches and, more particularly, to delay bound determination for electronic interconnects.Type: GrantFiled: February 13, 2020Date of Patent: September 27, 2022Assignee: Arm LimitedInventors: Matteo Maria Andreozzi, Michael Andrew Campbell, Giovanni Stea, Raffaele Zippo
-
Publication number: 20210255981Abstract: The present disclosure relates generally to electronic interconnects including one or more switches and, more particularly, to delay bound determination for electronic interconnects.Type: ApplicationFiled: February 13, 2020Publication date: August 19, 2021Inventors: Matteo Maria Andreozzi, Michael Andrew Campbell, Giovanni Stea, Raffaele Zippo
-
Patent number: 10853138Abstract: Methods of scheduling usage of a resource between multiple resource users and corresponding schedulers are disclosed. The scheduling is performed by initially allocating a per-round usage allowance to each resource user of the multiple resource users and then determining a usage schedule for the resource in a sequence of rounds. At each round the determining comprises, for each resource user, when there are unscheduled usage requests for the resource user, scheduling a portion of the unscheduled usage requests which does not exceed the per-round usage allowance for the resource user, wherein the portion is scheduled for resource usage in association with the current round.Type: GrantFiled: September 4, 2018Date of Patent: December 1, 2020Assignee: Arm LimitedInventor: Matteo Maria Andreozzi
-
Publication number: 20200073715Abstract: Methods of scheduling usage of a resource between multiple resource users and corresponding schedulers are disclosed. The scheduling is performed by initially allocating a per-round usage allowance to each resource user of the multiple resource users and then determining a usage schedule for the resource in a sequence of rounds. At each round the determining comprises, for each resource user, when there are unscheduled usage requests for the resource user, scheduling a portion of the unscheduled usage requests which does not exceed the per-round usage allowance for the resource user, wherein the portion is scheduled for resource usage in association with the current round.Type: ApplicationFiled: September 4, 2018Publication date: March 5, 2020Inventor: Matteo Maria ANDREOZZI
-
Patent number: 9635681Abstract: A method scheduling resources allocation within a wireless communications network including at least one network cell including a central unit providing coverage over the network cell and managing at least one transmission frame for putting the central unit into communication with at least one user equipment.Type: GrantFiled: December 29, 2011Date of Patent: April 25, 2017Assignee: TELECOM ITALIA S.p.A.Inventors: Giovanni Accongiagioco, Matteo Maria Andreozzi, Marco Caretti, Roberto Fantini, Daniele Migliorini, Dario Sabella, Giovanni Stea
-
Patent number: 9107150Abstract: A method scheduling link activations within a wireless communications network including at least one network cell including a base station providing radio coverage over the network cell and at least one relay node putting the base station into communication with a user equipment within the network cell over an access link. The relay node communicates with the base station over a backhaul link. The method includes estimating, for the relay node, an access link capacity according to status information indicative of a status of the user equipment associated with the relay node, estimating a backhaul link capacity of the relay node according to the status information, and scheduling, for the relay node, either a backhaul link activation or an access link activation such that one of the backhaul link and access link is activated, in a predetermined time interval, based on a comparison between the access capacity and backhaul capacity.Type: GrantFiled: March 3, 2011Date of Patent: August 11, 2015Assignee: TELECOM ITALIA S.p.AInventors: Matteo Maria Andreozzi, Marco Caretti, Roberto Fantini, Daniele Migliorini, Vincenzo Maria Pii, Dario Sabella, Giovanni Stea
-
Patent number: 9036624Abstract: Data streams are transmitted from a node towards a receiver in a communication network in the form of data packets for playout via a reproduction buffer at the receiver. The data packets are arranged in a scheduling queue and dropped from the scheduling queue if their sojourn time in the queue exceeds a given drop deadline. The reproduction buffer is emulated at the node in order to determine respective playout values for the data packets which are indicative of expected playout instants for the data packets by the reproduction buffer at the receiver. The drop deadlines are assigned to the data packets as a function of the respective playout values determined via the reproduction buffer as emulated at the node.Type: GrantFiled: December 24, 2009Date of Patent: May 19, 2015Assignee: Telecom Italia S.p.A.Inventors: Dario Sabella, Marco Caretti, Matteo Maria Andreozzi, Giovanni Stea
-
Patent number: 8964867Abstract: A method executed in a wireless communication network including at least one base station associated to a corresponding area transmitting/receiving data to/from corresponding user terminals located within the area. The method generates a user-rate matrix for each base station. Each element of the user-rate matrix provides a corresponding score, in terms of achievable rate, to a user terminal or group of user terminals within the corresponding area when a transmission is made to/from the user terminal or group of user terminals, respectively, from/to the base station by employing a selected transmission mode. The method further processes the elements of the user-rate matrix to create a scheduling list sorting the elements by a decreasing score, and associating to each user terminal a corresponding selected transmission mode based on the scheduling list for the transmission/reception of data to/from the base station.Type: GrantFiled: March 3, 2011Date of Patent: February 24, 2015Assignee: TELECOM ITALIA S.p.A.Inventors: Matteo Maria Andreozzi, Marco Caretti, Roberto Fantini, Daniele Migliorini, Generoso Pagano, Dario Sabella, Giovanni Stea
-
Publication number: 20140355540Abstract: A method scheduling resources allocation within a wireless communications network including at least one network cell including a central unit providing coverage over the network cell and managing at least one transmission frame for putting the central unit into communication with at least one user equipment.Type: ApplicationFiled: December 29, 2011Publication date: December 4, 2014Applicant: TELECOM ITALIA S.p.A.Inventors: Giovanni Accongiagioco, Matteo Maria Andreozzi, Marco Caretti, Roberto Fantini, Daniele Migliorini, Dario Sabella, Giovanni Stea
-
Patent number: 8767760Abstract: In a communication network, a node receives from user equipment information on the length of a queue of information units to be transmitted to the node from the user equipment. The information, for possible use by the node in scheduling transmission of these information units from the user equipment, is in the form of quantized queue length information indicative of a lower bound and an upper bound for the queue length. Transmission of information units from the user equipment to the node is detected at the node, and an improved estimate of the queue length is produced by correcting the lower bound and the upper bound via subtraction of the number of the detected information units transmitted from the user equipment to the node.Type: GrantFiled: April 6, 2010Date of Patent: July 1, 2014Assignee: Telecom Italia S.p.A.Inventors: Matteo Maria Andreozzi, Marco Caretti, Daniele Franceschini, Roberto Rossi, Dario Sabella, Giovanni Stea
-
Publication number: 20130336200Abstract: A method scheduling link activations within a wireless communications network including at least one network cell including a base station providing radio coverage over the network cell and at least one relay node putting the base station into communication with a user equipment within the network cell over an access link. The relay node communicates with the base station over a backhaul link. The method includes estimating, for the relay node, an access link capacity according to status information indicative of a status of the user equipment associated with the relay node, estimating a backhaul link capacity of the relay node according to the status information, and scheduling, for the relay node, either a backhaul link activation or an access link activation such that one of the backhaul link and access link is activated, in a predetermined time interval, based on a comparison between the access capacity and backhaul capacity.Type: ApplicationFiled: March 3, 2011Publication date: December 19, 2013Applicant: Telecom Italia S.p.A.Inventors: Matteo Maria Andreozzi, Marco Caretti, Roberto Fantini, Daniele Migliorini, Vincenzo Maria Pii, Dario Sabella, Giovanni Stea
-
Publication number: 20130329826Abstract: A method executed in a wireless communication network including at least one base station associated to a corresponding area transmitting/receiving data to/from corresponding user terminals located within the area. The method generates a user-rate matrix for each base station. Each element of the user-rate matrix provides a corresponding score, in terms of achievable rate, to a user terminal or group of user terminals within the corresponding area when a transmission is made to/from the user terminal or group of user terminals, respectively, from/to the base station by employing a selected transmission mode. The method further processes the elements of the user-rate matrix to create a scheduling list sorting the elements by a decreasing score, and associating to each user terminal a corresponding selected transmission mode based on the scheduling list for the transmission/reception of data to/from the base station.Type: ApplicationFiled: March 3, 2011Publication date: December 12, 2013Applicant: TELECOM ITALIA S.P.A.Inventors: Matteo Maria Andreozzi, Marco Caretti, Roberto Fantini, Daniele Migliorini, Generoso Pagano, Dario Sabella, Giovanni Stea
-
Publication number: 20130028220Abstract: In a communication network, a node receives from user equipment information on the length of a queue of information units to be transmitted to the node from the user equipment. The information, for possible use by the node in scheduling transmission of these information units from the user equipment, is in the form of quantized queue length information indicative of a lower bound and an upper bound for the queue length. Transmission of information units from the user equipment to the node is detected at the node, and an improved estimate of the queue length is produced by correcting the lower bound and the upper bound via subtraction of the number of the detected information units transmitted from the user equipment to the node.Type: ApplicationFiled: April 6, 2010Publication date: January 31, 2013Inventors: Matteo Maria Andreozzi, Marco Caretti, Daniele Franceschini, Roberto Rossi, Dario Sabella, Giovanni Stea
-
Publication number: 20120250678Abstract: Data streams are transmitted from a node towards a receiver in a communication network in the form of data packets for playout via a reproduction buffer at the receiver. The data packets are arranged in a scheduling queue and dropped from the scheduling queue if their sojourn time in the queue exceeds a given drop deadline. The reproduction buffer is emulated at the node in order to determine respective playout values for the data packets which are indicative of expected playout instants for the data packets by the reproduction buffer at the receiver. The drop deadlines are assigned to the data packets as a function of the respective playout values determined via the reproduction buffer as emulated at the node.Type: ApplicationFiled: December 24, 2009Publication date: October 4, 2012Applicant: TELECOM ITALIA S.P.A.Inventors: Dario Sabella, Marco Caretti, Matteo Maria Andreozzi, Giovanni Stea