Search

Anthony R Saporito

from Bronx, NY
Age ~42
Get Report
Also known as:
Anthony R Sapporito
Phone and address:
5900 Arlington Ave APT 4D, Bronx, NY 10471
(718) 796-1534
Related to:
Brianna Saporito, 64Steven G Saporito, 48Jeanne W Saporito, 72Rose A SaporitoThomas J SaportioNancy A Esposito, 76Joseph J Esposito, 82Laura M Morano, 42Salvatore Saporito, 72Frank Williams, 44Gloria Thomas Williams, 86Grace WilliamsDonna M Corcione, 58Elizabeth M Esposito, 77
Connected to:
Ann W Saporito, 83Anthony J Saporita, 88Brendon Saporito, 56Carla A Saporito, 73Elizabeth T Saporito, 72Frances A Saporito, 102Jake A Saporito, 33Jane P Saporito, 95Joseph A Saporito, 53Joseph A Saporita, 79

Anthony Saporito Phones & Addresses

  • 5900 Arlington Ave APT 4D, Bronx, NY 10471 (718) 796-1534
  • 1000A Grant Ave, Bronx, NY 10456
  • Riverdale, NY
  • 2039 15Th St, Brooklyn, NY 11229 (718) 336-5425
  • Lakewood Ranch, FL
  • Southold, NY
  • Roslyn, NY
  • 5900 Arlington Ave APT 4D, Bronx, NY 10471

Emails

e***[email protected]

Resumes

Resumes

Anthony Saporito Photo 1

Franchise Broker

View page
Location:
Brooklyn, NY
Industry:
Telecommunications
Work:

Franchise Broker
Anthony Saporito Photo 2

Anthony Saporito

View page
Location:
New York, NY
Industry:
Restaurants
Languages:
Italian
Anthony Saporito Photo 3

Anthony Saporito

View page
Anthony Saporito Photo 4

Anthony Saporito

View page
Anthony Saporito Photo 5

Anthony Saporito

View page
Anthony Saporito Photo 6

Anthony Saporito

View page
Location:
United States
Anthony Saporito Photo 7

Anthony Saporito

View page

Publications

Us Patents

Reformatting Of Tensors To Provide Sub-Tensors

View page
US Patent:
20220405348, Dec 22, 2022
Filed:
Jun 17, 2021
Appl. No.:
17/350528
Inventors:
- Armonk NY, US
Kailash Gopalakrishnan - New York NY, US
Vijayalakshmi Srinivasan - New York NY, US
Anthony Saporito - Highland NY, US
Sunil K. Shukla - Scarsdale NY, US
Swagath Venkataramani - Yonkers NY, US
International Classification:
G06F 17/16
G06N 3/08
Abstract:
A tensor of a first select dimension is reformatted to provide one or more sub-tensors of a second select dimension. The reformatting includes determining a number of sub-tensors to be used to represent the tensor. The reformatting further includes creating the number of sub-tensors, in which a sub-tensor is to start on a boundary of a memory unit. Data of the tensor is rearranged to fit within the number of sub-tensors.

Skip-Over Offset Branch Prediction

View page
US Patent:
20200159537, May 21, 2020
Filed:
Nov 19, 2018
Appl. No.:
16/194452
Inventors:
- Armonk NY, US
Daniel Lipetz - Linden NJ, US
Brian Robert Prasky - Campbell Hall NY, US
Anthony Saporito - Highland NY, US
Adam Collura - Hopewell Junction NY, US
Steven J. Hnatko - Fishkill NY, US
International Classification:
G06F 9/38
G06F 9/30
G06F 9/355
Abstract:
A system includes a branch predictor and a processing circuit configured to perform a plurality of operations including storing a skip-over offset value in the branch predictor. The skip-over offset value defines a number of search addresses of the branch predictor to be skipped. The operations further include searching the branch predictor for a branch prediction. Responsive to finding the branch prediction, the searching of the branch predictor is re-indexed based on the skip-over offset value associated with the branch prediction.

Garbage Collection Facility Grouping Infrequently Accessed Data Units In Designated Transient Memory Area

View page
US Patent:
20180349273, Dec 6, 2018
Filed:
May 31, 2017
Appl. No.:
15/609469
Inventors:
- Armonk NY, US
Michael K. GSCHWIND - Chappaqua NY, US
Christian JACOBI - West Park NY, US
Younes MANTON - Toronto, CA
Anthony SAPORITO - Highland NY, US
Chung-Lung K. SHUM - Wappingers Falls NY, US
International Classification:
G06F 12/02
G06F 12/0802
Abstract:
A garbage collection facility is provided for memory management within a computer. The facility implements, in part, grouping of infrequently accessed data units in a designated transient memory area, and includes designating an area of the memory as a transient memory area and an area as a conventional memory area, and counting, for each data unit in the transient or conventional memory areas a number of accesses to the data unit. The counting provides a respective access count for each data unit. For each data unit in the transient memory area or the conventional memory area, a determination is made whether the respective access count is below a transient threshold ascertained to separate frequently accessed data units and infrequently used data units. Data units with respective access counts below the transient threshold are grouped together as transient data units within the transient memory area.

Garbage Collection Facility Grouping Infrequently Accessed Data Units In Designated Transient Memory Area

View page
US Patent:
20180349274, Dec 6, 2018
Filed:
Nov 22, 2017
Appl. No.:
15/820635
Inventors:
- Armonk NY, US
Michael K. GSCHWIND - Chappaqua NY, US
Christian JACOBI - West Park NY, US
Younes MANTON - Toronto, CA
Anthony SAPORITO - Highland NY, US
Chung-Lung K. SHUM - Wappingers Falls NY, US
International Classification:
G06F 12/02
G06F 12/0802
Abstract:
A garbage collection facility is provided for memory management within a computer. The facility implements, in part, grouping of infrequently accessed data units in a designated transient memory area, and includes designating an area of the memory as a transient memory area and an area as a conventional memory area, and counting, for each data unit in the transient or conventional memory areas a number of accesses to the data unit. The counting provides a respective access count for each data unit. For each data unit in the transient memory area or the conventional memory area, a determination is made whether the respective access count is below a transient threshold ascertained to separate frequently accessed data units and infrequently used data units. Data units with respective access counts below the transient threshold are grouped together as transient data units within the transient memory area.

Dynamic Thread Sharing In Branch Prediction Structures

View page
US Patent:
20180067747, Mar 8, 2018
Filed:
Nov 9, 2017
Appl. No.:
15/808398
Inventors:
- Armonk NY, US
Daniel Lipetz - Flushing NY, US
Brian R. Prasky - Campbell Hall NY, US
Anthony Saporito - Highland NY, US
International Classification:
G06F 9/38
G06F 9/30
Abstract:
Embodiments relate to multithreaded branch prediction. An aspect includes a system for dynamically evaluating how to share entries of a multithreaded branch prediction structure. The system includes a first-level branch target buffer coupled to a processor circuit. The processor circuit is configured to perform a method. The method includes receiving a search request to locate branch prediction information associated with the search request, and searching for an entry corresponding to the search request in the first-level branch prediction structure. The entry is not allowed based on a thread state of the entry indicating that the entry has caused a problem on a thread associated with the thread state.

Host Page Management Using Active Guest Page Table Indicators

View page
US Patent:
20180067868, Mar 8, 2018
Filed:
Nov 2, 2017
Appl. No.:
15/801360
Inventors:
- Armonk NY, US
Michael K. Gschwind - Chappaqua NY, US
Lisa Cranton Heller - Rhinebeck NY, US
Christian Jacobi - Poughkeepsie NY, US
Damian L. Osisek - Vestal NY, US
Anthony Saporito - Highland NY, US
International Classification:
G06F 12/1027
G06F 12/121
Abstract:
A marking capability is used to provide an indication of whether a block of memory is being used by a guest control program to back an address translation structure. The marking capability includes setting an indicator in one or more locations associated with the block of memory. In a further aspect, the marking capability includes an invalidation facility based on the setting of the indicators.

Instruction To Query Cache Residency

View page
US Patent:
20180060241, Mar 1, 2018
Filed:
Nov 6, 2017
Appl. No.:
15/804574
Inventors:
- Armonk NY, US
Michael K. Gschwind - Chappaqua NY, US
Christian Jacobi - Poughkeepsie NY, US
Anthony Saporito - Highland NY, US
Chung-Lung K. Shum - Wappingers Falls NY, US
Timothy J. Slegel - Staatsburg NY, US
International Classification:
G06F 12/0875
G06F 12/0811
G06F 9/30
G06F 12/0862
G06F 12/084
Abstract:
A query is performed to obtain cache residency and/or other information regarding selected data. The data to be queried is data of a cache line, prefetched or otherwise. The capability includes a Query Cache instruction that obtains cache residency information and/or other information and returns an indication of the requested information.

Managing A Prefetch Queue Based On Priority Indications Of Prefetch Requests

View page
US Patent:
20180024929, Jan 25, 2018
Filed:
Jul 20, 2016
Appl. No.:
15/214549
Inventors:
- Armonk NY, US
Michael K. Gschwind - Chappaqua NY, US
Christian Jacobi - Poughkeepsie NY, US
Anthony Saporito - Highland NY, US
Chung-Lung K. Shum - Wappingers Falls NY, US
Timothy J. Slegel - Staatsburg NY, US
International Classification:
G06F 12/0862
G06F 12/0875
Abstract:
A prefetch request having a priority assigned thereto is obtained, based on executing a prefetch instruction included within a program. Based on obtaining the prefetch request, a determination is made as to whether the prefetch request may be placed on a prefetch queue. This determination includes determining whether the prefetch queue is full; checking, based on determining the prefetch queue is full, whether the priority of the prefetch request is considered a high priority; determining, based on the checking indicating the priority of the prefetch request is considered a high priority, whether another prefetch request on the prefetch queue may be removed; removing the other prefetch request from the prefetch queue, based on determining the other prefetch request may be removed; and adding the prefetch request to the prefetch queue, based on removing the other prefetch request.
Control profile
Anthony R Saporito from Bronx, NY, age ~42 Get Report