Patents by Inventor Nimrod Ben Simhon
Nimrod Ben Simhon 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: 11809384Abstract: Systems and methods are provided for optimizing data storage and improving the speed of data retrieval in a data store, such as a storage server connected to a large network through the use of bucketing techniques to create efficient data structures for storing received key-value datasets at one or more storage servers. Fast key-value read requests and key-value retrievals may be accomplished through the use of multiphase lookup operations on the one or more storage servers. The system is optimized for best performance of retrieval through the separation of the write and read mechanisms. Systems and methods provided herein control the level of wastefulness on the back end of a system and reduce read operation inefficiencies on the front end of a system.Type: GrantFiled: March 6, 2017Date of Patent: November 7, 2023Assignee: MICROSOFT TECHNOLOGY LICENSING, LLCInventors: Michael Feldman, Nir Nice, Nimrod Ben Simhon, Ayelet Kroskin
-
Publication number: 20230281061Abstract: The disclosed distributed task coordination ensures task execution while minimizing both the risk of duplicate execution and resources consumed for coordination. Execution is guaranteed, while only best efforts are used to avoid duplication. Example solutions include requesting, by a node, a first lease from a first set of nodes; based at least on obtaining at least one first lease, requesting, by the node, a second lease from a second set of nodes; based at least on the node obtaining at least one second lease, determining a majority holder of second leases; and based at least on obtaining the majority of second leases, executing, by the node, a task associated with the at least one second lease. In some examples, the nodes comprise online processing units (NPUs). In some examples, if a first node begins executing the task and fails, another node automatically takes over to ensure completion.Type: ApplicationFiled: May 12, 2023Publication date: September 7, 2023Inventors: Michael FELDMAN, Nimrod Ben SIMHON, Ayelet KROSKIN, Nir NICE
-
Patent number: 11687381Abstract: The disclosed distributed task coordination ensures task execution while minimizing both the risk of duplicate execution and resources consumed for coordination. Execution is guaranteed, while only best efforts are used to avoid duplication. Example solutions include requesting, by a node, a first lease from a first set of nodes; based at least on obtaining at least one first lease, requesting, by the node, a second lease from a second set of nodes; based at least on the node obtaining at least one second lease, determining a majority holder of second leases; and based at least on obtaining the majority of second leases, executing, by the node, a task associated with the at least one second lease. In some examples, the nodes comprise online processing units (NPUs). In some examples, if a first node begins executing the task and fails, another node automatically takes over to ensure completion.Type: GrantFiled: June 6, 2022Date of Patent: June 27, 2023Assignee: Microsoft Technology Licensing, LLCInventors: Michael Feldman, Nimrod Ben Simhon, Ayelet Kroskin, Nir Nice
-
Publication number: 20220300348Abstract: The disclosed distributed task coordination ensures task execution while minimizing both the risk of duplicate execution and resources consumed for coordination. Execution is guaranteed, while only best efforts are used to avoid duplication. Example solutions include requesting, by a node, a first lease from a first set of nodes; based at least on obtaining at least one first lease, requesting, by the node, a second lease from a second set of nodes; based at least on the node obtaining at least one second lease, determining a majority holder of second leases; and based at least on obtaining the majority of second leases, executing, by the node, a task associated with the at least one second lease. In some examples, the nodes comprise online processing units (NPUs). In some examples, if a first node begins executing the task and fails, another node automatically takes over to ensure completion.Type: ApplicationFiled: June 6, 2022Publication date: September 22, 2022Inventors: Michael FELDMAN, Nimrod Ben SIMHON, Ayelet KROSKIN, Nir NICE
-
Patent number: 11372690Abstract: The disclosed distributed task coordination ensures task execution while minimizing both the risk of duplicate execution and resources consumed for coordination. Execution is guaranteed, while only best efforts are used to avoid duplication. Example solutions include requesting, by a node, a first lease from a first set of nodes; based at least on obtaining at least one first lease, requesting, by the node, a second lease from a second set of nodes; based at least on the node obtaining at least one second lease, determining a majority holder of second leases; and based at least on obtaining the majority of second leases, executing, by the node, a task associated with the at least one second lease. In some examples, the nodes comprise online processing units (NPUs). In some examples, if a first node begins executing the task and fails, another node automatically takes over to ensure completion.Type: GrantFiled: October 3, 2019Date of Patent: June 28, 2022Assignee: Microsoft Technology Licensing, LLCInventors: Michael Feldman, Nimrod Ben Simhon, Ayelet Kroskin, Nir Nice
-
Publication number: 20210103482Abstract: The disclosed distributed task coordination ensures task execution while minimizing both the risk of duplicate execution and resources consumed for coordination. Execution is guaranteed, while only best efforts are used to avoid duplication. Example solutions include requesting, by a node, a first lease from a first set of nodes; based at least on obtaining at least one first lease, requesting, by the node, a second lease from a second set of nodes; based at least on the node obtaining at least one second lease, determining a majority holder of second leases; and based at least on obtaining the majority of second leases, executing, by the node, a task associated with the at least one second lease. In some examples, the nodes comprise online processing units (NPUs). In some examples, if a first node begins executing the task and fails, another node automatically takes over to ensure completion.Type: ApplicationFiled: October 3, 2019Publication date: April 8, 2021Inventors: Michael FELDMAN, Nimrod Ben SIMHON, Ayelet KROSKIN, Nir NICE
-
Patent number: 10242098Abstract: A playlist generator that utilizes multiple data sources to rank each track within a set of candidate tracks to enable selection of candidate tracks according to the ranking. Candidate tracks are each scored according to one or more features, such as acoustic similarity and/or similar usage patterns of the candidate track or artist of the candidate track to a current or previously played track or artist. Each feature is weighted according to historical listening patterns surrounding a user-selected playlist seed artist. The weighting may also be further corrected according to historical listening patterns of the particular user. When historical usage data related to a particular seed artist is limited, more generalized historical usage data related to a higher level in a genre hierarchy may be used.Type: GrantFiled: May 31, 2016Date of Patent: March 26, 2019Assignee: Microsoft Technology Licensing, LLCInventors: Noam Koenigstein, Nir Nice, Shay Ben Elazar, Yehiel Berezin, Oren Barkan, Tal Zaccai, Shimon Shlevich, Nimrod Ben Simhon, Paul Nogues, Gal Lavee
-
Publication number: 20180253449Abstract: Systems and methods are provided for optimizing data storage and improving the speed of data retrieval in a data store, such as a storage server connected to a large network through the use of bucketing techniques to create efficient data structures for storing received key-value datasets at one or more storage servers. Fast key-value read requests and key-value retrievals may be accomplished through the use of multiphase lookup operations on the one or more storage servers. The system is optimized for best performance of retrieval through the separation of the write and read mechanisms. Systems and methods provided herein control the level of wastefulness on the back end of a system and reduce read operation inefficiencies on the front end of a system.Type: ApplicationFiled: March 6, 2017Publication date: September 6, 2018Inventors: MICHAEL FELDMAN, NIR NICE, NIMROD BEN SIMHON, AYELET KROSKIN
-
Publication number: 20170344635Abstract: A playlist generator that utilizes multiple data sources to rank each track within a set of candidate tracks to enable selection of candidate tracks according to the ranking. Candidate tracks are each scored according to one or more features, such as acoustic similarity and/or similar usage patterns of the candidate track or artist of the candidate track to a current or previously played track or artist. Each feature is weighted according to historical listening patterns surrounding a user-selected playlist seed artist. The weighting may also be further corrected according to historical listening patterns of the particular user. When historical usage data related to a particular seed artist is limited, more generalized historical usage data related to a higher level in a genre hierarchy may be used.Type: ApplicationFiled: May 31, 2016Publication date: November 30, 2017Inventors: Noam Koenigstein, Nir Nice, Shay Ben Elazar, Yehiel Berezin, Oren Barkan, Tal Zaccai, Shimon Shlevich, Nimrod Ben Simhon, Paul Nogues, Gal Lavee