Patents by Inventor Joseph Naor
Joseph Naor 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: 11474945Abstract: Methods, systems, apparatuses, and computer program products are provided for prefetching data. A workload analyzer may identify job characteristics for a plurality of previously executed jobs in a workload executing on a cluster of one or more compute resources. For each job, identified job characteristics may include identification of an input dataset and an input bandwidth characteristic for the input dataset. A future workload predictor may identify future jobs expected to execute on the cluster based at least on the identified job characteristics. A cache assignment determiner may determine a cache assignment that identifies a prefetch dataset for at least one of the future jobs. A network bandwidth allocator may determine a network bandwidth assignment for the prefetch dataset. A plan instructor may instruct a compute resource of the cluster to load data to a cache local to the cluster according to the cache assignment and the network bandwidth assignment.Type: GrantFiled: June 2, 2021Date of Patent: October 18, 2022Assignee: MICROSOFT TECHNOLOGY LICENSING, LLCInventors: Virajith Jalaparti, Sriram S. Rao, Christopher W. Douglas, Ashvin Agrawal, Avrilia Floratou, Ishai Menache, Srikanth Kandula, Mainak Ghosh, Joseph Naor
-
Publication number: 20210286728Abstract: Methods, systems, apparatuses, and computer program products are provided for prefetching data. A workload analyzer may identify job characteristics for a plurality of previously executed jobs in a workload executing on a cluster of one or more compute resources. For each job, identified job characteristics may include identification of an input dataset and an input bandwidth characteristic for the input dataset. A future workload predictor may identify future jobs expected to execute on the cluster based at least on the identified job characteristics. A cache assignment determiner may determine a cache assignment that identifies a prefetch dataset for at least one of the future jobs. A network bandwidth allocator may determine a network bandwidth assignment for the prefetch dataset. A plan instructor may instruct a compute resource of the cluster to load data to a cache local to the cluster according to the cache assignment and the network bandwidth assignment.Type: ApplicationFiled: June 2, 2021Publication date: September 16, 2021Inventors: Virajith Jalaparti, Sriram S. Rao, Christopher W. Douglas, Ashvin Agrawal, Avrilia Floratou, Ishai Menache, Srikanth Kandula, Mainak Ghosh, Joseph Naor
-
Patent number: 11055225Abstract: Methods, systems, apparatuses, and computer program products are provided for prefetching data. A workload analyzer may identify job characteristics for a plurality of previously executed jobs in a workload executing on a cluster of one or more compute resources. For each job, identified job characteristics may include identification of an input dataset and an input bandwidth characteristic for the input dataset. A future workload predictor may identify future jobs expected to execute on the cluster based at least on the identified job characteristics. A cache assignment determiner may determine a cache assignment that identifies a prefetch dataset for at least one of the future jobs. A network bandwidth allocator may determine a network bandwidth assignment for the prefetch dataset. A plan instructor may instruct a compute resource of the cluster to load data to a cache local to the cluster according to the cache assignment and the network bandwidth assignment.Type: GrantFiled: October 22, 2019Date of Patent: July 6, 2021Assignee: MICROSOFT TECHNOLOGY LICENSING, LLCInventors: Virajith Jalaparti, Sriram S. Rao, Christopher W. Douglas, Ashvin Agrawal, Avrilia Floratou, Ishai Menache, Srikanth Kandula, Mainak Ghosh, Joseph Naor
-
Publication number: 20210096996Abstract: Methods, systems, apparatuses, and computer program products are provided for prefetching data. A workload analyzer may identify job characteristics for a plurality of previously executed jobs in a workload executing on a cluster of one or more compute resources. For each job, identified job characteristics may include identification of an input dataset and an input bandwidth characteristic for the input dataset. A future workload predictor may identify future jobs expected to execute on the cluster based at least on the identified job characteristics. A cache assignment determiner may determine a cache assignment that identifies a prefetch dataset for at least one of the future jobs. A network bandwidth allocator may determine a network bandwidth assignment for the prefetch dataset. A plan instructor may instruct a compute resource of the cluster to load data to a cache local to the cluster according to the cache assignment and the network bandwidth assignment.Type: ApplicationFiled: October 22, 2019Publication date: April 1, 2021Inventors: Virajith Jalaparti, Sriram S. Rao, Christopher W. Douglas, Ashvin Agrawal, Avrilia Floratou, Ishai Menache, Srikanth Kandula, Mainak Ghosh, Joseph Naor
-
Patent number: 8797851Abstract: A method of locating traffic reduction entities in a communication network, optionally where at least one reduction entity is located within each network path which allows traffic flow between endpoints and central stations. The method comprises assigning a plurality of allocation cost values each estimating cost of locating of one of a plurality of traffic reduction entities on one of a plurality of intermediate nodes of a communication network, calculating a plurality of excess load cost values each calculated according to excess load cost between two adjacent intermediate nodes of the plurality of intermediate nodes, identifying a node set selected from the plurality of intermediate nodes using a target function based on the plurality of cost values and the plurality of excess load cost values, and outputting instructions for locating the plurality of traffic reduction entities on the communication network according to the node set.Type: GrantFiled: April 18, 2012Date of Patent: August 5, 2014Assignee: International Business Machines CorporationInventors: Liane Lewin-Eytan, Joseph Naor
-
Publication number: 20130279327Abstract: A method of locating traffic reduction entities in a communication network, optionally where at least one reduction entity is located within each network path which allows traffic flow between endpoints and central stations. The method comprises assigning a plurality of allocation cost values each estimating cost of locating of one of a plurality of traffic reduction entities on one of a plurality of intermediate nodes of a communication network, calculating a plurality of excess load cost values each calculated according to excess load cost between two adjacent intermediate nodes of the plurality of intermediate nodes, identifying a node set selected from the plurality of intermediate nodes using a target function based on the plurality of cost values and the plurality of excess load cost values, and outputting instructions for locating the plurality of traffic reduction entities on the communication network according to the node set.Type: ApplicationFiled: April 18, 2012Publication date: October 24, 2013Applicant: International Business Machines CorporationInventors: Liane Lewin-Eytan, Joseph Naor
-
Publication number: 20130179371Abstract: A plurality of requests for execution of computing jobs on one or more devices that include a plurality of computing resources may be obtained, the one or more devices configured to flexibly allocate the plurality of computing resources, each of the computing jobs including job completion values representing a worth to a respective user that is associated with execution completion times of each respective computing job. The computing resources may be scheduled based on the job completion values associated with each respective computing job.Type: ApplicationFiled: January 5, 2012Publication date: July 11, 2013Applicant: MICROSOFT CORPORATIONInventors: Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv
-
Patent number: 7327679Abstract: An upstream bandwidth allocation scheduler is provided for use within a Line Termination (LT) unit in a point to multi-point data communications network in order to service multiple Network Termination (NT) units. The scheduler first allocates bandwidth among the several categories of data handled by the network (e.g., voice, IP, and ATM data), and then allocates bandwidth among the several users for each category within the network. A function ƒ is defined, as part of a “min-max weighted fairness” scheme, in order to allocate surplus bandwidth among both the categories and users of the network. The scheduler of the present invention, while allocating upstream bandwidth, also supports various quality of service (QoS) categories to subscribers of the network.Type: GrantFiled: August 16, 2002Date of Patent: February 5, 2008Assignee: Broad-Light, Ltd.Inventors: Joseph Naor, Raphael J. Rom, David Ivancovsky
-
Patent number: 7194276Abstract: Rounded solutions of a linear program are used to partition or group cells, such as cells in a wireless network, in order to provide efficient approximations of network updating and paging costs.Type: GrantFiled: September 15, 2003Date of Patent: March 20, 2007Assignee: Lucent Technologies Inc.Inventors: Yigal Bejerano, Nicole S. Immorlica, Joseph Naor, Mark Anthony Shawn Smith
-
Publication number: 20060067243Abstract: A method comprises allocating a respective restoration path to protect each of a plurality of primary paths in a network. Each primary path has a plurality of nodes and at least two subpaths connecting the nodes of the primary path. Each restoration path includes at least one link. Each link protects at least one of the subpaths of the primary path. Each of the subpaths of the primary path is protected. None of the links in the restoration path is included in the corresponding primary path. At least one of the links is shared among at least two restoration paths corresponding to at least two of the primary paths.Type: ApplicationFiled: September 30, 2004Publication date: March 30, 2006Inventors: Yigal Bejerano, Joseph Naor, Alexander Sprintson
-
Publication number: 20050059404Abstract: Rounded solutions of a linear program are used to partition or group cells, such as cells in a wireless network, in order to provide efficient approximations of network updating and paging costs.Type: ApplicationFiled: September 15, 2003Publication date: March 17, 2005Inventors: Yigal Bejerano, Nicole Immorlica, Joseph Naor, Mark Smith
-
Publication number: 20030081626Abstract: An upstream bandwidth allocation scheduler is provided for use within a Line Termination (LT) unit in a point to multi-point data communications network in order to service multiple Network Termination (NT) units. The scheduler first allocates bandwidth among the several categories of data handled by the network (e.g., voice, IP, and ATM data), and then allocates bandwidth among the several users for each category within the network. A function ƒ is defined, as part of a “min-max weighted fairness” scheme, in order to allocate surplus bandwidth among both the categories and users of the network. The scheduler of the present invention, while allocating upstream bandwidth, also supports various quality of service (QoS) categories to subscribers of the network.Type: ApplicationFiled: August 16, 2002Publication date: May 1, 2003Inventors: Joseph Naor, Raphael J. Rom, David Ivancovsky